java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:50:18,986 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:50:18,988 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:50:19,000 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:50:19,000 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:50:19,002 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:50:19,003 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:50:19,006 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:50:19,007 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:50:19,014 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:50:19,015 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:50:19,015 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:50:19,016 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:50:19,019 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:50:19,022 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:50:19,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:50:19,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:50:19,027 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:50:19,032 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:50:19,034 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:50:19,035 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:50:19,036 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:50:19,038 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:50:19,038 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:50:19,040 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:50:19,041 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:50:19,042 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:50:19,043 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:50:19,043 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:50:19,046 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:50:19,046 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:50:19,047 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:50:19,047 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:50:19,047 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:50:19,048 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:50:19,049 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:50:19,049 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:50:19,074 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:50:19,075 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:50:19,076 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:50:19,078 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:50:19,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:50:19,079 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:50:19,079 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:50:19,079 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:50:19,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:50:19,157 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:50:19,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:50:19,162 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:50:19,163 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:50:19,164 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl [2018-07-25 08:50:19,164 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl' [2018-07-25 08:50:19,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:50:19,208 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:50:19,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:50:19,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:50:19,210 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:50:19,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:19" (1/1) ... [2018-07-25 08:50:19,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:19" (1/1) ... [2018-07-25 08:50:19,247 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 08:50:19,247 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 08:50:19,247 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 08:50:19,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:50:19,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:50:19,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:50:19,251 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:50:19,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:19" (1/1) ... [2018-07-25 08:50:19,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:19" (1/1) ... [2018-07-25 08:50:19,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:19" (1/1) ... [2018-07-25 08:50:19,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:19" (1/1) ... [2018-07-25 08:50:19,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:19" (1/1) ... [2018-07-25 08:50:19,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:19" (1/1) ... [2018-07-25 08:50:19,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:19" (1/1) ... [2018-07-25 08:50:19,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:50:19,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:50:19,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:50:19,273 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:50:19,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:19" (1/1) ... [2018-07-25 08:50:19,360 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-25 08:50:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-25 08:50:19,360 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-25 08:50:19,481 INFO L270 CfgBuilder]: Using library mode [2018-07-25 08:50:19,482 INFO L202 PluginConnector]: Adding new model AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:50:19 BoogieIcfgContainer [2018-07-25 08:50:19,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:50:19,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:50:19,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:50:19,487 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:50:19,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:50:19" (1/2) ... [2018-07-25 08:50:19,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236403b6 and model type AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:50:19, skipping insertion in model container [2018-07-25 08:50:19,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:50:19" (2/2) ... [2018-07-25 08:50:19,491 INFO L112 eAbstractionObserver]: Analyzing ICFG AnnoyingVillain.bpl [2018-07-25 08:50:19,501 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:50:19,510 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:50:19,559 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:50:19,560 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:50:19,560 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:50:19,560 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:50:19,561 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:50:19,561 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:50:19,561 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:50:19,561 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:50:19,562 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:50:19,576 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 08:50:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 08:50:19,585 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:19,586 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 08:50:19,587 INFO L415 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:19,592 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-07-25 08:50:19,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:19,681 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:50:19,681 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-07-25 08:50:19,686 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:50:19,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:50:19,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:50:19,704 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 08:50:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:19,737 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-07-25 08:50:19,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:50:19,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-25 08:50:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:19,750 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:50:19,751 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 08:50:19,754 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:50:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 08:50:19,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 08:50:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 08:50:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 08:50:19,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 08:50:19,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:19,796 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 08:50:19,796 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:50:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 08:50:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:50:19,797 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:19,797 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 08:50:19,798 INFO L415 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:19,798 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-07-25 08:50:19,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:19,848 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:19,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 08:50:19,850 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:50:19,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:50:19,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:50:19,851 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-25 08:50:19,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:19,872 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 08:50:19,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:50:19,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 08:50:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:19,873 INFO L225 Difference]: With dead ends: 8 [2018-07-25 08:50:19,874 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 08:50:19,875 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:50:19,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 08:50:19,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 08:50:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 08:50:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 08:50:19,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 08:50:19,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:19,878 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 08:50:19,879 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:50:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 08:50:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 08:50:19,879 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:19,880 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-25 08:50:19,880 INFO L415 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:19,880 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-07-25 08:50:19,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:19,961 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:19,961 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:50:19,962 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:50:19,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:50:19,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:50:19,963 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-25 08:50:19,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:19,999 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 08:50:19,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:50:19,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 08:50:20,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:20,000 INFO L225 Difference]: With dead ends: 9 [2018-07-25 08:50:20,000 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 08:50:20,001 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:50:20,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 08:50:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 08:50:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 08:50:20,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 08:50:20,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 08:50:20,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:20,005 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 08:50:20,005 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:50:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 08:50:20,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:50:20,005 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:20,006 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-25 08:50:20,006 INFO L415 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:20,006 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-07-25 08:50:20,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:20,066 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:20,067 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:50:20,067 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:50:20,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:50:20,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:50:20,068 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 08:50:20,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:20,097 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 08:50:20,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:50:20,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 08:50:20,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:20,098 INFO L225 Difference]: With dead ends: 10 [2018-07-25 08:50:20,099 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 08:50:20,099 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:50:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 08:50:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 08:50:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 08:50:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 08:50:20,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 08:50:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:20,103 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 08:50:20,103 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:50:20,103 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 08:50:20,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 08:50:20,104 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:20,104 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-25 08:50:20,105 INFO L415 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:20,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-07-25 08:50:20,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:20,203 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:20,203 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:50:20,203 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:50:20,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:50:20,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:50:20,204 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-25 08:50:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:20,259 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 08:50:20,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:50:20,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 08:50:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:20,260 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:50:20,260 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 08:50:20,261 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:50:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 08:50:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 08:50:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 08:50:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 08:50:20,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 08:50:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:20,265 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 08:50:20,265 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:50:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 08:50:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:50:20,266 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:20,266 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-25 08:50:20,266 INFO L415 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:20,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-07-25 08:50:20,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:20,352 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:20,352 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:50:20,353 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:50:20,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:50:20,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:50:20,354 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-25 08:50:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:20,421 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 08:50:20,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 08:50:20,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 08:50:20,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:20,423 INFO L225 Difference]: With dead ends: 12 [2018-07-25 08:50:20,423 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 08:50:20,424 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:50:20,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 08:50:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 08:50:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 08:50:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 08:50:20,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 08:50:20,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:20,436 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 08:50:20,436 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:50:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 08:50:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 08:50:20,437 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:20,437 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-25 08:50:20,438 INFO L415 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:20,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-07-25 08:50:20,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:20,526 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:20,526 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:50:20,528 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:50:20,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:50:20,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:50:20,529 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-25 08:50:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:20,582 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 08:50:20,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:50:20,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 08:50:20,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:20,584 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:50:20,584 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:50:20,586 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:50:20,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:50:20,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:50:20,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:50:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 08:50:20,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 08:50:20,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:20,595 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 08:50:20,595 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:50:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 08:50:20,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:50:20,596 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:20,596 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-25 08:50:20,597 INFO L415 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:20,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-07-25 08:50:20,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:20,691 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:20,691 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:50:20,692 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:50:20,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:50:20,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:50:20,696 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-25 08:50:20,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:20,754 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 08:50:20,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:50:20,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-25 08:50:20,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:20,756 INFO L225 Difference]: With dead ends: 14 [2018-07-25 08:50:20,756 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 08:50:20,757 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:50:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 08:50:20,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 08:50:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 08:50:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 08:50:20,766 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 08:50:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:20,766 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 08:50:20,767 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:50:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 08:50:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 08:50:20,768 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:20,768 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-25 08:50:20,771 INFO L415 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:20,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-07-25 08:50:20,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:20,838 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:20,838 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:50:20,838 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:50:20,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:50:20,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:50:20,840 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-25 08:50:20,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:20,882 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 08:50:20,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:50:20,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-25 08:50:20,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:20,883 INFO L225 Difference]: With dead ends: 15 [2018-07-25 08:50:20,884 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 08:50:20,884 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:50:20,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 08:50:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 08:50:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 08:50:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 08:50:20,889 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 08:50:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:20,889 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 08:50:20,889 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:50:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 08:50:20,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:50:20,890 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:20,890 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-25 08:50:20,891 INFO L415 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:20,891 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-07-25 08:50:20,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:20,950 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:20,950 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:50:20,951 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:50:20,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:50:20,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:50:20,952 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-25 08:50:20,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:20,994 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 08:50:20,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:50:20,995 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-25 08:50:20,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:20,995 INFO L225 Difference]: With dead ends: 16 [2018-07-25 08:50:20,996 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 08:50:20,996 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:50:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 08:50:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 08:50:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 08:50:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 08:50:21,000 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 08:50:21,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:21,001 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 08:50:21,001 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:50:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 08:50:21,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 08:50:21,002 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:21,002 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-25 08:50:21,002 INFO L415 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-07-25 08:50:21,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:21,069 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:21,069 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:50:21,069 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:50:21,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:50:21,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:50:21,070 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-25 08:50:21,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:21,125 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 08:50:21,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:50:21,126 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-25 08:50:21,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:21,127 INFO L225 Difference]: With dead ends: 17 [2018-07-25 08:50:21,127 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:50:21,128 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:50:21,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:50:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:50:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:50:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 08:50:21,136 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 08:50:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:21,136 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 08:50:21,137 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:50:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 08:50:21,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:50:21,138 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:21,138 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-25 08:50:21,139 INFO L415 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:21,139 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-07-25 08:50:21,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:21,226 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:21,227 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:50:21,227 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:50:21,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:50:21,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:50:21,228 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-25 08:50:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:21,292 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 08:50:21,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:50:21,292 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-25 08:50:21,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:21,294 INFO L225 Difference]: With dead ends: 18 [2018-07-25 08:50:21,294 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 08:50:21,295 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:50:21,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 08:50:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 08:50:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 08:50:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 08:50:21,301 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 08:50:21,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:21,302 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 08:50:21,302 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:50:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 08:50:21,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:50:21,303 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:21,303 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-25 08:50:21,305 INFO L415 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:21,305 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-07-25 08:50:21,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:21,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:21,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:50:21,394 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:50:21,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:50:21,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:50:21,395 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-07-25 08:50:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:21,459 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 08:50:21,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:50:21,459 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-07-25 08:50:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:21,460 INFO L225 Difference]: With dead ends: 19 [2018-07-25 08:50:21,460 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 08:50:21,461 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:50:21,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 08:50:21,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 08:50:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 08:50:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 08:50:21,470 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-25 08:50:21,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:21,471 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 08:50:21,471 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:50:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 08:50:21,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:50:21,472 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:21,472 INFO L354 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-07-25 08:50:21,472 INFO L415 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:21,473 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-07-25 08:50:21,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:21,605 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:21,605 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:50:21,606 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:50:21,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:50:21,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:50:21,607 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-07-25 08:50:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:21,680 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 08:50:21,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:50:21,681 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-07-25 08:50:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:21,681 INFO L225 Difference]: With dead ends: 20 [2018-07-25 08:50:21,681 INFO L226 Difference]: Without dead ends: 18 [2018-07-25 08:50:21,682 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:50:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-25 08:50:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-25 08:50:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 08:50:21,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 08:50:21,689 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-25 08:50:21,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:21,690 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 08:50:21,690 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:50:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 08:50:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 08:50:21,690 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:21,691 INFO L354 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-07-25 08:50:21,691 INFO L415 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:21,691 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-07-25 08:50:21,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:21,815 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:21,815 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 08:50:21,816 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 08:50:21,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 08:50:21,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:50:21,817 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-07-25 08:50:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:21,908 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 08:50:21,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:50:21,909 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-07-25 08:50:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:21,911 INFO L225 Difference]: With dead ends: 21 [2018-07-25 08:50:21,912 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 08:50:21,912 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:50:21,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 08:50:21,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 08:50:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 08:50:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 08:50:21,918 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-25 08:50:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:21,918 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 08:50:21,919 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 08:50:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 08:50:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:50:21,922 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:21,922 INFO L354 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-07-25 08:50:21,922 INFO L415 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:21,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-07-25 08:50:21,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:22,052 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:22,053 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:22,053 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 08:50:22,053 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 08:50:22,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 08:50:22,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:50:22,054 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-07-25 08:50:22,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:22,148 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 08:50:22,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:50:22,149 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-07-25 08:50:22,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:22,149 INFO L225 Difference]: With dead ends: 22 [2018-07-25 08:50:22,149 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 08:50:22,150 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:50:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 08:50:22,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 08:50:22,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 08:50:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 08:50:22,156 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-25 08:50:22,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:22,159 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 08:50:22,159 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 08:50:22,159 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 08:50:22,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 08:50:22,160 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:22,160 INFO L354 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-07-25 08:50:22,160 INFO L415 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:22,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2018-07-25 08:50:22,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:22,300 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:22,300 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 08:50:22,301 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 08:50:22,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 08:50:22,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:50:22,302 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-07-25 08:50:22,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:22,404 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 08:50:22,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:50:22,404 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-07-25 08:50:22,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:22,405 INFO L225 Difference]: With dead ends: 23 [2018-07-25 08:50:22,405 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 08:50:22,406 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:50:22,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 08:50:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 08:50:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 08:50:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 08:50:22,413 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-25 08:50:22,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:22,413 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 08:50:22,414 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 08:50:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 08:50:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:50:22,414 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:22,415 INFO L354 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-07-25 08:50:22,415 INFO L415 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:22,415 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2018-07-25 08:50:22,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:22,573 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:22,573 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 08:50:22,574 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 08:50:22,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 08:50:22,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:50:22,575 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-07-25 08:50:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:22,676 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-25 08:50:22,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:50:22,677 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-07-25 08:50:22,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:22,678 INFO L225 Difference]: With dead ends: 24 [2018-07-25 08:50:22,678 INFO L226 Difference]: Without dead ends: 22 [2018-07-25 08:50:22,678 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:50:22,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-25 08:50:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-25 08:50:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 08:50:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-25 08:50:22,684 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-25 08:50:22,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:22,684 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-25 08:50:22,685 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 08:50:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-25 08:50:22,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 08:50:22,686 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:22,686 INFO L354 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-07-25 08:50:22,687 INFO L415 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:22,687 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2018-07-25 08:50:22,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:22,848 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:22,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 08:50:22,849 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 08:50:22,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 08:50:22,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:50:22,850 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-07-25 08:50:22,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:22,965 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 08:50:22,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:50:22,965 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-07-25 08:50:22,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:22,966 INFO L225 Difference]: With dead ends: 25 [2018-07-25 08:50:22,966 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 08:50:22,967 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:50:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 08:50:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 08:50:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 08:50:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 08:50:22,971 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-25 08:50:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:22,971 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 08:50:22,972 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 08:50:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 08:50:22,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:50:22,972 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:22,973 INFO L354 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-07-25 08:50:22,973 INFO L415 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:22,973 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2018-07-25 08:50:22,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:23,132 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:23,132 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 08:50:23,132 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 08:50:23,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 08:50:23,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:50:23,133 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-07-25 08:50:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:23,299 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-25 08:50:23,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:50:23,299 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-07-25 08:50:23,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:23,300 INFO L225 Difference]: With dead ends: 26 [2018-07-25 08:50:23,300 INFO L226 Difference]: Without dead ends: 24 [2018-07-25 08:50:23,301 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:50:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-25 08:50:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-25 08:50:23,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 08:50:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-25 08:50:23,305 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-25 08:50:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:23,305 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-25 08:50:23,305 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 08:50:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-25 08:50:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:50:23,306 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:23,306 INFO L354 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-07-25 08:50:23,307 INFO L415 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:23,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2018-07-25 08:50:23,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:23,483 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:23,483 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 08:50:23,483 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 08:50:23,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 08:50:23,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:50:23,484 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-07-25 08:50:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:23,611 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 08:50:23,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:50:23,611 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-07-25 08:50:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:23,612 INFO L225 Difference]: With dead ends: 27 [2018-07-25 08:50:23,612 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 08:50:23,613 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:50:23,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 08:50:23,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 08:50:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 08:50:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 08:50:23,617 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-25 08:50:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:23,617 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 08:50:23,617 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 08:50:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 08:50:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 08:50:23,618 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:23,618 INFO L354 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-07-25 08:50:23,618 INFO L415 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:23,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2018-07-25 08:50:23,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:23,807 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:23,807 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 08:50:23,807 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 08:50:23,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 08:50:23,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:50:23,808 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-07-25 08:50:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:23,947 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-25 08:50:23,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:50:23,947 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-07-25 08:50:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:23,948 INFO L225 Difference]: With dead ends: 28 [2018-07-25 08:50:23,948 INFO L226 Difference]: Without dead ends: 26 [2018-07-25 08:50:23,949 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:50:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-25 08:50:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-25 08:50:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 08:50:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 08:50:23,952 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-25 08:50:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:23,953 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 08:50:23,953 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 08:50:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 08:50:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 08:50:23,954 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:23,954 INFO L354 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-07-25 08:50:23,954 INFO L415 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:23,954 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2018-07-25 08:50:23,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:24,170 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:24,170 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 08:50:24,171 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 08:50:24,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 08:50:24,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:50:24,172 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-07-25 08:50:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:24,317 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 08:50:24,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 08:50:24,317 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-07-25 08:50:24,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:24,318 INFO L225 Difference]: With dead ends: 29 [2018-07-25 08:50:24,318 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 08:50:24,318 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:50:24,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 08:50:24,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 08:50:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 08:50:24,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 08:50:24,324 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-25 08:50:24,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:24,325 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 08:50:24,325 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 08:50:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 08:50:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 08:50:24,327 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:24,327 INFO L354 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-07-25 08:50:24,328 INFO L415 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:24,328 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2018-07-25 08:50:24,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:24,526 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:24,526 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 08:50:24,526 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 08:50:24,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 08:50:24,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:50:24,527 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-07-25 08:50:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:24,674 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 08:50:24,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:50:24,675 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-07-25 08:50:24,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:24,675 INFO L225 Difference]: With dead ends: 30 [2018-07-25 08:50:24,675 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 08:50:24,676 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:50:24,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 08:50:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-25 08:50:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 08:50:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-25 08:50:24,680 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-25 08:50:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:24,680 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-25 08:50:24,680 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 08:50:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-25 08:50:24,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-25 08:50:24,681 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:24,681 INFO L354 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-07-25 08:50:24,682 INFO L415 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:24,682 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2018-07-25 08:50:24,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:24,887 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:24,887 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 08:50:24,888 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 08:50:24,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 08:50:24,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:50:24,889 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-07-25 08:50:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:25,052 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 08:50:25,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:50:25,052 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-07-25 08:50:25,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:25,053 INFO L225 Difference]: With dead ends: 31 [2018-07-25 08:50:25,053 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 08:50:25,054 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:50:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 08:50:25,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 08:50:25,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 08:50:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 08:50:25,060 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-25 08:50:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:25,060 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 08:50:25,060 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 08:50:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 08:50:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 08:50:25,061 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:25,061 INFO L354 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-07-25 08:50:25,064 INFO L415 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:25,064 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2018-07-25 08:50:25,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:25,290 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:25,290 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 08:50:25,290 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 08:50:25,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 08:50:25,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:50:25,293 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-07-25 08:50:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:25,453 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-25 08:50:25,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:50:25,453 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-07-25 08:50:25,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:25,454 INFO L225 Difference]: With dead ends: 32 [2018-07-25 08:50:25,454 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 08:50:25,455 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:50:25,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 08:50:25,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-25 08:50:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 08:50:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-25 08:50:25,459 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-25 08:50:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:25,459 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-25 08:50:25,459 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 08:50:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-25 08:50:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 08:50:25,460 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:25,460 INFO L354 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-07-25 08:50:25,460 INFO L415 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:25,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2018-07-25 08:50:25,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:25,688 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:25,688 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 08:50:25,688 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 08:50:25,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 08:50:25,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:50:25,690 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-07-25 08:50:25,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:25,881 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 08:50:25,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:50:25,881 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-07-25 08:50:25,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:25,882 INFO L225 Difference]: With dead ends: 33 [2018-07-25 08:50:25,882 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 08:50:25,883 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:50:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 08:50:25,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 08:50:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 08:50:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 08:50:25,888 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-25 08:50:25,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:25,889 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 08:50:25,889 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 08:50:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 08:50:25,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 08:50:25,890 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:25,890 INFO L354 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-07-25 08:50:25,890 INFO L415 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:25,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2018-07-25 08:50:25,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:26,165 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:26,165 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 08:50:26,165 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 08:50:26,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 08:50:26,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:50:26,169 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-07-25 08:50:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:26,336 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-25 08:50:26,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:50:26,337 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-07-25 08:50:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:26,337 INFO L225 Difference]: With dead ends: 34 [2018-07-25 08:50:26,337 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 08:50:26,338 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:50:26,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 08:50:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 08:50:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 08:50:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-25 08:50:26,342 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-25 08:50:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:26,342 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-25 08:50:26,342 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 08:50:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-25 08:50:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 08:50:26,343 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:26,343 INFO L354 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-07-25 08:50:26,343 INFO L415 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:26,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2018-07-25 08:50:26,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:26,551 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:26,552 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 08:50:26,552 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 08:50:26,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 08:50:26,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:50:26,553 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-07-25 08:50:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:26,727 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 08:50:26,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:50:26,728 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-07-25 08:50:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:26,728 INFO L225 Difference]: With dead ends: 35 [2018-07-25 08:50:26,728 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 08:50:26,729 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:50:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 08:50:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 08:50:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 08:50:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 08:50:26,733 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-25 08:50:26,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:26,734 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 08:50:26,734 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 08:50:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 08:50:26,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 08:50:26,734 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:26,735 INFO L354 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-07-25 08:50:26,735 INFO L415 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:26,735 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2018-07-25 08:50:26,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:26,968 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:26,968 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 08:50:26,968 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 08:50:26,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 08:50:26,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:50:26,969 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-07-25 08:50:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:27,158 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-25 08:50:27,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 08:50:27,158 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-07-25 08:50:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:27,159 INFO L225 Difference]: With dead ends: 36 [2018-07-25 08:50:27,159 INFO L226 Difference]: Without dead ends: 34 [2018-07-25 08:50:27,160 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:50:27,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-25 08:50:27,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-25 08:50:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-25 08:50:27,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-25 08:50:27,167 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-25 08:50:27,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:27,167 INFO L472 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-25 08:50:27,167 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 08:50:27,167 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-25 08:50:27,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-25 08:50:27,168 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:27,168 INFO L354 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-07-25 08:50:27,168 INFO L415 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:27,168 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2018-07-25 08:50:27,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:27,416 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:27,417 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 08:50:27,417 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 08:50:27,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 08:50:27,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:50:27,418 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-07-25 08:50:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:27,619 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 08:50:27,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 08:50:27,620 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-07-25 08:50:27,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:27,620 INFO L225 Difference]: With dead ends: 37 [2018-07-25 08:50:27,620 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 08:50:27,621 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:50:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 08:50:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 08:50:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 08:50:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 08:50:27,625 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-25 08:50:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:27,625 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 08:50:27,625 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 08:50:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 08:50:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 08:50:27,626 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:27,626 INFO L354 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-07-25 08:50:27,626 INFO L415 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:27,627 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2018-07-25 08:50:27,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:27,873 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:27,873 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 08:50:27,873 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 08:50:27,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 08:50:27,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:50:27,874 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-07-25 08:50:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:28,071 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-25 08:50:28,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:50:28,071 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-07-25 08:50:28,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:28,072 INFO L225 Difference]: With dead ends: 38 [2018-07-25 08:50:28,072 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 08:50:28,073 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:50:28,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 08:50:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-25 08:50:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 08:50:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 08:50:28,077 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-25 08:50:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:28,077 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 08:50:28,077 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 08:50:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 08:50:28,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 08:50:28,078 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:28,078 INFO L354 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-07-25 08:50:28,078 INFO L415 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:28,078 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2018-07-25 08:50:28,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:28,330 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:28,330 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 08:50:28,330 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 08:50:28,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 08:50:28,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:50:28,331 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-07-25 08:50:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:28,537 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 08:50:28,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 08:50:28,537 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-07-25 08:50:28,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:28,538 INFO L225 Difference]: With dead ends: 39 [2018-07-25 08:50:28,538 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 08:50:28,539 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:50:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 08:50:28,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 08:50:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 08:50:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 08:50:28,544 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-25 08:50:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:28,544 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 08:50:28,544 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 08:50:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 08:50:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 08:50:28,545 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:28,545 INFO L354 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-07-25 08:50:28,545 INFO L415 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:28,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2018-07-25 08:50:28,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:28,857 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:28,857 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 08:50:28,858 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 08:50:28,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 08:50:28,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:50:28,859 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-07-25 08:50:29,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:29,134 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 08:50:29,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 08:50:29,134 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-07-25 08:50:29,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:29,135 INFO L225 Difference]: With dead ends: 40 [2018-07-25 08:50:29,135 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 08:50:29,136 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:50:29,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 08:50:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 08:50:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 08:50:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-25 08:50:29,140 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-25 08:50:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:29,141 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-25 08:50:29,141 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 08:50:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-25 08:50:29,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 08:50:29,141 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:29,142 INFO L354 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-07-25 08:50:29,142 INFO L415 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:29,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2018-07-25 08:50:29,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:29,430 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:29,431 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 08:50:29,431 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 08:50:29,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 08:50:29,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:50:29,432 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-07-25 08:50:29,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:29,668 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 08:50:29,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 08:50:29,669 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-07-25 08:50:29,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:29,669 INFO L225 Difference]: With dead ends: 41 [2018-07-25 08:50:29,669 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 08:50:29,670 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:50:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 08:50:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 08:50:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 08:50:29,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 08:50:29,682 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-25 08:50:29,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:29,682 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 08:50:29,682 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 08:50:29,683 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 08:50:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 08:50:29,683 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:29,683 INFO L354 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-07-25 08:50:29,687 INFO L415 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:29,687 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2018-07-25 08:50:29,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:30,026 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:30,026 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 08:50:30,026 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 08:50:30,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 08:50:30,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:50:30,028 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-07-25 08:50:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:30,297 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-25 08:50:30,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 08:50:30,297 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-07-25 08:50:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:30,298 INFO L225 Difference]: With dead ends: 42 [2018-07-25 08:50:30,298 INFO L226 Difference]: Without dead ends: 40 [2018-07-25 08:50:30,299 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:50:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-25 08:50:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-25 08:50:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 08:50:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-25 08:50:30,303 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-25 08:50:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:30,303 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-25 08:50:30,303 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 08:50:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-25 08:50:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-25 08:50:30,304 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:30,304 INFO L354 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-07-25 08:50:30,304 INFO L415 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:30,305 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2018-07-25 08:50:30,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:30,650 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:30,650 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 08:50:30,650 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 08:50:30,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 08:50:30,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:50:30,653 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-07-25 08:50:30,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:30,934 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 08:50:30,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 08:50:30,934 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-07-25 08:50:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:30,934 INFO L225 Difference]: With dead ends: 43 [2018-07-25 08:50:30,935 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 08:50:30,935 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:50:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 08:50:30,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 08:50:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 08:50:30,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 08:50:30,939 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-25 08:50:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:30,939 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 08:50:30,939 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 08:50:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 08:50:30,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 08:50:30,940 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:30,940 INFO L354 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-07-25 08:50:30,940 INFO L415 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:30,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2018-07-25 08:50:30,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:31,265 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:31,265 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 08:50:31,265 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 08:50:31,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 08:50:31,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:50:31,266 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-07-25 08:50:31,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:31,531 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-25 08:50:31,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 08:50:31,531 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-07-25 08:50:31,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:31,532 INFO L225 Difference]: With dead ends: 44 [2018-07-25 08:50:31,532 INFO L226 Difference]: Without dead ends: 42 [2018-07-25 08:50:31,533 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:50:31,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-25 08:50:31,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-25 08:50:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-25 08:50:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-25 08:50:31,537 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-25 08:50:31,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:31,538 INFO L472 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-25 08:50:31,538 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 08:50:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-25 08:50:31,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 08:50:31,538 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:31,541 INFO L354 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-07-25 08:50:31,542 INFO L415 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:31,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2018-07-25 08:50:31,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:31,855 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:31,855 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 08:50:31,855 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 08:50:31,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 08:50:31,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:50:31,857 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-07-25 08:50:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:32,163 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 08:50:32,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 08:50:32,163 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-07-25 08:50:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:32,164 INFO L225 Difference]: With dead ends: 45 [2018-07-25 08:50:32,164 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 08:50:32,165 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:50:32,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 08:50:32,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 08:50:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 08:50:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 08:50:32,169 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-25 08:50:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:32,173 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 08:50:32,174 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 08:50:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 08:50:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 08:50:32,174 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:32,175 INFO L354 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-07-25 08:50:32,175 INFO L415 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:32,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2018-07-25 08:50:32,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:32,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:32,558 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 08:50:32,558 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 08:50:32,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 08:50:32,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:50:32,559 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-07-25 08:50:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:32,813 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-25 08:50:32,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 08:50:32,813 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-07-25 08:50:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:32,814 INFO L225 Difference]: With dead ends: 46 [2018-07-25 08:50:32,814 INFO L226 Difference]: Without dead ends: 44 [2018-07-25 08:50:32,815 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:50:32,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-25 08:50:32,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-25 08:50:32,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-25 08:50:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-25 08:50:32,818 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-25 08:50:32,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:32,818 INFO L472 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-25 08:50:32,818 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 08:50:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-25 08:50:32,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-25 08:50:32,819 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:32,819 INFO L354 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-07-25 08:50:32,819 INFO L415 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:32,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2018-07-25 08:50:32,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:33,121 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:33,121 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 08:50:33,121 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 08:50:33,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 08:50:33,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:50:33,123 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-07-25 08:50:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:33,370 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 08:50:33,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 08:50:33,371 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-07-25 08:50:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:33,371 INFO L225 Difference]: With dead ends: 47 [2018-07-25 08:50:33,371 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 08:50:33,372 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:50:33,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 08:50:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 08:50:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 08:50:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 08:50:33,377 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-25 08:50:33,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:33,377 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 08:50:33,377 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 08:50:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 08:50:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 08:50:33,378 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:33,378 INFO L354 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-07-25 08:50:33,378 INFO L415 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:33,378 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2018-07-25 08:50:33,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:33,669 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:33,669 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 08:50:33,669 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 08:50:33,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 08:50:33,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:50:33,670 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-07-25 08:50:33,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:33,928 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-25 08:50:33,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 08:50:33,929 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-07-25 08:50:33,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:33,929 INFO L225 Difference]: With dead ends: 48 [2018-07-25 08:50:33,929 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 08:50:33,930 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:50:33,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 08:50:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-25 08:50:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 08:50:33,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-25 08:50:33,934 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-25 08:50:33,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:33,935 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-25 08:50:33,935 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 08:50:33,935 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-25 08:50:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 08:50:33,935 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:33,936 INFO L354 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-07-25 08:50:33,936 INFO L415 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:33,936 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2018-07-25 08:50:33,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:34,241 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:34,241 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 08:50:34,242 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 08:50:34,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 08:50:34,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:50:34,243 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-07-25 08:50:34,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:34,500 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 08:50:34,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 08:50:34,500 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-07-25 08:50:34,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:34,501 INFO L225 Difference]: With dead ends: 49 [2018-07-25 08:50:34,501 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 08:50:34,502 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:50:34,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 08:50:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 08:50:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 08:50:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 08:50:34,506 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-25 08:50:34,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:34,507 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 08:50:34,507 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 08:50:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 08:50:34,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 08:50:34,507 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:34,511 INFO L354 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-07-25 08:50:34,512 INFO L415 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:34,512 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2018-07-25 08:50:34,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:34,808 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:34,808 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 08:50:34,808 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 08:50:34,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 08:50:34,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:50:34,810 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-07-25 08:50:35,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:35,082 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-25 08:50:35,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 08:50:35,082 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-07-25 08:50:35,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:35,083 INFO L225 Difference]: With dead ends: 50 [2018-07-25 08:50:35,083 INFO L226 Difference]: Without dead ends: 48 [2018-07-25 08:50:35,084 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:50:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-25 08:50:35,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-25 08:50:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 08:50:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-25 08:50:35,088 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-25 08:50:35,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:35,088 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-25 08:50:35,088 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 08:50:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-25 08:50:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-25 08:50:35,090 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:35,091 INFO L354 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-07-25 08:50:35,091 INFO L415 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:35,091 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2018-07-25 08:50:35,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:35,404 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:35,404 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 08:50:35,404 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 08:50:35,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 08:50:35,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:50:35,405 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-07-25 08:50:35,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:35,667 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 08:50:35,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 08:50:35,667 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-07-25 08:50:35,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:35,667 INFO L225 Difference]: With dead ends: 51 [2018-07-25 08:50:35,668 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 08:50:35,668 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:50:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 08:50:35,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 08:50:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 08:50:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 08:50:35,671 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-25 08:50:35,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:35,671 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 08:50:35,671 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 08:50:35,672 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 08:50:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 08:50:35,672 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:35,672 INFO L354 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-07-25 08:50:35,672 INFO L415 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:35,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2018-07-25 08:50:35,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:35,973 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:35,973 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 08:50:35,973 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 08:50:35,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 08:50:35,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:50:35,974 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-07-25 08:50:36,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:36,249 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-25 08:50:36,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 08:50:36,249 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-07-25 08:50:36,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:36,249 INFO L225 Difference]: With dead ends: 52 [2018-07-25 08:50:36,250 INFO L226 Difference]: Without dead ends: 50 [2018-07-25 08:50:36,251 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:50:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-25 08:50:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-25 08:50:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-25 08:50:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-25 08:50:36,254 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-25 08:50:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:36,254 INFO L472 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-25 08:50:36,254 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 08:50:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-25 08:50:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 08:50:36,255 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:36,255 INFO L354 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-07-25 08:50:36,255 INFO L415 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:36,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2018-07-25 08:50:36,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:36,579 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:36,579 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 08:50:36,580 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 08:50:36,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 08:50:36,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:50:36,581 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-07-25 08:50:36,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:36,860 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 08:50:36,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 08:50:36,860 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-07-25 08:50:36,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:36,860 INFO L225 Difference]: With dead ends: 53 [2018-07-25 08:50:36,861 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 08:50:36,861 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:50:36,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 08:50:36,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 08:50:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 08:50:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 08:50:36,864 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-25 08:50:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:36,864 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 08:50:36,865 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 08:50:36,865 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 08:50:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 08:50:36,865 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:36,865 INFO L354 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-07-25 08:50:36,865 INFO L415 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:36,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2018-07-25 08:50:36,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:37,183 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:37,183 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 08:50:37,183 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 08:50:37,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 08:50:37,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:50:37,184 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-07-25 08:50:37,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:37,435 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-25 08:50:37,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 08:50:37,435 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-07-25 08:50:37,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:37,435 INFO L225 Difference]: With dead ends: 54 [2018-07-25 08:50:37,436 INFO L226 Difference]: Without dead ends: 52 [2018-07-25 08:50:37,436 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:50:37,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-25 08:50:37,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-25 08:50:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-25 08:50:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-25 08:50:37,441 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-25 08:50:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:37,442 INFO L472 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-25 08:50:37,442 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 08:50:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-25 08:50:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-25 08:50:37,442 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:37,443 INFO L354 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-07-25 08:50:37,443 INFO L415 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:37,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2018-07-25 08:50:37,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:37,856 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:37,856 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 08:50:37,857 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 08:50:37,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 08:50:37,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:50:37,857 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-07-25 08:50:38,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:38,134 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 08:50:38,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 08:50:38,134 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-07-25 08:50:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:38,135 INFO L225 Difference]: With dead ends: 55 [2018-07-25 08:50:38,135 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 08:50:38,135 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:50:38,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 08:50:38,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 08:50:38,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 08:50:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 08:50:38,138 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-25 08:50:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:38,139 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 08:50:38,139 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 08:50:38,139 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 08:50:38,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 08:50:38,139 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:38,140 INFO L354 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-07-25 08:50:38,140 INFO L415 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:38,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2018-07-25 08:50:38,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:38,461 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:38,461 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 08:50:38,462 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 08:50:38,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 08:50:38,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:50:38,462 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-07-25 08:50:38,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:38,774 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-25 08:50:38,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 08:50:38,774 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-07-25 08:50:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:38,775 INFO L225 Difference]: With dead ends: 56 [2018-07-25 08:50:38,775 INFO L226 Difference]: Without dead ends: 54 [2018-07-25 08:50:38,776 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:50:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-25 08:50:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-25 08:50:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-25 08:50:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-25 08:50:38,779 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-25 08:50:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:38,779 INFO L472 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-25 08:50:38,779 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 08:50:38,779 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-25 08:50:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-25 08:50:38,780 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:38,780 INFO L354 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-07-25 08:50:38,780 INFO L415 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:38,780 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2018-07-25 08:50:38,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:39,176 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:39,176 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 08:50:39,176 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 08:50:39,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 08:50:39,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:50:39,177 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-07-25 08:50:39,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:39,461 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 08:50:39,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 08:50:39,461 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-07-25 08:50:39,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:39,462 INFO L225 Difference]: With dead ends: 57 [2018-07-25 08:50:39,462 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 08:50:39,463 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:50:39,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 08:50:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 08:50:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 08:50:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 08:50:39,466 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-25 08:50:39,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:39,466 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 08:50:39,466 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 08:50:39,466 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 08:50:39,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 08:50:39,467 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:39,467 INFO L354 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-07-25 08:50:39,467 INFO L415 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:39,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 51 times [2018-07-25 08:50:39,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:39,787 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:39,787 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 08:50:39,788 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 08:50:39,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 08:50:39,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:50:39,788 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-07-25 08:50:40,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:40,003 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-25 08:50:40,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 08:50:40,003 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-07-25 08:50:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:40,004 INFO L225 Difference]: With dead ends: 58 [2018-07-25 08:50:40,004 INFO L226 Difference]: Without dead ends: 56 [2018-07-25 08:50:40,004 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:50:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-25 08:50:40,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-25 08:50:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 08:50:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-25 08:50:40,007 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-25 08:50:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:40,007 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-25 08:50:40,008 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 08:50:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-25 08:50:40,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-25 08:50:40,008 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:40,008 INFO L354 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-07-25 08:50:40,009 INFO L415 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:40,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 52 times [2018-07-25 08:50:40,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:40,315 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:40,315 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 08:50:40,315 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 08:50:40,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 08:50:40,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:50:40,316 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-07-25 08:50:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:40,541 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 08:50:40,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 08:50:40,541 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-07-25 08:50:40,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:40,541 INFO L225 Difference]: With dead ends: 59 [2018-07-25 08:50:40,542 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 08:50:40,542 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:50:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 08:50:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 08:50:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 08:50:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 08:50:40,545 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-25 08:50:40,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:40,545 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 08:50:40,545 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 08:50:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 08:50:40,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 08:50:40,546 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:40,546 INFO L354 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-07-25 08:50:40,546 INFO L415 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:40,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 53 times [2018-07-25 08:50:40,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:40,832 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:40,833 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 08:50:40,833 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 08:50:40,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 08:50:40,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:50:40,834 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-07-25 08:50:41,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:41,054 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-25 08:50:41,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 08:50:41,054 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-07-25 08:50:41,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:41,054 INFO L225 Difference]: With dead ends: 60 [2018-07-25 08:50:41,055 INFO L226 Difference]: Without dead ends: 58 [2018-07-25 08:50:41,055 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:50:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-25 08:50:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-25 08:50:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-25 08:50:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-25 08:50:41,058 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-25 08:50:41,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:41,059 INFO L472 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-25 08:50:41,059 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 08:50:41,059 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-25 08:50:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-25 08:50:41,059 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:41,059 INFO L354 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-07-25 08:50:41,060 INFO L415 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:41,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 54 times [2018-07-25 08:50:41,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:41,489 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:41,490 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 08:50:41,490 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 08:50:41,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 08:50:41,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:50:41,491 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-07-25 08:50:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:41,835 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 08:50:41,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 08:50:41,835 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-07-25 08:50:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:41,836 INFO L225 Difference]: With dead ends: 61 [2018-07-25 08:50:41,836 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 08:50:41,836 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:50:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 08:50:41,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 08:50:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 08:50:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 08:50:41,839 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-25 08:50:41,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:41,839 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 08:50:41,839 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 08:50:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 08:50:41,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 08:50:41,840 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:41,840 INFO L354 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-07-25 08:50:41,840 INFO L415 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:41,840 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 55 times [2018-07-25 08:50:41,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:42,163 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:42,163 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 08:50:42,163 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 08:50:42,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 08:50:42,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:50:42,164 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-07-25 08:50:42,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:42,454 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-25 08:50:42,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 08:50:42,454 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-07-25 08:50:42,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:42,455 INFO L225 Difference]: With dead ends: 62 [2018-07-25 08:50:42,455 INFO L226 Difference]: Without dead ends: 60 [2018-07-25 08:50:42,455 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:50:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-25 08:50:42,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-25 08:50:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 08:50:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-25 08:50:42,459 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-25 08:50:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:42,459 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-25 08:50:42,459 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 08:50:42,459 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-25 08:50:42,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-25 08:50:42,460 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:42,460 INFO L354 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-07-25 08:50:42,460 INFO L415 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:42,460 INFO L82 PathProgramCache]: Analyzing trace with hash -148039072, now seen corresponding path program 56 times [2018-07-25 08:50:42,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:42,866 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:42,866 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 08:50:42,866 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 08:50:42,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 08:50:42,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:50:42,867 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-07-25 08:50:43,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:43,114 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 08:50:43,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 08:50:43,114 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-07-25 08:50:43,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:43,114 INFO L225 Difference]: With dead ends: 63 [2018-07-25 08:50:43,114 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 08:50:43,115 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:50:43,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 08:50:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 08:50:43,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 08:50:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 08:50:43,117 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-25 08:50:43,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:43,118 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 08:50:43,118 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 08:50:43,118 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 08:50:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 08:50:43,118 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:43,118 INFO L354 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-07-25 08:50:43,118 INFO L415 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 57 times [2018-07-25 08:50:43,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:43,545 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:43,545 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 08:50:43,545 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 08:50:43,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 08:50:43,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:50:43,546 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-07-25 08:50:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:43,784 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-25 08:50:43,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 08:50:43,784 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-07-25 08:50:43,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:43,784 INFO L225 Difference]: With dead ends: 64 [2018-07-25 08:50:43,785 INFO L226 Difference]: Without dead ends: 62 [2018-07-25 08:50:43,785 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:50:43,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-25 08:50:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-25 08:50:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-25 08:50:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-25 08:50:43,788 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-25 08:50:43,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:43,788 INFO L472 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-25 08:50:43,788 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 08:50:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-25 08:50:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-25 08:50:43,789 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:43,789 INFO L354 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-07-25 08:50:43,789 INFO L415 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:43,789 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 58 times [2018-07-25 08:50:43,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:44,113 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:44,114 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 08:50:44,114 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 08:50:44,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 08:50:44,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:50:44,115 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-07-25 08:50:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:44,367 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 08:50:44,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 08:50:44,368 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-07-25 08:50:44,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:44,368 INFO L225 Difference]: With dead ends: 65 [2018-07-25 08:50:44,368 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 08:50:44,369 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:50:44,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 08:50:44,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 08:50:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 08:50:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 08:50:44,371 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-25 08:50:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:44,371 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 08:50:44,371 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 08:50:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 08:50:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 08:50:44,372 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:44,372 INFO L354 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-07-25 08:50:44,372 INFO L415 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:44,373 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 59 times [2018-07-25 08:50:44,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:44,762 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:44,762 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 08:50:44,762 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 08:50:44,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 08:50:44,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:50:44,763 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-07-25 08:50:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:45,013 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-25 08:50:45,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 08:50:45,013 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-07-25 08:50:45,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:45,014 INFO L225 Difference]: With dead ends: 66 [2018-07-25 08:50:45,014 INFO L226 Difference]: Without dead ends: 64 [2018-07-25 08:50:45,015 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:50:45,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-25 08:50:45,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-25 08:50:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-25 08:50:45,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-25 08:50:45,021 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-25 08:50:45,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:45,021 INFO L472 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-25 08:50:45,021 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 08:50:45,021 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-25 08:50:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-25 08:50:45,022 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:45,022 INFO L354 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-07-25 08:50:45,022 INFO L415 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:45,022 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 60 times [2018-07-25 08:50:45,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:45,538 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:45,539 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 08:50:45,539 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 08:50:45,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 08:50:45,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:50:45,540 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-07-25 08:50:45,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:45,989 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 08:50:45,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 08:50:45,989 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-07-25 08:50:45,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:45,990 INFO L225 Difference]: With dead ends: 67 [2018-07-25 08:50:45,990 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 08:50:45,991 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:50:45,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 08:50:45,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 08:50:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 08:50:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 08:50:45,999 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-25 08:50:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:46,000 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 08:50:46,000 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 08:50:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 08:50:46,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 08:50:46,000 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:46,001 INFO L354 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-07-25 08:50:46,001 INFO L415 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:46,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 61 times [2018-07-25 08:50:46,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:46,374 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:46,374 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 08:50:46,375 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 08:50:46,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 08:50:46,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:50:46,376 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-07-25 08:50:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:46,671 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-25 08:50:46,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 08:50:46,672 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-07-25 08:50:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:46,672 INFO L225 Difference]: With dead ends: 68 [2018-07-25 08:50:46,672 INFO L226 Difference]: Without dead ends: 66 [2018-07-25 08:50:46,673 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:50:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-25 08:50:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-25 08:50:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-25 08:50:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-25 08:50:46,678 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-25 08:50:46,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:46,678 INFO L472 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-25 08:50:46,678 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 08:50:46,678 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-25 08:50:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-25 08:50:46,679 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:46,679 INFO L354 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-07-25 08:50:46,679 INFO L415 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:46,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 62 times [2018-07-25 08:50:46,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:47,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:47,093 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:47,094 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 08:50:47,094 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 08:50:47,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 08:50:47,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:50:47,095 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-07-25 08:50:47,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:47,366 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 08:50:47,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 08:50:47,366 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-07-25 08:50:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:47,367 INFO L225 Difference]: With dead ends: 69 [2018-07-25 08:50:47,367 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 08:50:47,368 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:50:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 08:50:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 08:50:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 08:50:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 08:50:47,372 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-25 08:50:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:47,372 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 08:50:47,372 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 08:50:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 08:50:47,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 08:50:47,373 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:47,373 INFO L354 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-07-25 08:50:47,373 INFO L415 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:47,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 63 times [2018-07-25 08:50:47,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:47,774 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:47,774 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 08:50:47,774 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 08:50:47,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 08:50:47,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:50:47,775 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-07-25 08:50:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:48,093 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-25 08:50:48,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 08:50:48,093 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-07-25 08:50:48,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:48,094 INFO L225 Difference]: With dead ends: 70 [2018-07-25 08:50:48,094 INFO L226 Difference]: Without dead ends: 68 [2018-07-25 08:50:48,094 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:50:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-25 08:50:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-25 08:50:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-25 08:50:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-25 08:50:48,100 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-25 08:50:48,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:48,100 INFO L472 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-25 08:50:48,100 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 08:50:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-25 08:50:48,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 08:50:48,101 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:48,101 INFO L354 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-07-25 08:50:48,101 INFO L415 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:48,101 INFO L82 PathProgramCache]: Analyzing trace with hash -892596896, now seen corresponding path program 64 times [2018-07-25 08:50:48,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:48,489 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:48,490 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 08:50:48,490 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 08:50:48,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 08:50:48,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:50:48,490 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-07-25 08:50:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:48,783 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 08:50:48,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 08:50:48,783 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-07-25 08:50:48,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:48,784 INFO L225 Difference]: With dead ends: 71 [2018-07-25 08:50:48,784 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 08:50:48,785 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:50:48,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 08:50:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 08:50:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 08:50:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 08:50:48,788 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-25 08:50:48,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:48,788 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 08:50:48,788 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 08:50:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 08:50:48,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 08:50:48,789 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:48,789 INFO L354 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-07-25 08:50:48,789 INFO L415 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:48,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 65 times [2018-07-25 08:50:48,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:49,191 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:49,192 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 08:50:49,192 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 08:50:49,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 08:50:49,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:50:49,193 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-07-25 08:50:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:49,491 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-25 08:50:49,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 08:50:49,491 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-07-25 08:50:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:49,492 INFO L225 Difference]: With dead ends: 72 [2018-07-25 08:50:49,492 INFO L226 Difference]: Without dead ends: 70 [2018-07-25 08:50:49,492 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:50:49,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-25 08:50:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-25 08:50:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 08:50:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-25 08:50:49,495 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-25 08:50:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:49,496 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-25 08:50:49,496 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 08:50:49,496 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-25 08:50:49,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-25 08:50:49,496 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:49,496 INFO L354 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-07-25 08:50:49,497 INFO L415 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:49,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 66 times [2018-07-25 08:50:49,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:49,852 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:49,853 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 08:50:49,853 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 08:50:49,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 08:50:49,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:50:49,853 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-07-25 08:50:50,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:50,182 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 08:50:50,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 08:50:50,182 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-07-25 08:50:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:50,183 INFO L225 Difference]: With dead ends: 73 [2018-07-25 08:50:50,183 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 08:50:50,184 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:50:50,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 08:50:50,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 08:50:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 08:50:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 08:50:50,186 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-25 08:50:50,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:50,186 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 08:50:50,186 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 08:50:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 08:50:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 08:50:50,187 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:50,187 INFO L354 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-07-25 08:50:50,187 INFO L415 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:50,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 67 times [2018-07-25 08:50:50,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:50,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:50,619 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:50,619 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 08:50:50,620 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 08:50:50,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 08:50:50,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:50:50,620 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-07-25 08:50:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:50,954 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-25 08:50:50,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 08:50:50,954 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-07-25 08:50:50,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:50,955 INFO L225 Difference]: With dead ends: 74 [2018-07-25 08:50:50,955 INFO L226 Difference]: Without dead ends: 72 [2018-07-25 08:50:50,955 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:50:50,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-25 08:50:50,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-25 08:50:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 08:50:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-25 08:50:50,958 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-25 08:50:50,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:50,959 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-25 08:50:50,959 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 08:50:50,959 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-25 08:50:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-25 08:50:50,959 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:50,959 INFO L354 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-07-25 08:50:50,959 INFO L415 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:50,959 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 68 times [2018-07-25 08:50:50,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:51,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:51,430 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:51,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 08:50:51,430 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 08:50:51,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 08:50:51,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:50:51,431 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-07-25 08:50:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:51,782 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 08:50:51,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 08:50:51,782 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-07-25 08:50:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:51,782 INFO L225 Difference]: With dead ends: 75 [2018-07-25 08:50:51,782 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 08:50:51,783 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:50:51,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 08:50:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 08:50:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 08:50:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 08:50:51,785 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-25 08:50:51,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:51,785 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 08:50:51,785 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 08:50:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 08:50:51,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 08:50:51,786 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:51,786 INFO L354 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-07-25 08:50:51,786 INFO L415 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:51,786 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 69 times [2018-07-25 08:50:51,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:52,197 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:52,197 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 08:50:52,197 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 08:50:52,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 08:50:52,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:50:52,198 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-07-25 08:50:52,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:52,597 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-25 08:50:52,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 08:50:52,597 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-07-25 08:50:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:52,598 INFO L225 Difference]: With dead ends: 76 [2018-07-25 08:50:52,598 INFO L226 Difference]: Without dead ends: 74 [2018-07-25 08:50:52,598 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:50:52,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-25 08:50:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-25 08:50:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 08:50:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-25 08:50:52,601 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-25 08:50:52,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:52,601 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-25 08:50:52,602 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 08:50:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-25 08:50:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 08:50:52,602 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:52,602 INFO L354 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-07-25 08:50:52,603 INFO L415 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:52,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 70 times [2018-07-25 08:50:52,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:53,025 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:53,025 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 08:50:53,025 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 08:50:53,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 08:50:53,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:50:53,026 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-07-25 08:50:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:53,420 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 08:50:53,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 08:50:53,421 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-07-25 08:50:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:53,421 INFO L225 Difference]: With dead ends: 77 [2018-07-25 08:50:53,421 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 08:50:53,422 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:50:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 08:50:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 08:50:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 08:50:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 08:50:53,425 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-25 08:50:53,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:53,425 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 08:50:53,425 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 08:50:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 08:50:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 08:50:53,426 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:53,426 INFO L354 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-07-25 08:50:53,426 INFO L415 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:53,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 71 times [2018-07-25 08:50:53,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:53,905 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:53,905 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 08:50:53,906 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 08:50:53,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 08:50:53,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:50:53,906 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-07-25 08:50:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:54,313 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-25 08:50:54,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 08:50:54,313 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-07-25 08:50:54,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:54,314 INFO L225 Difference]: With dead ends: 78 [2018-07-25 08:50:54,314 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 08:50:54,314 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:50:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 08:50:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 08:50:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 08:50:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-25 08:50:54,317 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-25 08:50:54,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:54,318 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-25 08:50:54,318 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 08:50:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-25 08:50:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-25 08:50:54,318 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:54,319 INFO L354 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-07-25 08:50:54,319 INFO L415 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:54,319 INFO L82 PathProgramCache]: Analyzing trace with hash 365428832, now seen corresponding path program 72 times [2018-07-25 08:50:54,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:54,872 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:54,872 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 08:50:54,872 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 08:50:54,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 08:50:54,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:50:54,873 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-07-25 08:50:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:55,276 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 08:50:55,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 08:50:55,276 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-07-25 08:50:55,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:55,277 INFO L225 Difference]: With dead ends: 79 [2018-07-25 08:50:55,277 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 08:50:55,278 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:50:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 08:50:55,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 08:50:55,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 08:50:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 08:50:55,280 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-25 08:50:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:55,280 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 08:50:55,280 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 08:50:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 08:50:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 08:50:55,281 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:55,281 INFO L354 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-07-25 08:50:55,281 INFO L415 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:55,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 73 times [2018-07-25 08:50:55,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:55,816 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:55,816 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 08:50:55,816 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 08:50:55,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 08:50:55,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:50:55,817 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-07-25 08:50:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:56,245 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-25 08:50:56,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 08:50:56,246 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-07-25 08:50:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:56,246 INFO L225 Difference]: With dead ends: 80 [2018-07-25 08:50:56,246 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 08:50:56,247 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:50:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 08:50:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-25 08:50:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 08:50:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-25 08:50:56,250 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-25 08:50:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:56,251 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-25 08:50:56,251 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 08:50:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-25 08:50:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-25 08:50:56,251 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:56,252 INFO L354 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-07-25 08:50:56,252 INFO L415 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:56,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 74 times [2018-07-25 08:50:56,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:56,855 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:56,855 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 08:50:56,855 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 08:50:56,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 08:50:56,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:50:56,856 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-07-25 08:50:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:57,289 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 08:50:57,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 08:50:57,289 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-07-25 08:50:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:57,290 INFO L225 Difference]: With dead ends: 81 [2018-07-25 08:50:57,290 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 08:50:57,290 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:50:57,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 08:50:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 08:50:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 08:50:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 08:50:57,294 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-25 08:50:57,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:57,294 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 08:50:57,294 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 08:50:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 08:50:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 08:50:57,295 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:57,295 INFO L354 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-07-25 08:50:57,295 INFO L415 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:57,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 75 times [2018-07-25 08:50:57,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:57,819 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:57,819 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 08:50:57,820 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 08:50:57,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 08:50:57,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:50:57,820 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-07-25 08:50:58,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:58,255 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-25 08:50:58,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 08:50:58,255 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-07-25 08:50:58,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:58,256 INFO L225 Difference]: With dead ends: 82 [2018-07-25 08:50:58,256 INFO L226 Difference]: Without dead ends: 80 [2018-07-25 08:50:58,256 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:50:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-25 08:50:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-25 08:50:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-25 08:50:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-25 08:50:58,260 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-25 08:50:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:58,260 INFO L472 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-25 08:50:58,260 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 08:50:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-25 08:50:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 08:50:58,260 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:58,260 INFO L354 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-07-25 08:50:58,261 INFO L415 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 76 times [2018-07-25 08:50:58,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:58,786 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:58,786 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 08:50:58,786 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 08:50:58,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 08:50:58,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:50:58,787 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-07-25 08:50:59,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:59,266 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 08:50:59,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 08:50:59,266 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-07-25 08:50:59,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:59,267 INFO L225 Difference]: With dead ends: 83 [2018-07-25 08:50:59,267 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 08:50:59,267 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:50:59,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 08:50:59,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 08:50:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 08:50:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 08:50:59,271 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-25 08:50:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:59,271 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 08:50:59,271 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 08:50:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 08:50:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 08:50:59,272 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:59,272 INFO L354 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-07-25 08:50:59,272 INFO L415 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash 253907718, now seen corresponding path program 77 times [2018-07-25 08:50:59,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:50:59,814 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:59,814 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 08:50:59,814 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 08:50:59,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 08:50:59,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:50:59,815 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-07-25 08:51:00,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:00,285 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-25 08:51:00,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 08:51:00,285 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-07-25 08:51:00,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:00,286 INFO L225 Difference]: With dead ends: 84 [2018-07-25 08:51:00,286 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 08:51:00,286 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:51:00,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 08:51:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-25 08:51:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-25 08:51:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-25 08:51:00,289 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-25 08:51:00,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:00,289 INFO L472 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-25 08:51:00,289 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 08:51:00,289 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-25 08:51:00,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-25 08:51:00,290 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:00,290 INFO L354 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-07-25 08:51:00,290 INFO L415 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:00,290 INFO L82 PathProgramCache]: Analyzing trace with hash -718799200, now seen corresponding path program 78 times [2018-07-25 08:51:00,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:00,846 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:00,846 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 08:51:00,846 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 08:51:00,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 08:51:00,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:51:00,847 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-07-25 08:51:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:01,330 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 08:51:01,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 08:51:01,331 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-07-25 08:51:01,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:01,331 INFO L225 Difference]: With dead ends: 85 [2018-07-25 08:51:01,331 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 08:51:01,332 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:51:01,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 08:51:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 08:51:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 08:51:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 08:51:01,334 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-25 08:51:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:01,334 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 08:51:01,335 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 08:51:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 08:51:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 08:51:01,335 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:01,335 INFO L354 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-07-25 08:51:01,335 INFO L415 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:01,335 INFO L82 PathProgramCache]: Analyzing trace with hash -807942586, now seen corresponding path program 79 times [2018-07-25 08:51:01,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:02,004 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:02,004 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 08:51:02,004 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 08:51:02,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 08:51:02,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:51:02,005 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-07-25 08:51:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:02,546 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-25 08:51:02,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 08:51:02,546 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-07-25 08:51:02,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:02,546 INFO L225 Difference]: With dead ends: 86 [2018-07-25 08:51:02,546 INFO L226 Difference]: Without dead ends: 84 [2018-07-25 08:51:02,547 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:51:02,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-25 08:51:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-25 08:51:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 08:51:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-25 08:51:02,550 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-25 08:51:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:02,551 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-25 08:51:02,551 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 08:51:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-25 08:51:02,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-25 08:51:02,551 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:02,552 INFO L354 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-07-25 08:51:02,552 INFO L415 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:02,552 INFO L82 PathProgramCache]: Analyzing trace with hash 723579744, now seen corresponding path program 80 times [2018-07-25 08:51:02,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:03,151 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:03,151 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 08:51:03,152 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 08:51:03,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 08:51:03,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:51:03,153 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-07-25 08:51:03,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:03,655 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 08:51:03,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 08:51:03,655 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-07-25 08:51:03,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:03,656 INFO L225 Difference]: With dead ends: 87 [2018-07-25 08:51:03,656 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 08:51:03,657 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:51:03,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 08:51:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 08:51:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 08:51:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 08:51:03,660 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-25 08:51:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:03,661 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 08:51:03,661 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 08:51:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 08:51:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 08:51:03,661 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:03,662 INFO L354 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-07-25 08:51:03,662 INFO L415 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:03,662 INFO L82 PathProgramCache]: Analyzing trace with hash 956131718, now seen corresponding path program 81 times [2018-07-25 08:51:03,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:04,280 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:04,280 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 08:51:04,280 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 08:51:04,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 08:51:04,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:51:04,281 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-07-25 08:51:04,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:04,799 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-25 08:51:04,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 08:51:04,799 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-07-25 08:51:04,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:04,799 INFO L225 Difference]: With dead ends: 88 [2018-07-25 08:51:04,799 INFO L226 Difference]: Without dead ends: 86 [2018-07-25 08:51:04,800 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:51:04,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-25 08:51:04,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-25 08:51:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 08:51:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-25 08:51:04,803 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-25 08:51:04,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:04,803 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-25 08:51:04,803 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 08:51:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-25 08:51:04,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 08:51:04,803 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:04,803 INFO L354 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-07-25 08:51:04,804 INFO L415 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:04,804 INFO L82 PathProgramCache]: Analyzing trace with hash -424691680, now seen corresponding path program 82 times [2018-07-25 08:51:04,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:05,433 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:05,433 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 08:51:05,434 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 08:51:05,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 08:51:05,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:51:05,434 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-07-25 08:51:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:05,947 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 08:51:05,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 08:51:05,948 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-07-25 08:51:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:05,948 INFO L225 Difference]: With dead ends: 89 [2018-07-25 08:51:05,948 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 08:51:05,949 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:51:05,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 08:51:05,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 08:51:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 08:51:05,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 08:51:05,952 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-25 08:51:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:05,952 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 08:51:05,952 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 08:51:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 08:51:05,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 08:51:05,953 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:05,953 INFO L354 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-07-25 08:51:05,953 INFO L415 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:05,953 INFO L82 PathProgramCache]: Analyzing trace with hash -280544058, now seen corresponding path program 83 times [2018-07-25 08:51:05,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:06,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:06,571 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 08:51:06,572 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 08:51:06,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 08:51:06,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:51:06,573 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-07-25 08:51:07,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:07,125 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-25 08:51:07,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 08:51:07,125 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-07-25 08:51:07,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:07,126 INFO L225 Difference]: With dead ends: 90 [2018-07-25 08:51:07,126 INFO L226 Difference]: Without dead ends: 88 [2018-07-25 08:51:07,127 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:51:07,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-25 08:51:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-25 08:51:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-25 08:51:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-25 08:51:07,130 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-25 08:51:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:07,131 INFO L472 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-25 08:51:07,131 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 08:51:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-25 08:51:07,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-25 08:51:07,131 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:07,131 INFO L354 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-07-25 08:51:07,132 INFO L415 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:07,132 INFO L82 PathProgramCache]: Analyzing trace with hash -106935072, now seen corresponding path program 84 times [2018-07-25 08:51:07,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:07,796 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:07,796 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 08:51:07,796 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 08:51:07,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 08:51:07,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:51:07,797 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-07-25 08:51:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:08,413 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 08:51:08,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 08:51:08,413 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-07-25 08:51:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:08,414 INFO L225 Difference]: With dead ends: 91 [2018-07-25 08:51:08,414 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 08:51:08,414 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:51:08,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 08:51:08,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 08:51:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 08:51:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 08:51:08,417 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-25 08:51:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:08,418 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 08:51:08,418 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 08:51:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 08:51:08,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 08:51:08,418 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:08,419 INFO L354 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-07-25 08:51:08,419 INFO L415 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:08,419 INFO L82 PathProgramCache]: Analyzing trace with hash 979976198, now seen corresponding path program 85 times [2018-07-25 08:51:08,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:09,085 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:09,085 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 08:51:09,086 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 08:51:09,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 08:51:09,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:51:09,087 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-07-25 08:51:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:09,690 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-25 08:51:09,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 08:51:09,690 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-07-25 08:51:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:09,691 INFO L225 Difference]: With dead ends: 92 [2018-07-25 08:51:09,691 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 08:51:09,692 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:51:09,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 08:51:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-25 08:51:09,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-25 08:51:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-25 08:51:09,695 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-25 08:51:09,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:09,695 INFO L472 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-25 08:51:09,695 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 08:51:09,695 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-25 08:51:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-25 08:51:09,696 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:09,696 INFO L354 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-07-25 08:51:09,696 INFO L415 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:09,696 INFO L82 PathProgramCache]: Analyzing trace with hash 314487200, now seen corresponding path program 86 times [2018-07-25 08:51:09,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:10,371 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:10,371 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 08:51:10,371 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 08:51:10,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 08:51:10,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:51:10,372 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-07-25 08:51:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:10,982 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 08:51:10,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 08:51:10,982 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-07-25 08:51:10,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:10,982 INFO L225 Difference]: With dead ends: 93 [2018-07-25 08:51:10,983 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 08:51:10,983 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:51:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 08:51:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 08:51:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 08:51:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 08:51:10,986 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-25 08:51:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:10,986 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 08:51:10,986 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 08:51:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 08:51:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 08:51:10,987 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:10,987 INFO L354 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-07-25 08:51:10,987 INFO L415 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164742, now seen corresponding path program 87 times [2018-07-25 08:51:10,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:11,669 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:11,669 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 08:51:11,670 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 08:51:11,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 08:51:11,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:51:11,670 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-07-25 08:51:12,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:12,254 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-25 08:51:12,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 08:51:12,255 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-07-25 08:51:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:12,255 INFO L225 Difference]: With dead ends: 94 [2018-07-25 08:51:12,255 INFO L226 Difference]: Without dead ends: 92 [2018-07-25 08:51:12,256 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:51:12,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-25 08:51:12,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-25 08:51:12,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-25 08:51:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-25 08:51:12,258 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-25 08:51:12,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:12,259 INFO L472 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-25 08:51:12,259 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 08:51:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-25 08:51:12,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-25 08:51:12,259 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:12,259 INFO L354 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-07-25 08:51:12,259 INFO L415 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:12,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364768, now seen corresponding path program 88 times [2018-07-25 08:51:12,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:12,952 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:12,952 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 08:51:12,952 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 08:51:12,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 08:51:12,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:51:12,953 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-07-25 08:51:13,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:13,565 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 08:51:13,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 08:51:13,565 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-07-25 08:51:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:13,566 INFO L225 Difference]: With dead ends: 95 [2018-07-25 08:51:13,566 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 08:51:13,567 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:51:13,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 08:51:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 08:51:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 08:51:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 08:51:13,569 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-25 08:51:13,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:13,570 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 08:51:13,570 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 08:51:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 08:51:13,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 08:51:13,571 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:13,571 INFO L354 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-07-25 08:51:13,571 INFO L415 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:13,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663686, now seen corresponding path program 89 times [2018-07-25 08:51:13,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:14,365 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:14,365 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 08:51:14,365 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 08:51:14,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 08:51:14,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:51:14,366 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-07-25 08:51:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:14,971 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-25 08:51:14,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 08:51:14,971 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-07-25 08:51:14,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:14,972 INFO L225 Difference]: With dead ends: 96 [2018-07-25 08:51:14,972 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 08:51:14,972 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:51:14,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 08:51:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-25 08:51:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 08:51:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-25 08:51:14,975 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-25 08:51:14,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:14,975 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-25 08:51:14,975 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 08:51:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-25 08:51:14,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-25 08:51:14,976 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:14,976 INFO L354 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-07-25 08:51:14,976 INFO L415 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:14,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930144, now seen corresponding path program 90 times [2018-07-25 08:51:14,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:15,698 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:15,699 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 08:51:15,699 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 08:51:15,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 08:51:15,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:51:15,700 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-07-25 08:51:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:16,341 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 08:51:16,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 08:51:16,342 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-07-25 08:51:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:16,342 INFO L225 Difference]: With dead ends: 97 [2018-07-25 08:51:16,342 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 08:51:16,343 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:51:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 08:51:16,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 08:51:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 08:51:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 08:51:16,346 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-25 08:51:16,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:16,347 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 08:51:16,347 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 08:51:16,347 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 08:51:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 08:51:16,347 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:16,348 INFO L354 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-07-25 08:51:16,348 INFO L415 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:16,348 INFO L82 PathProgramCache]: Analyzing trace with hash 854092230, now seen corresponding path program 91 times [2018-07-25 08:51:16,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:17,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:17,131 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:17,131 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 08:51:17,132 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 08:51:17,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 08:51:17,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:51:17,133 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-07-25 08:51:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:17,796 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-25 08:51:17,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 08:51:17,796 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-07-25 08:51:17,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:17,797 INFO L225 Difference]: With dead ends: 98 [2018-07-25 08:51:17,797 INFO L226 Difference]: Without dead ends: 96 [2018-07-25 08:51:17,797 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:51:17,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-25 08:51:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-25 08:51:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 08:51:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-25 08:51:17,801 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-25 08:51:17,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:17,801 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-25 08:51:17,801 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 08:51:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-25 08:51:17,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-25 08:51:17,802 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:17,802 INFO L354 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-07-25 08:51:17,802 INFO L415 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:17,802 INFO L82 PathProgramCache]: Analyzing trace with hash 707051488, now seen corresponding path program 92 times [2018-07-25 08:51:17,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:18,727 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:18,727 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 08:51:18,728 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 08:51:18,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 08:51:18,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:51:18,729 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-07-25 08:51:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:19,454 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 08:51:19,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 08:51:19,454 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-07-25 08:51:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:19,454 INFO L225 Difference]: With dead ends: 99 [2018-07-25 08:51:19,455 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 08:51:19,455 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:51:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 08:51:19,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 08:51:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 08:51:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 08:51:19,459 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-25 08:51:19,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:19,459 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 08:51:19,459 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 08:51:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 08:51:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 08:51:19,460 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:19,460 INFO L354 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-07-25 08:51:19,460 INFO L415 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:19,461 INFO L82 PathProgramCache]: Analyzing trace with hash 443755782, now seen corresponding path program 93 times [2018-07-25 08:51:19,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:20,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:20,279 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:20,279 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 08:51:20,280 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 08:51:20,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 08:51:20,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:51:20,281 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-07-25 08:51:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:20,985 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-25 08:51:20,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 08:51:20,985 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-07-25 08:51:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:20,986 INFO L225 Difference]: With dead ends: 100 [2018-07-25 08:51:20,986 INFO L226 Difference]: Without dead ends: 98 [2018-07-25 08:51:20,987 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:51:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-25 08:51:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-25 08:51:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-25 08:51:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-25 08:51:20,992 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-07-25 08:51:20,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:20,992 INFO L472 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-25 08:51:20,992 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 08:51:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-25 08:51:20,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-25 08:51:20,993 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:20,993 INFO L354 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-07-25 08:51:20,994 INFO L415 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:20,994 INFO L82 PathProgramCache]: Analyzing trace with hash 871523488, now seen corresponding path program 94 times [2018-07-25 08:51:20,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:21,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:21,921 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 08:51:21,921 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 08:51:21,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 08:51:21,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:51:21,922 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-07-25 08:51:22,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:22,666 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 08:51:22,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 08:51:22,667 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-07-25 08:51:22,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:22,668 INFO L225 Difference]: With dead ends: 101 [2018-07-25 08:51:22,668 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 08:51:22,669 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:51:22,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 08:51:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 08:51:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 08:51:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 08:51:22,673 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-07-25 08:51:22,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:22,673 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 08:51:22,674 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 08:51:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 08:51:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 08:51:22,674 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:22,674 INFO L354 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-07-25 08:51:22,675 INFO L415 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:22,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420486, now seen corresponding path program 95 times [2018-07-25 08:51:22,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:23,646 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:23,647 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 08:51:23,647 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 08:51:23,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 08:51:23,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:51:23,648 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-07-25 08:51:24,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:24,356 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-25 08:51:24,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 08:51:24,356 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-07-25 08:51:24,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:24,357 INFO L225 Difference]: With dead ends: 102 [2018-07-25 08:51:24,357 INFO L226 Difference]: Without dead ends: 100 [2018-07-25 08:51:24,358 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:51:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-25 08:51:24,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-25 08:51:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 08:51:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-25 08:51:24,361 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-07-25 08:51:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:24,361 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-25 08:51:24,361 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 08:51:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-25 08:51:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-25 08:51:24,362 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:24,362 INFO L354 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-07-25 08:51:24,362 INFO L415 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:24,362 INFO L82 PathProgramCache]: Analyzing trace with hash 15325536, now seen corresponding path program 96 times [2018-07-25 08:51:24,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:25,168 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:25,168 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 08:51:25,169 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 08:51:25,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 08:51:25,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:51:25,169 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-07-25 08:51:25,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:25,922 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 08:51:25,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 08:51:25,923 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-07-25 08:51:25,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:25,923 INFO L225 Difference]: With dead ends: 103 [2018-07-25 08:51:25,923 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 08:51:25,924 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:51:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 08:51:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 08:51:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 08:51:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 08:51:25,927 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-07-25 08:51:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:25,927 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 08:51:25,927 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 08:51:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 08:51:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 08:51:25,928 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:25,928 INFO L354 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-07-25 08:51:25,928 INFO L415 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash 475087750, now seen corresponding path program 97 times [2018-07-25 08:51:25,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:26,768 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:26,768 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 08:51:26,768 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 08:51:26,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 08:51:26,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:51:26,769 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-07-25 08:51:27,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:27,495 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-25 08:51:27,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 08:51:27,495 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-07-25 08:51:27,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:27,496 INFO L225 Difference]: With dead ends: 104 [2018-07-25 08:51:27,496 INFO L226 Difference]: Without dead ends: 102 [2018-07-25 08:51:27,497 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:51:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-25 08:51:27,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-25 08:51:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-25 08:51:27,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-25 08:51:27,501 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-07-25 08:51:27,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:27,501 INFO L472 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-25 08:51:27,501 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 08:51:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-25 08:51:27,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-25 08:51:27,502 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:27,502 INFO L354 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-07-25 08:51:27,503 INFO L415 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:27,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814496, now seen corresponding path program 98 times [2018-07-25 08:51:27,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:28,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:28,423 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:28,423 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 08:51:28,424 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 08:51:28,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 08:51:28,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:51:28,424 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-07-25 08:51:29,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:29,184 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 08:51:29,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 08:51:29,185 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-07-25 08:51:29,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:29,185 INFO L225 Difference]: With dead ends: 105 [2018-07-25 08:51:29,185 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 08:51:29,186 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:51:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 08:51:29,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 08:51:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 08:51:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 08:51:29,189 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-07-25 08:51:29,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:29,189 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 08:51:29,189 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 08:51:29,189 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 08:51:29,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 08:51:29,189 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:29,189 INFO L354 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-07-25 08:51:29,190 INFO L415 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:29,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670662, now seen corresponding path program 99 times [2018-07-25 08:51:29,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:30,106 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:30,106 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 08:51:30,107 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 08:51:30,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 08:51:30,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 08:51:30,108 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-07-25 08:51:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:30,870 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-25 08:51:30,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 08:51:30,870 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-07-25 08:51:30,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:30,871 INFO L225 Difference]: With dead ends: 106 [2018-07-25 08:51:30,871 INFO L226 Difference]: Without dead ends: 104 [2018-07-25 08:51:30,872 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 08:51:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-25 08:51:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-25 08:51:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-25 08:51:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-25 08:51:30,875 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-07-25 08:51:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:30,876 INFO L472 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-25 08:51:30,876 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 08:51:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-25 08:51:30,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-25 08:51:30,876 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:30,877 INFO L354 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-07-25 08:51:30,877 INFO L415 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:30,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080992, now seen corresponding path program 100 times [2018-07-25 08:51:30,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:31,794 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:31,794 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 08:51:31,795 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 08:51:31,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 08:51:31,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:51:31,795 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-07-25 08:51:32,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:32,574 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 08:51:32,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 08:51:32,575 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-07-25 08:51:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:32,575 INFO L225 Difference]: With dead ends: 107 [2018-07-25 08:51:32,575 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 08:51:32,576 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:51:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 08:51:32,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 08:51:32,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 08:51:32,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 08:51:32,580 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-07-25 08:51:32,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:32,580 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 08:51:32,580 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 08:51:32,580 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 08:51:32,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 08:51:32,581 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:32,581 INFO L354 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-07-25 08:51:32,581 INFO L415 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:32,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833926, now seen corresponding path program 101 times [2018-07-25 08:51:32,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:33,492 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:33,492 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 08:51:33,492 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 08:51:33,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 08:51:33,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 08:51:33,494 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-07-25 08:51:34,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:34,293 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-07-25 08:51:34,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 08:51:34,293 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-07-25 08:51:34,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:34,294 INFO L225 Difference]: With dead ends: 108 [2018-07-25 08:51:34,294 INFO L226 Difference]: Without dead ends: 106 [2018-07-25 08:51:34,295 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 08:51:34,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-25 08:51:34,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-07-25 08:51:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-25 08:51:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-07-25 08:51:34,299 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-07-25 08:51:34,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:34,299 INFO L472 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-07-25 08:51:34,299 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 08:51:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-07-25 08:51:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-25 08:51:34,300 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:34,300 INFO L354 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-07-25 08:51:34,300 INFO L415 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:34,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076768, now seen corresponding path program 102 times [2018-07-25 08:51:34,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:35,351 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:35,351 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 08:51:35,352 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 08:51:35,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 08:51:35,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:51:35,352 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-07-25 08:51:36,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:36,148 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 08:51:36,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 08:51:36,148 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-07-25 08:51:36,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:36,149 INFO L225 Difference]: With dead ends: 109 [2018-07-25 08:51:36,149 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 08:51:36,149 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:51:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 08:51:36,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 08:51:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 08:51:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 08:51:36,153 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-07-25 08:51:36,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:36,153 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 08:51:36,153 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 08:51:36,153 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 08:51:36,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 08:51:36,154 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:36,154 INFO L354 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-07-25 08:51:36,154 INFO L415 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:36,154 INFO L82 PathProgramCache]: Analyzing trace with hash 748670278, now seen corresponding path program 103 times [2018-07-25 08:51:36,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:37,093 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:37,093 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 08:51:37,093 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 08:51:37,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 08:51:37,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 08:51:37,095 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-07-25 08:51:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:37,932 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-07-25 08:51:37,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 08:51:37,932 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-07-25 08:51:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:37,932 INFO L225 Difference]: With dead ends: 110 [2018-07-25 08:51:37,932 INFO L226 Difference]: Without dead ends: 108 [2018-07-25 08:51:37,933 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 08:51:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-07-25 08:51:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-07-25 08:51:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-25 08:51:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-07-25 08:51:37,937 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-07-25 08:51:37,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:37,937 INFO L472 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-07-25 08:51:37,937 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 08:51:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-07-25 08:51:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-07-25 08:51:37,938 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:37,938 INFO L354 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-07-25 08:51:37,938 INFO L415 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:37,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938272, now seen corresponding path program 104 times [2018-07-25 08:51:37,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:38,947 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:38,947 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 08:51:38,947 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 08:51:38,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 08:51:38,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:51:38,948 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-07-25 08:51:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:39,782 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 08:51:39,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 08:51:39,782 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-07-25 08:51:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:39,783 INFO L225 Difference]: With dead ends: 111 [2018-07-25 08:51:39,783 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 08:51:39,783 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:51:39,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 08:51:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 08:51:39,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 08:51:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 08:51:39,786 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-07-25 08:51:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:39,787 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 08:51:39,787 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 08:51:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 08:51:39,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 08:51:39,787 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:39,788 INFO L354 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-07-25 08:51:39,788 INFO L415 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:39,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492282, now seen corresponding path program 105 times [2018-07-25 08:51:39,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:40,821 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:40,821 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 08:51:40,821 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 08:51:40,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 08:51:40,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 08:51:40,822 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-07-25 08:51:41,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:41,701 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-07-25 08:51:41,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 08:51:41,702 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-07-25 08:51:41,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:41,702 INFO L225 Difference]: With dead ends: 112 [2018-07-25 08:51:41,702 INFO L226 Difference]: Without dead ends: 110 [2018-07-25 08:51:41,703 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 08:51:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-25 08:51:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-07-25 08:51:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-25 08:51:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-07-25 08:51:41,707 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-07-25 08:51:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:41,707 INFO L472 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-07-25 08:51:41,707 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 08:51:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-07-25 08:51:41,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-25 08:51:41,708 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:41,708 INFO L354 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-07-25 08:51:41,708 INFO L415 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:41,708 INFO L82 PathProgramCache]: Analyzing trace with hash -132755168, now seen corresponding path program 106 times [2018-07-25 08:51:41,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:42,825 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:42,825 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 08:51:42,825 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 08:51:42,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 08:51:42,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:51:42,826 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-07-25 08:51:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:43,682 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 08:51:43,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 08:51:43,682 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-07-25 08:51:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:43,682 INFO L225 Difference]: With dead ends: 113 [2018-07-25 08:51:43,682 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 08:51:43,683 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:51:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 08:51:43,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 08:51:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 08:51:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 08:51:43,686 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-07-25 08:51:43,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:43,687 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 08:51:43,687 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 08:51:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 08:51:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 08:51:43,687 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:43,687 INFO L354 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-07-25 08:51:43,687 INFO L415 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:43,688 INFO L82 PathProgramCache]: Analyzing trace with hash 179553222, now seen corresponding path program 107 times [2018-07-25 08:51:43,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:44,609 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:44,609 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 08:51:44,610 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 08:51:44,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 08:51:44,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 08:51:44,611 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-07-25 08:51:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:45,450 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-07-25 08:51:45,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 08:51:45,450 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-07-25 08:51:45,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:45,451 INFO L225 Difference]: With dead ends: 114 [2018-07-25 08:51:45,451 INFO L226 Difference]: Without dead ends: 112 [2018-07-25 08:51:45,451 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 08:51:45,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-25 08:51:45,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-07-25 08:51:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-07-25 08:51:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-07-25 08:51:45,454 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-07-25 08:51:45,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:45,454 INFO L472 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-07-25 08:51:45,454 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 08:51:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-07-25 08:51:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-07-25 08:51:45,455 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:45,455 INFO L354 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-07-25 08:51:45,455 INFO L415 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:45,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178720, now seen corresponding path program 108 times [2018-07-25 08:51:45,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:46,436 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:46,436 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 08:51:46,437 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 08:51:46,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 08:51:46,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:51:46,438 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-07-25 08:51:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:47,299 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 08:51:47,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 08:51:47,299 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-07-25 08:51:47,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:47,300 INFO L225 Difference]: With dead ends: 115 [2018-07-25 08:51:47,300 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 08:51:47,301 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:51:47,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 08:51:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 08:51:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 08:51:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 08:51:47,303 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-07-25 08:51:47,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:47,303 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 08:51:47,303 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 08:51:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 08:51:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 08:51:47,304 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:47,304 INFO L354 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-07-25 08:51:47,304 INFO L415 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:47,304 INFO L82 PathProgramCache]: Analyzing trace with hash 751830790, now seen corresponding path program 109 times [2018-07-25 08:51:47,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:48,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:48,447 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 08:51:48,448 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 08:51:48,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 08:51:48,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 08:51:48,449 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-07-25 08:51:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:49,386 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-07-25 08:51:49,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 08:51:49,387 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-07-25 08:51:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:49,387 INFO L225 Difference]: With dead ends: 116 [2018-07-25 08:51:49,387 INFO L226 Difference]: Without dead ends: 114 [2018-07-25 08:51:49,388 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 08:51:49,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-25 08:51:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-07-25 08:51:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-07-25 08:51:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-07-25 08:51:49,392 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-07-25 08:51:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:49,392 INFO L472 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-07-25 08:51:49,392 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 08:51:49,393 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-07-25 08:51:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-07-25 08:51:49,393 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:49,393 INFO L354 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-07-25 08:51:49,393 INFO L415 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:49,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914144, now seen corresponding path program 110 times [2018-07-25 08:51:49,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:50,753 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:50,753 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 08:51:50,753 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 08:51:50,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 08:51:50,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:51:50,754 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-07-25 08:51:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:51,689 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 08:51:51,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 08:51:51,689 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-07-25 08:51:51,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:51,690 INFO L225 Difference]: With dead ends: 117 [2018-07-25 08:51:51,690 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 08:51:51,691 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:51:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 08:51:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 08:51:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 08:51:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 08:51:51,695 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-07-25 08:51:51,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:51,695 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 08:51:51,695 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 08:51:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 08:51:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 08:51:51,696 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:51,696 INFO L354 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-07-25 08:51:51,696 INFO L415 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:51,696 INFO L82 PathProgramCache]: Analyzing trace with hash 954759750, now seen corresponding path program 111 times [2018-07-25 08:51:51,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:52,813 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:52,813 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 08:51:52,813 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 08:51:52,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 08:51:52,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 08:51:52,814 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-07-25 08:51:53,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:53,771 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-07-25 08:51:53,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 08:51:53,772 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-07-25 08:51:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:53,772 INFO L225 Difference]: With dead ends: 118 [2018-07-25 08:51:53,772 INFO L226 Difference]: Without dead ends: 116 [2018-07-25 08:51:53,773 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 08:51:53,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-25 08:51:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-07-25 08:51:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-25 08:51:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-07-25 08:51:53,776 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-07-25 08:51:53,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:53,776 INFO L472 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-07-25 08:51:53,776 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 08:51:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-07-25 08:51:53,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-25 08:51:53,776 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:53,776 INFO L354 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-07-25 08:51:53,777 INFO L415 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:53,777 INFO L82 PathProgramCache]: Analyzing trace with hash -467222688, now seen corresponding path program 112 times [2018-07-25 08:51:53,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:54,933 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:54,933 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 08:51:54,934 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 08:51:54,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 08:51:54,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:51:54,935 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2018-07-25 08:51:55,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:55,917 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 08:51:55,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 08:51:55,917 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2018-07-25 08:51:55,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:55,918 INFO L225 Difference]: With dead ends: 119 [2018-07-25 08:51:55,918 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 08:51:55,919 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:51:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 08:51:55,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 08:51:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 08:51:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 08:51:55,921 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-07-25 08:51:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:55,921 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 08:51:55,921 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 08:51:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 08:51:55,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 08:51:55,922 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:55,922 INFO L354 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2018-07-25 08:51:55,922 INFO L415 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:55,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005306, now seen corresponding path program 113 times [2018-07-25 08:51:55,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:57,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:57,073 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:57,073 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 08:51:57,074 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 08:51:57,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 08:51:57,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 08:51:57,075 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2018-07-25 08:51:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:58,142 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-07-25 08:51:58,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 08:51:58,142 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2018-07-25 08:51:58,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:58,143 INFO L225 Difference]: With dead ends: 120 [2018-07-25 08:51:58,143 INFO L226 Difference]: Without dead ends: 118 [2018-07-25 08:51:58,143 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 08:51:58,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-07-25 08:51:58,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-07-25 08:51:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-25 08:51:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-07-25 08:51:58,147 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-07-25 08:51:58,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:58,147 INFO L472 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-07-25 08:51:58,147 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 08:51:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-07-25 08:51:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-25 08:51:58,148 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:58,148 INFO L354 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2018-07-25 08:51:58,148 INFO L415 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:58,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439200, now seen corresponding path program 114 times [2018-07-25 08:51:58,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:51:59,325 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:59,325 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 08:51:59,325 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 08:51:59,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 08:51:59,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:51:59,326 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2018-07-25 08:52:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:00,342 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 08:52:00,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 08:52:00,342 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2018-07-25 08:52:00,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:00,343 INFO L225 Difference]: With dead ends: 121 [2018-07-25 08:52:00,343 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 08:52:00,344 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:52:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 08:52:00,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 08:52:00,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 08:52:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 08:52:00,347 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-07-25 08:52:00,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:00,348 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 08:52:00,348 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 08:52:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 08:52:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 08:52:00,348 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:00,349 INFO L354 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2018-07-25 08:52:00,349 INFO L415 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:00,349 INFO L82 PathProgramCache]: Analyzing trace with hash 954069190, now seen corresponding path program 115 times [2018-07-25 08:52:00,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:01,539 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:01,539 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 08:52:01,540 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 08:52:01,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 08:52:01,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 08:52:01,541 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2018-07-25 08:52:02,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:02,591 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-07-25 08:52:02,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 08:52:02,591 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2018-07-25 08:52:02,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:02,591 INFO L225 Difference]: With dead ends: 122 [2018-07-25 08:52:02,591 INFO L226 Difference]: Without dead ends: 120 [2018-07-25 08:52:02,592 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 08:52:02,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-07-25 08:52:02,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-07-25 08:52:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-07-25 08:52:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-07-25 08:52:02,596 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-07-25 08:52:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:02,596 INFO L472 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-07-25 08:52:02,596 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 08:52:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-07-25 08:52:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-07-25 08:52:02,597 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:02,597 INFO L354 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2018-07-25 08:52:02,597 INFO L415 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:02,597 INFO L82 PathProgramCache]: Analyzing trace with hash -488630048, now seen corresponding path program 116 times [2018-07-25 08:52:02,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:03,799 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:03,799 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 08:52:03,800 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 08:52:03,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 08:52:03,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:52:03,801 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2018-07-25 08:52:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:04,870 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 08:52:04,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 08:52:04,871 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2018-07-25 08:52:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:04,871 INFO L225 Difference]: With dead ends: 123 [2018-07-25 08:52:04,871 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 08:52:04,872 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:52:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 08:52:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 08:52:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 08:52:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 08:52:04,876 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-07-25 08:52:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:04,876 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 08:52:04,876 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 08:52:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 08:52:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 08:52:04,877 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:04,877 INFO L354 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2018-07-25 08:52:04,877 INFO L415 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:04,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333830, now seen corresponding path program 117 times [2018-07-25 08:52:04,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:06,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:06,186 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:06,187 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 08:52:06,187 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 08:52:06,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 08:52:06,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 08:52:06,188 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2018-07-25 08:52:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:07,148 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-07-25 08:52:07,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 08:52:07,148 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2018-07-25 08:52:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:07,149 INFO L225 Difference]: With dead ends: 124 [2018-07-25 08:52:07,149 INFO L226 Difference]: Without dead ends: 122 [2018-07-25 08:52:07,150 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 08:52:07,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-25 08:52:07,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-07-25 08:52:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-07-25 08:52:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-07-25 08:52:07,153 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-07-25 08:52:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:07,154 INFO L472 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-07-25 08:52:07,154 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 08:52:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-07-25 08:52:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-25 08:52:07,154 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:07,154 INFO L354 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2018-07-25 08:52:07,155 INFO L415 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:07,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1422164576, now seen corresponding path program 118 times [2018-07-25 08:52:07,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:08,303 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:08,303 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 08:52:08,304 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 08:52:08,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 08:52:08,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:52:08,305 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 121 states. [2018-07-25 08:52:09,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:09,297 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 08:52:09,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 08:52:09,297 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 121 [2018-07-25 08:52:09,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:09,298 INFO L225 Difference]: With dead ends: 125 [2018-07-25 08:52:09,298 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 08:52:09,298 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:52:09,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 08:52:09,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 08:52:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 08:52:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 08:52:09,301 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-07-25 08:52:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:09,301 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 08:52:09,301 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 08:52:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 08:52:09,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 08:52:09,302 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:09,302 INFO L354 BasicCegarLoop]: trace histogram [119, 1, 1, 1] [2018-07-25 08:52:09,302 INFO L415 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:09,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1137432762, now seen corresponding path program 119 times [2018-07-25 08:52:09,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:10,489 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:10,489 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 08:52:10,490 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 08:52:10,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 08:52:10,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 08:52:10,490 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 122 states. [2018-07-25 08:52:11,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:11,476 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-07-25 08:52:11,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 08:52:11,477 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 122 [2018-07-25 08:52:11,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:11,477 INFO L225 Difference]: With dead ends: 126 [2018-07-25 08:52:11,477 INFO L226 Difference]: Without dead ends: 124 [2018-07-25 08:52:11,478 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 08:52:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-07-25 08:52:11,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-07-25 08:52:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-25 08:52:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-07-25 08:52:11,481 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-07-25 08:52:11,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:11,482 INFO L472 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-07-25 08:52:11,482 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 08:52:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-07-25 08:52:11,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-25 08:52:11,482 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:11,482 INFO L354 BasicCegarLoop]: trace histogram [120, 1, 1, 1] [2018-07-25 08:52:11,483 INFO L415 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:11,483 INFO L82 PathProgramCache]: Analyzing trace with hash -900681120, now seen corresponding path program 120 times [2018-07-25 08:52:11,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:12,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:12,919 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:12,919 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 08:52:12,920 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 08:52:12,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 08:52:12,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:52:12,920 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 123 states. [2018-07-25 08:52:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:13,974 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 08:52:13,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 08:52:13,974 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 123 [2018-07-25 08:52:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:13,975 INFO L225 Difference]: With dead ends: 127 [2018-07-25 08:52:13,975 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 08:52:13,975 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:52:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 08:52:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 08:52:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 08:52:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 08:52:13,979 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-07-25 08:52:13,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:13,979 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 08:52:13,979 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 08:52:13,979 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 08:52:13,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 08:52:13,980 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:13,980 INFO L354 BasicCegarLoop]: trace histogram [121, 1, 1, 1] [2018-07-25 08:52:13,980 INFO L415 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:13,980 INFO L82 PathProgramCache]: Analyzing trace with hash 2143652486, now seen corresponding path program 121 times [2018-07-25 08:52:13,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:15,152 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:15,152 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 08:52:15,152 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 08:52:15,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 08:52:15,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 08:52:15,153 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 124 states. [2018-07-25 08:52:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:16,295 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-07-25 08:52:16,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 08:52:16,296 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 124 [2018-07-25 08:52:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:16,296 INFO L225 Difference]: With dead ends: 128 [2018-07-25 08:52:16,296 INFO L226 Difference]: Without dead ends: 126 [2018-07-25 08:52:16,297 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 08:52:16,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-07-25 08:52:16,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-07-25 08:52:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-25 08:52:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-07-25 08:52:16,300 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-07-25 08:52:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:16,300 INFO L472 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-07-25 08:52:16,300 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 08:52:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-07-25 08:52:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-07-25 08:52:16,301 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:16,301 INFO L354 BasicCegarLoop]: trace histogram [122, 1, 1, 1] [2018-07-25 08:52:16,301 INFO L415 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:16,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2028713760, now seen corresponding path program 122 times [2018-07-25 08:52:16,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:17,675 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:17,675 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 08:52:17,676 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 08:52:17,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 08:52:17,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:52:17,677 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 125 states. [2018-07-25 08:52:18,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:18,820 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 08:52:18,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 08:52:18,820 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 125 [2018-07-25 08:52:18,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:18,821 INFO L225 Difference]: With dead ends: 129 [2018-07-25 08:52:18,821 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 08:52:18,822 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:52:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 08:52:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 08:52:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 08:52:18,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 08:52:18,824 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-07-25 08:52:18,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:18,825 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 08:52:18,825 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 08:52:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 08:52:18,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 08:52:18,825 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:18,825 INFO L354 BasicCegarLoop]: trace histogram [123, 1, 1, 1] [2018-07-25 08:52:18,826 INFO L415 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:18,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1534386746, now seen corresponding path program 123 times [2018-07-25 08:52:18,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:20,205 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:20,205 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 08:52:20,205 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 08:52:20,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 08:52:20,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 08:52:20,206 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 126 states. [2018-07-25 08:52:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:21,411 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-07-25 08:52:21,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 08:52:21,412 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 126 [2018-07-25 08:52:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:21,412 INFO L225 Difference]: With dead ends: 130 [2018-07-25 08:52:21,412 INFO L226 Difference]: Without dead ends: 128 [2018-07-25 08:52:21,413 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 08:52:21,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-25 08:52:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-07-25 08:52:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-25 08:52:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-07-25 08:52:21,416 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-07-25 08:52:21,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:21,416 INFO L472 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-07-25 08:52:21,417 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 08:52:21,417 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-07-25 08:52:21,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-25 08:52:21,417 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:21,417 INFO L354 BasicCegarLoop]: trace histogram [124, 1, 1, 1] [2018-07-25 08:52:21,418 INFO L415 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:21,418 INFO L82 PathProgramCache]: Analyzing trace with hash -321352736, now seen corresponding path program 124 times [2018-07-25 08:52:21,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:22,796 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:22,796 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 08:52:22,796 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 08:52:22,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 08:52:22,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:52:22,798 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 127 states. [2018-07-25 08:52:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:24,004 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 08:52:24,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 08:52:24,004 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 127 [2018-07-25 08:52:24,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:24,004 INFO L225 Difference]: With dead ends: 131 [2018-07-25 08:52:24,004 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 08:52:24,005 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:52:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 08:52:24,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 08:52:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 08:52:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 08:52:24,008 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-07-25 08:52:24,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:24,008 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 08:52:24,008 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 08:52:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 08:52:24,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 08:52:24,009 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:24,009 INFO L354 BasicCegarLoop]: trace histogram [125, 1, 1, 1] [2018-07-25 08:52:24,009 INFO L415 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:24,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1372004090, now seen corresponding path program 125 times [2018-07-25 08:52:24,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:25,460 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:25,460 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 08:52:25,460 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 08:52:25,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 08:52:25,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 08:52:25,462 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 128 states. [2018-07-25 08:52:26,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:26,697 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-07-25 08:52:26,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 08:52:26,697 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 128 [2018-07-25 08:52:26,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:26,697 INFO L225 Difference]: With dead ends: 132 [2018-07-25 08:52:26,698 INFO L226 Difference]: Without dead ends: 130 [2018-07-25 08:52:26,699 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 08:52:26,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-25 08:52:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-07-25 08:52:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-07-25 08:52:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-07-25 08:52:26,703 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-07-25 08:52:26,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:26,704 INFO L472 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-07-25 08:52:26,704 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 08:52:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-07-25 08:52:26,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-25 08:52:26,704 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:26,704 INFO L354 BasicCegarLoop]: trace histogram [126, 1, 1, 1] [2018-07-25 08:52:26,705 INFO L415 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:26,705 INFO L82 PathProgramCache]: Analyzing trace with hash 417542304, now seen corresponding path program 126 times [2018-07-25 08:52:26,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:28,193 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:28,193 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 08:52:28,194 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 08:52:28,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 08:52:28,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:52:28,195 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 129 states. [2018-07-25 08:52:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:29,447 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 08:52:29,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 08:52:29,447 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 129 [2018-07-25 08:52:29,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:29,448 INFO L225 Difference]: With dead ends: 133 [2018-07-25 08:52:29,448 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 08:52:29,449 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:52:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 08:52:29,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 08:52:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 08:52:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 08:52:29,452 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-07-25 08:52:29,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:29,452 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 08:52:29,452 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 08:52:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 08:52:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 08:52:29,452 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:29,453 INFO L354 BasicCegarLoop]: trace histogram [127, 1, 1, 1] [2018-07-25 08:52:29,453 INFO L415 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:29,453 INFO L82 PathProgramCache]: Analyzing trace with hash 58905670, now seen corresponding path program 127 times [2018-07-25 08:52:29,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:30,922 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:30,922 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 08:52:30,923 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 08:52:30,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 08:52:30,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 08:52:30,924 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 130 states. [2018-07-25 08:52:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:32,192 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-07-25 08:52:32,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 08:52:32,193 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 130 [2018-07-25 08:52:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:32,193 INFO L225 Difference]: With dead ends: 134 [2018-07-25 08:52:32,193 INFO L226 Difference]: Without dead ends: 132 [2018-07-25 08:52:32,194 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 08:52:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-25 08:52:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-07-25 08:52:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-25 08:52:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-07-25 08:52:32,199 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-07-25 08:52:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:32,199 INFO L472 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-07-25 08:52:32,199 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 08:52:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-07-25 08:52:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-25 08:52:32,199 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:32,200 INFO L354 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2018-07-25 08:52:32,200 INFO L415 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:32,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1826071904, now seen corresponding path program 128 times [2018-07-25 08:52:32,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:33,708 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:33,708 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 08:52:33,708 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 08:52:33,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 08:52:33,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:52:33,709 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 131 states. [2018-07-25 08:52:34,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:34,965 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 08:52:34,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 08:52:34,965 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2018-07-25 08:52:34,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:34,965 INFO L225 Difference]: With dead ends: 135 [2018-07-25 08:52:34,965 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 08:52:34,966 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:52:34,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 08:52:34,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 08:52:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 08:52:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 08:52:34,969 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-07-25 08:52:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:34,970 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 08:52:34,970 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 08:52:34,970 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 08:52:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 08:52:34,970 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:34,970 INFO L354 BasicCegarLoop]: trace histogram [129, 1, 1, 1] [2018-07-25 08:52:34,971 INFO L415 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:34,971 INFO L82 PathProgramCache]: Analyzing trace with hash 773650310, now seen corresponding path program 129 times [2018-07-25 08:52:34,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:36,491 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:36,491 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 08:52:36,491 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 08:52:36,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 08:52:36,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 08:52:36,492 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 132 states. [2018-07-25 08:52:37,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:37,797 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-07-25 08:52:37,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 08:52:37,797 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 132 [2018-07-25 08:52:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:37,798 INFO L225 Difference]: With dead ends: 136 [2018-07-25 08:52:37,798 INFO L226 Difference]: Without dead ends: 134 [2018-07-25 08:52:37,799 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 08:52:37,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-25 08:52:37,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-07-25 08:52:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-25 08:52:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-07-25 08:52:37,802 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-07-25 08:52:37,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:37,802 INFO L472 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-07-25 08:52:37,802 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 08:52:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-07-25 08:52:37,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-25 08:52:37,802 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:37,802 INFO L354 BasicCegarLoop]: trace histogram [130, 1, 1, 1] [2018-07-25 08:52:37,803 INFO L415 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:37,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1786648032, now seen corresponding path program 130 times [2018-07-25 08:52:37,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:39,334 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:39,335 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 08:52:39,335 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 08:52:39,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 08:52:39,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:52:39,336 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 133 states. [2018-07-25 08:52:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:40,685 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 08:52:40,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 08:52:40,685 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 133 [2018-07-25 08:52:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:40,686 INFO L225 Difference]: With dead ends: 137 [2018-07-25 08:52:40,686 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 08:52:40,687 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:52:40,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 08:52:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 08:52:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 08:52:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 08:52:40,690 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-07-25 08:52:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:40,690 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 08:52:40,690 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 08:52:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 08:52:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 08:52:40,691 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:40,691 INFO L354 BasicCegarLoop]: trace histogram [131, 1, 1, 1] [2018-07-25 08:52:40,691 INFO L415 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:40,691 INFO L82 PathProgramCache]: Analyzing trace with hash 448481990, now seen corresponding path program 131 times [2018-07-25 08:52:40,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:42,261 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:42,261 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 08:52:42,261 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 08:52:42,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 08:52:42,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 08:52:42,262 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 134 states. [2018-07-25 08:52:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:43,650 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-07-25 08:52:43,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 08:52:43,651 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 134 [2018-07-25 08:52:43,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:43,651 INFO L225 Difference]: With dead ends: 138 [2018-07-25 08:52:43,651 INFO L226 Difference]: Without dead ends: 136 [2018-07-25 08:52:43,652 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 08:52:43,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-25 08:52:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-07-25 08:52:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-25 08:52:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-07-25 08:52:43,656 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-07-25 08:52:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:43,656 INFO L472 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-07-25 08:52:43,656 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 08:52:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-07-25 08:52:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-25 08:52:43,657 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:43,657 INFO L354 BasicCegarLoop]: trace histogram [132, 1, 1, 1] [2018-07-25 08:52:43,657 INFO L415 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:43,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1018035936, now seen corresponding path program 132 times [2018-07-25 08:52:43,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:45,321 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:45,321 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 08:52:45,322 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 08:52:45,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 08:52:45,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:52:45,323 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 135 states. [2018-07-25 08:52:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:46,755 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 08:52:46,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 08:52:46,756 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 135 [2018-07-25 08:52:46,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:46,756 INFO L225 Difference]: With dead ends: 139 [2018-07-25 08:52:46,756 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 08:52:46,757 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:52:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 08:52:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 08:52:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 08:52:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 08:52:46,760 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-07-25 08:52:46,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:46,760 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 08:52:46,760 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 08:52:46,760 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 08:52:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 08:52:46,761 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:46,761 INFO L354 BasicCegarLoop]: trace histogram [133, 1, 1, 1] [2018-07-25 08:52:46,761 INFO L415 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:46,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1494339078, now seen corresponding path program 133 times [2018-07-25 08:52:46,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:48,419 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:48,419 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 08:52:48,420 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 08:52:48,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 08:52:48,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 08:52:48,421 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 136 states. [2018-07-25 08:52:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:49,880 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-07-25 08:52:49,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 08:52:49,880 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 136 [2018-07-25 08:52:49,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:49,881 INFO L225 Difference]: With dead ends: 140 [2018-07-25 08:52:49,881 INFO L226 Difference]: Without dead ends: 138 [2018-07-25 08:52:49,882 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 08:52:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-07-25 08:52:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-07-25 08:52:49,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-25 08:52:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-07-25 08:52:49,885 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-07-25 08:52:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:49,885 INFO L472 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-07-25 08:52:49,885 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 08:52:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-07-25 08:52:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-25 08:52:49,886 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:49,886 INFO L354 BasicCegarLoop]: trace histogram [134, 1, 1, 1] [2018-07-25 08:52:49,886 INFO L415 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:49,886 INFO L82 PathProgramCache]: Analyzing trace with hash -920132704, now seen corresponding path program 134 times [2018-07-25 08:52:49,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:51,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:51,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 08:52:51,567 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 08:52:51,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 08:52:51,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:52:51,568 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 137 states. [2018-07-25 08:52:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:53,041 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 08:52:53,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 08:52:53,041 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 137 [2018-07-25 08:52:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:53,042 INFO L225 Difference]: With dead ends: 141 [2018-07-25 08:52:53,042 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 08:52:53,042 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:52:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 08:52:53,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 08:52:53,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 08:52:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 08:52:53,045 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-07-25 08:52:53,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:53,046 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 08:52:53,046 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 08:52:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 08:52:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 08:52:53,046 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:53,046 INFO L354 BasicCegarLoop]: trace histogram [135, 1, 1, 1] [2018-07-25 08:52:53,046 INFO L415 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:53,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1540653382, now seen corresponding path program 135 times [2018-07-25 08:52:53,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:54,726 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:54,726 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 08:52:54,727 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 08:52:54,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 08:52:54,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 08:52:54,728 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 138 states. [2018-07-25 08:52:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:56,228 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-07-25 08:52:56,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 08:52:56,229 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 138 [2018-07-25 08:52:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:56,229 INFO L225 Difference]: With dead ends: 142 [2018-07-25 08:52:56,229 INFO L226 Difference]: Without dead ends: 140 [2018-07-25 08:52:56,230 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 08:52:56,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-25 08:52:56,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-07-25 08:52:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-07-25 08:52:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-07-25 08:52:56,233 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-07-25 08:52:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:56,233 INFO L472 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-07-25 08:52:56,233 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 08:52:56,233 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-07-25 08:52:56,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-25 08:52:56,234 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:56,234 INFO L354 BasicCegarLoop]: trace histogram [136, 1, 1, 1] [2018-07-25 08:52:56,234 INFO L415 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:56,234 INFO L82 PathProgramCache]: Analyzing trace with hash 515610720, now seen corresponding path program 136 times [2018-07-25 08:52:56,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:52:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:52:57,960 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:52:57,960 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 08:52:57,961 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 08:52:57,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 08:52:57,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 08:52:57,961 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 139 states. [2018-07-25 08:52:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:52:59,466 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 08:52:59,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 08:52:59,466 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 139 [2018-07-25 08:52:59,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:52:59,466 INFO L225 Difference]: With dead ends: 143 [2018-07-25 08:52:59,466 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 08:52:59,467 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 08:52:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 08:52:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 08:52:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 08:52:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 08:52:59,470 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-07-25 08:52:59,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:52:59,470 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 08:52:59,470 INFO L473 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-25 08:52:59,470 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 08:52:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 08:52:59,471 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:52:59,471 INFO L354 BasicCegarLoop]: trace histogram [137, 1, 1, 1] [2018-07-25 08:52:59,471 INFO L415 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:52:59,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1195940730, now seen corresponding path program 137 times [2018-07-25 08:52:59,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:52:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:01,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:01,212 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:01,212 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 08:53:01,213 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 08:53:01,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 08:53:01,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 08:53:01,214 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 140 states. [2018-07-25 08:53:02,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:02,750 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-07-25 08:53:02,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 08:53:02,751 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 140 [2018-07-25 08:53:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:02,751 INFO L225 Difference]: With dead ends: 144 [2018-07-25 08:53:02,751 INFO L226 Difference]: Without dead ends: 142 [2018-07-25 08:53:02,752 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 08:53:02,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-07-25 08:53:02,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-07-25 08:53:02,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-07-25 08:53:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-07-25 08:53:02,755 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-07-25 08:53:02,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:02,755 INFO L472 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-07-25 08:53:02,755 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 08:53:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-07-25 08:53:02,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-25 08:53:02,756 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:02,756 INFO L354 BasicCegarLoop]: trace histogram [138, 1, 1, 1] [2018-07-25 08:53:02,756 INFO L415 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:02,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1580539168, now seen corresponding path program 138 times [2018-07-25 08:53:02,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:04,528 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:04,528 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-25 08:53:04,529 INFO L451 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-25 08:53:04,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-25 08:53:04,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 08:53:04,530 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 141 states. [2018-07-25 08:53:06,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:06,093 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 08:53:06,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 08:53:06,094 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 141 [2018-07-25 08:53:06,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:06,094 INFO L225 Difference]: With dead ends: 145 [2018-07-25 08:53:06,094 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 08:53:06,095 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 08:53:06,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 08:53:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 08:53:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 08:53:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 08:53:06,099 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-07-25 08:53:06,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:06,099 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 08:53:06,099 INFO L473 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-25 08:53:06,099 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 08:53:06,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 08:53:06,100 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:06,100 INFO L354 BasicCegarLoop]: trace histogram [139, 1, 1, 1] [2018-07-25 08:53:06,100 INFO L415 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:06,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1752070086, now seen corresponding path program 139 times [2018-07-25 08:53:06,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:07,894 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:07,894 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 08:53:07,894 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 08:53:07,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 08:53:07,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 08:53:07,895 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 142 states. [2018-07-25 08:53:09,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:09,461 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-07-25 08:53:09,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 08:53:09,462 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 142 [2018-07-25 08:53:09,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:09,462 INFO L225 Difference]: With dead ends: 146 [2018-07-25 08:53:09,462 INFO L226 Difference]: Without dead ends: 144 [2018-07-25 08:53:09,463 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 08:53:09,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-25 08:53:09,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-25 08:53:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-25 08:53:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-07-25 08:53:09,467 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-07-25 08:53:09,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:09,467 INFO L472 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-07-25 08:53:09,468 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 08:53:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-07-25 08:53:09,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-07-25 08:53:09,468 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:09,468 INFO L354 BasicCegarLoop]: trace histogram [140, 1, 1, 1] [2018-07-25 08:53:09,469 INFO L415 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:09,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1520406048, now seen corresponding path program 140 times [2018-07-25 08:53:09,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:11,310 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:11,310 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-25 08:53:11,311 INFO L451 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-25 08:53:11,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-25 08:53:11,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 08:53:11,312 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 143 states. [2018-07-25 08:53:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:12,886 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 08:53:12,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 08:53:12,887 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 143 [2018-07-25 08:53:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:12,887 INFO L225 Difference]: With dead ends: 147 [2018-07-25 08:53:12,887 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 08:53:12,888 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 08:53:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 08:53:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 08:53:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 08:53:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 08:53:12,892 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-07-25 08:53:12,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:12,892 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 08:53:12,892 INFO L473 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-25 08:53:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 08:53:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 08:53:12,893 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:12,893 INFO L354 BasicCegarLoop]: trace histogram [141, 1, 1, 1] [2018-07-25 08:53:12,893 INFO L415 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash 112048902, now seen corresponding path program 141 times [2018-07-25 08:53:12,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:14,754 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:14,754 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 08:53:14,754 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 08:53:14,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 08:53:14,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 08:53:14,755 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 144 states. [2018-07-25 08:53:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:16,337 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-07-25 08:53:16,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 08:53:16,337 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 144 [2018-07-25 08:53:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:16,338 INFO L225 Difference]: With dead ends: 148 [2018-07-25 08:53:16,338 INFO L226 Difference]: Without dead ends: 146 [2018-07-25 08:53:16,338 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 08:53:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-25 08:53:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-07-25 08:53:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-25 08:53:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-07-25 08:53:16,342 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-07-25 08:53:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:16,342 INFO L472 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-07-25 08:53:16,342 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 08:53:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-07-25 08:53:16,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-25 08:53:16,342 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:16,342 INFO L354 BasicCegarLoop]: trace histogram [142, 1, 1, 1] [2018-07-25 08:53:16,343 INFO L415 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:16,343 INFO L82 PathProgramCache]: Analyzing trace with hash -821455200, now seen corresponding path program 142 times [2018-07-25 08:53:16,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:18,186 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:18,186 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-25 08:53:18,186 INFO L451 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-25 08:53:18,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-25 08:53:18,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 08:53:18,187 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 145 states. [2018-07-25 08:53:19,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:19,774 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 08:53:19,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 08:53:19,774 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 145 [2018-07-25 08:53:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:19,775 INFO L225 Difference]: With dead ends: 149 [2018-07-25 08:53:19,775 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 08:53:19,776 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 08:53:19,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 08:53:19,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 08:53:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 08:53:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 08:53:19,779 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-07-25 08:53:19,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:19,779 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 08:53:19,779 INFO L473 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-25 08:53:19,779 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 08:53:19,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 08:53:19,779 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:19,779 INFO L354 BasicCegarLoop]: trace histogram [143, 1, 1, 1] [2018-07-25 08:53:19,780 INFO L415 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:19,780 INFO L82 PathProgramCache]: Analyzing trace with hash 304688710, now seen corresponding path program 143 times [2018-07-25 08:53:19,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:21,485 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:21,485 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 08:53:21,486 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 08:53:21,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 08:53:21,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 08:53:21,487 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 146 states. [2018-07-25 08:53:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:23,108 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-07-25 08:53:23,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 08:53:23,108 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 146 [2018-07-25 08:53:23,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:23,109 INFO L225 Difference]: With dead ends: 150 [2018-07-25 08:53:23,109 INFO L226 Difference]: Without dead ends: 148 [2018-07-25 08:53:23,110 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 08:53:23,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-07-25 08:53:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-07-25 08:53:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-25 08:53:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-07-25 08:53:23,114 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-07-25 08:53:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:23,114 INFO L472 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-07-25 08:53:23,114 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 08:53:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-07-25 08:53:23,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-25 08:53:23,114 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:23,115 INFO L354 BasicCegarLoop]: trace histogram [144, 1, 1, 1] [2018-07-25 08:53:23,115 INFO L415 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:23,115 INFO L82 PathProgramCache]: Analyzing trace with hash 855411552, now seen corresponding path program 144 times [2018-07-25 08:53:23,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:24,999 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:24,999 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-25 08:53:24,999 INFO L451 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-25 08:53:24,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-25 08:53:25,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 08:53:25,000 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 147 states. [2018-07-25 08:53:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:26,683 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 08:53:26,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 08:53:26,683 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 147 [2018-07-25 08:53:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:26,684 INFO L225 Difference]: With dead ends: 151 [2018-07-25 08:53:26,684 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 08:53:26,684 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 08:53:26,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 08:53:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 08:53:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 08:53:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 08:53:26,687 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-07-25 08:53:26,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:26,688 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 08:53:26,688 INFO L473 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-25 08:53:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 08:53:26,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 08:53:26,688 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:26,688 INFO L354 BasicCegarLoop]: trace histogram [145, 1, 1, 1] [2018-07-25 08:53:26,688 INFO L415 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:26,689 INFO L82 PathProgramCache]: Analyzing trace with hash 747950470, now seen corresponding path program 145 times [2018-07-25 08:53:26,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:28,590 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:28,590 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 08:53:28,590 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 08:53:28,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 08:53:28,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 08:53:28,592 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 148 states. [2018-07-25 08:53:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:30,293 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-07-25 08:53:30,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 08:53:30,294 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 148 [2018-07-25 08:53:30,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:30,294 INFO L225 Difference]: With dead ends: 152 [2018-07-25 08:53:30,294 INFO L226 Difference]: Without dead ends: 150 [2018-07-25 08:53:30,295 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 08:53:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-25 08:53:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-07-25 08:53:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-25 08:53:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-07-25 08:53:30,299 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-07-25 08:53:30,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:30,299 INFO L472 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-07-25 08:53:30,299 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 08:53:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-07-25 08:53:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-25 08:53:30,300 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:30,300 INFO L354 BasicCegarLoop]: trace histogram [146, 1, 1, 1] [2018-07-25 08:53:30,300 INFO L415 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:30,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1711624224, now seen corresponding path program 146 times [2018-07-25 08:53:30,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:32,280 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:32,280 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-25 08:53:32,280 INFO L451 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-25 08:53:32,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-25 08:53:32,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 08:53:32,282 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 149 states. [2018-07-25 08:53:33,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:33,995 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 08:53:33,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 08:53:33,996 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 149 [2018-07-25 08:53:33,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:33,996 INFO L225 Difference]: With dead ends: 153 [2018-07-25 08:53:33,996 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 08:53:33,997 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 08:53:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 08:53:33,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 08:53:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 08:53:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 08:53:34,000 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-07-25 08:53:34,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:34,000 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 08:53:34,000 INFO L473 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-25 08:53:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 08:53:34,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 08:53:34,001 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:34,001 INFO L354 BasicCegarLoop]: trace histogram [147, 1, 1, 1] [2018-07-25 08:53:34,001 INFO L415 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:34,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1520739526, now seen corresponding path program 147 times [2018-07-25 08:53:34,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:35,981 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:35,981 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 08:53:35,981 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 08:53:35,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 08:53:35,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 08:53:35,982 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 150 states. [2018-07-25 08:53:37,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:37,676 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-07-25 08:53:37,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 08:53:37,676 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 150 [2018-07-25 08:53:37,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:37,677 INFO L225 Difference]: With dead ends: 154 [2018-07-25 08:53:37,677 INFO L226 Difference]: Without dead ends: 152 [2018-07-25 08:53:37,678 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 08:53:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-07-25 08:53:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-07-25 08:53:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-25 08:53:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-07-25 08:53:37,681 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-07-25 08:53:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:37,681 INFO L472 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-07-25 08:53:37,681 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 08:53:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-07-25 08:53:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-25 08:53:37,681 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:37,681 INFO L354 BasicCegarLoop]: trace histogram [148, 1, 1, 1] [2018-07-25 08:53:37,682 INFO L415 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:37,682 INFO L82 PathProgramCache]: Analyzing trace with hash -101718816, now seen corresponding path program 148 times [2018-07-25 08:53:37,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:39,667 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:39,667 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-25 08:53:39,667 INFO L451 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-25 08:53:39,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-25 08:53:39,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 08:53:39,668 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 151 states. [2018-07-25 08:53:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:41,414 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 08:53:41,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 08:53:41,415 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 151 [2018-07-25 08:53:41,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:41,415 INFO L225 Difference]: With dead ends: 155 [2018-07-25 08:53:41,415 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 08:53:41,416 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 08:53:41,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 08:53:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 08:53:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 08:53:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 08:53:41,419 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-07-25 08:53:41,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:41,419 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 08:53:41,419 INFO L473 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-25 08:53:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 08:53:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 08:53:41,420 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:41,420 INFO L354 BasicCegarLoop]: trace histogram [149, 1, 1, 1] [2018-07-25 08:53:41,420 INFO L415 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:41,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1141680134, now seen corresponding path program 149 times [2018-07-25 08:53:41,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:43,436 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:43,436 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 08:53:43,436 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 08:53:43,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 08:53:43,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 08:53:43,438 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 152 states. [2018-07-25 08:53:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:45,211 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-07-25 08:53:45,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 08:53:45,211 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 152 [2018-07-25 08:53:45,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:45,212 INFO L225 Difference]: With dead ends: 156 [2018-07-25 08:53:45,212 INFO L226 Difference]: Without dead ends: 154 [2018-07-25 08:53:45,212 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 08:53:45,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-25 08:53:45,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-07-25 08:53:45,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-07-25 08:53:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-07-25 08:53:45,215 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 152 [2018-07-25 08:53:45,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:45,215 INFO L472 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-07-25 08:53:45,215 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 08:53:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-07-25 08:53:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-25 08:53:45,216 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:45,216 INFO L354 BasicCegarLoop]: trace histogram [150, 1, 1, 1] [2018-07-25 08:53:45,216 INFO L415 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:45,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1032341920, now seen corresponding path program 150 times [2018-07-25 08:53:45,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:47,247 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:47,247 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-25 08:53:47,248 INFO L451 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-25 08:53:47,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-25 08:53:47,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 08:53:47,249 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 153 states. [2018-07-25 08:53:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:49,050 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 08:53:49,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 08:53:49,050 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 153 [2018-07-25 08:53:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:49,050 INFO L225 Difference]: With dead ends: 157 [2018-07-25 08:53:49,050 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 08:53:49,051 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 08:53:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 08:53:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 08:53:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 08:53:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 08:53:49,054 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 153 [2018-07-25 08:53:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:49,054 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 08:53:49,054 INFO L473 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-25 08:53:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 08:53:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 08:53:49,055 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:49,055 INFO L354 BasicCegarLoop]: trace histogram [151, 1, 1, 1] [2018-07-25 08:53:49,055 INFO L415 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:49,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1937824582, now seen corresponding path program 151 times [2018-07-25 08:53:49,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:50,997 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:50,997 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-25 08:53:50,997 INFO L451 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-25 08:53:50,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-25 08:53:50,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 08:53:50,998 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 154 states. [2018-07-25 08:53:52,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:52,658 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-07-25 08:53:52,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 08:53:52,658 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 154 [2018-07-25 08:53:52,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:52,658 INFO L225 Difference]: With dead ends: 158 [2018-07-25 08:53:52,658 INFO L226 Difference]: Without dead ends: 156 [2018-07-25 08:53:52,659 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 08:53:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-07-25 08:53:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-07-25 08:53:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-07-25 08:53:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-07-25 08:53:52,662 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 154 [2018-07-25 08:53:52,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:52,662 INFO L472 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-07-25 08:53:52,662 INFO L473 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-25 08:53:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-07-25 08:53:52,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-25 08:53:52,663 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:52,663 INFO L354 BasicCegarLoop]: trace histogram [152, 1, 1, 1] [2018-07-25 08:53:52,663 INFO L415 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:52,663 INFO L82 PathProgramCache]: Analyzing trace with hash -56983968, now seen corresponding path program 152 times [2018-07-25 08:53:52,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:54,543 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:54,543 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-07-25 08:53:54,543 INFO L451 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-07-25 08:53:54,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-07-25 08:53:54,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 08:53:54,544 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 155 states. [2018-07-25 08:53:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:56,189 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 08:53:56,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-25 08:53:56,189 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 155 [2018-07-25 08:53:56,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:56,190 INFO L225 Difference]: With dead ends: 159 [2018-07-25 08:53:56,190 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 08:53:56,190 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 08:53:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 08:53:56,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 08:53:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 08:53:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 08:53:56,193 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 155 [2018-07-25 08:53:56,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:56,193 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 08:53:56,194 INFO L473 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-07-25 08:53:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 08:53:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 08:53:56,194 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:56,194 INFO L354 BasicCegarLoop]: trace histogram [153, 1, 1, 1] [2018-07-25 08:53:56,194 INFO L415 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:56,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1766506874, now seen corresponding path program 153 times [2018-07-25 08:53:56,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:53:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:53:58,116 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:53:58,116 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-07-25 08:53:58,117 INFO L451 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-07-25 08:53:58,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-07-25 08:53:58,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 08:53:58,118 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 156 states. [2018-07-25 08:53:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:53:59,795 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-07-25 08:53:59,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-25 08:53:59,795 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 156 [2018-07-25 08:53:59,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:53:59,795 INFO L225 Difference]: With dead ends: 160 [2018-07-25 08:53:59,796 INFO L226 Difference]: Without dead ends: 158 [2018-07-25 08:53:59,796 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 08:53:59,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-25 08:53:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-07-25 08:53:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-07-25 08:53:59,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-07-25 08:53:59,799 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 156 [2018-07-25 08:53:59,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:53:59,799 INFO L472 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-07-25 08:53:59,799 INFO L473 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-07-25 08:53:59,799 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-07-25 08:53:59,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-07-25 08:53:59,800 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:53:59,800 INFO L354 BasicCegarLoop]: trace histogram [154, 1, 1, 1] [2018-07-25 08:53:59,800 INFO L415 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:53:59,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1072857888, now seen corresponding path program 154 times [2018-07-25 08:53:59,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:53:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:01,721 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:01,721 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-07-25 08:54:01,721 INFO L451 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-07-25 08:54:01,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-07-25 08:54:01,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 08:54:01,722 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 157 states. [2018-07-25 08:54:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:03,529 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 08:54:03,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-25 08:54:03,529 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 157 [2018-07-25 08:54:03,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:03,530 INFO L225 Difference]: With dead ends: 161 [2018-07-25 08:54:03,530 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 08:54:03,530 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 08:54:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 08:54:03,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 08:54:03,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 08:54:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 08:54:03,534 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 157 [2018-07-25 08:54:03,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:03,534 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 08:54:03,534 INFO L473 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-07-25 08:54:03,534 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 08:54:03,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 08:54:03,535 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:03,535 INFO L354 BasicCegarLoop]: trace histogram [155, 1, 1, 1] [2018-07-25 08:54:03,535 INFO L415 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:03,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1101147706, now seen corresponding path program 155 times [2018-07-25 08:54:03,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:05,739 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:05,739 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-07-25 08:54:05,739 INFO L451 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-07-25 08:54:05,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-07-25 08:54:05,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 08:54:05,740 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 158 states. [2018-07-25 08:54:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:07,643 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-07-25 08:54:07,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-25 08:54:07,643 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 158 [2018-07-25 08:54:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:07,643 INFO L225 Difference]: With dead ends: 162 [2018-07-25 08:54:07,643 INFO L226 Difference]: Without dead ends: 160 [2018-07-25 08:54:07,644 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 08:54:07,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-07-25 08:54:07,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-07-25 08:54:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-07-25 08:54:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-07-25 08:54:07,647 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 158 [2018-07-25 08:54:07,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:07,647 INFO L472 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-07-25 08:54:07,647 INFO L473 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-07-25 08:54:07,647 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-07-25 08:54:07,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-25 08:54:07,648 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:07,648 INFO L354 BasicCegarLoop]: trace histogram [156, 1, 1, 1] [2018-07-25 08:54:07,648 INFO L415 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:07,648 INFO L82 PathProgramCache]: Analyzing trace with hash 224155616, now seen corresponding path program 156 times [2018-07-25 08:54:07,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:09,876 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:09,877 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-07-25 08:54:09,877 INFO L451 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-07-25 08:54:09,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-07-25 08:54:09,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 08:54:09,878 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 159 states. [2018-07-25 08:54:11,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:11,805 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 08:54:11,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-07-25 08:54:11,806 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 159 [2018-07-25 08:54:11,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:11,806 INFO L225 Difference]: With dead ends: 163 [2018-07-25 08:54:11,806 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 08:54:11,807 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 08:54:11,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 08:54:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 08:54:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 08:54:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 08:54:11,810 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 159 [2018-07-25 08:54:11,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:11,810 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 08:54:11,810 INFO L473 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-07-25 08:54:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 08:54:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 08:54:11,811 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:11,811 INFO L354 BasicCegarLoop]: trace histogram [157, 1, 1, 1] [2018-07-25 08:54:11,811 INFO L415 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:11,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1641114362, now seen corresponding path program 157 times [2018-07-25 08:54:11,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:14,039 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:14,039 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-07-25 08:54:14,039 INFO L451 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-07-25 08:54:14,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-07-25 08:54:14,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 08:54:14,040 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 160 states. [2018-07-25 08:54:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:15,986 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-07-25 08:54:15,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-25 08:54:15,986 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 160 [2018-07-25 08:54:15,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:15,987 INFO L225 Difference]: With dead ends: 164 [2018-07-25 08:54:15,987 INFO L226 Difference]: Without dead ends: 162 [2018-07-25 08:54:15,987 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 08:54:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-07-25 08:54:15,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-07-25 08:54:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-07-25 08:54:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-07-25 08:54:15,991 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 160 [2018-07-25 08:54:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:15,991 INFO L472 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-07-25 08:54:15,991 INFO L473 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-07-25 08:54:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-07-25 08:54:15,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-07-25 08:54:15,991 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:15,991 INFO L354 BasicCegarLoop]: trace histogram [158, 1, 1, 1] [2018-07-25 08:54:15,992 INFO L415 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:15,992 INFO L82 PathProgramCache]: Analyzing trace with hash 665058464, now seen corresponding path program 158 times [2018-07-25 08:54:15,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:18,258 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:18,258 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-07-25 08:54:18,258 INFO L451 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-07-25 08:54:18,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-07-25 08:54:18,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 08:54:18,259 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 161 states. [2018-07-25 08:54:20,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:20,244 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 08:54:20,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-07-25 08:54:20,245 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 161 [2018-07-25 08:54:20,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:20,245 INFO L225 Difference]: With dead ends: 165 [2018-07-25 08:54:20,245 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 08:54:20,246 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 08:54:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 08:54:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 08:54:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 08:54:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 08:54:20,250 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 161 [2018-07-25 08:54:20,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:20,250 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 08:54:20,250 INFO L473 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-07-25 08:54:20,251 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 08:54:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 08:54:20,251 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:20,251 INFO L354 BasicCegarLoop]: trace histogram [159, 1, 1, 1] [2018-07-25 08:54:20,252 INFO L415 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:20,252 INFO L82 PathProgramCache]: Analyzing trace with hash -858027962, now seen corresponding path program 159 times [2018-07-25 08:54:20,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:22,466 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:22,466 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-07-25 08:54:22,466 INFO L451 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-07-25 08:54:22,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-07-25 08:54:22,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 08:54:22,467 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 162 states. [2018-07-25 08:54:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:24,454 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-07-25 08:54:24,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-25 08:54:24,454 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 162 [2018-07-25 08:54:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:24,455 INFO L225 Difference]: With dead ends: 166 [2018-07-25 08:54:24,455 INFO L226 Difference]: Without dead ends: 164 [2018-07-25 08:54:24,456 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 08:54:24,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-07-25 08:54:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-07-25 08:54:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-07-25 08:54:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-07-25 08:54:24,460 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 162 [2018-07-25 08:54:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:24,460 INFO L472 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-07-25 08:54:24,460 INFO L473 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-07-25 08:54:24,460 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-07-25 08:54:24,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-07-25 08:54:24,461 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:24,461 INFO L354 BasicCegarLoop]: trace histogram [160, 1, 1, 1] [2018-07-25 08:54:24,461 INFO L415 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:24,462 INFO L82 PathProgramCache]: Analyzing trace with hash -829066912, now seen corresponding path program 160 times [2018-07-25 08:54:24,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:26,784 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:26,784 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-07-25 08:54:26,784 INFO L451 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-07-25 08:54:26,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-07-25 08:54:26,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 08:54:26,785 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 163 states. [2018-07-25 08:54:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:28,816 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 08:54:28,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-07-25 08:54:28,816 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 163 [2018-07-25 08:54:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:28,817 INFO L225 Difference]: With dead ends: 167 [2018-07-25 08:54:28,817 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 08:54:28,817 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 08:54:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 08:54:28,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 08:54:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 08:54:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 08:54:28,820 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 163 [2018-07-25 08:54:28,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:28,821 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 08:54:28,821 INFO L473 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-07-25 08:54:28,821 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 08:54:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 08:54:28,821 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:28,821 INFO L354 BasicCegarLoop]: trace histogram [161, 1, 1, 1] [2018-07-25 08:54:28,822 INFO L415 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:28,822 INFO L82 PathProgramCache]: Analyzing trace with hash 68725638, now seen corresponding path program 161 times [2018-07-25 08:54:28,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:31,165 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:31,166 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-07-25 08:54:31,166 INFO L451 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-07-25 08:54:31,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-07-25 08:54:31,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 08:54:31,167 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 164 states. [2018-07-25 08:54:33,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:33,216 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-07-25 08:54:33,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-07-25 08:54:33,216 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 164 [2018-07-25 08:54:33,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:33,217 INFO L225 Difference]: With dead ends: 168 [2018-07-25 08:54:33,217 INFO L226 Difference]: Without dead ends: 166 [2018-07-25 08:54:33,218 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 08:54:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-07-25 08:54:33,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-07-25 08:54:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-07-25 08:54:33,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-07-25 08:54:33,223 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2018-07-25 08:54:33,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:33,223 INFO L472 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-07-25 08:54:33,223 INFO L473 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-07-25 08:54:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-07-25 08:54:33,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-07-25 08:54:33,224 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:33,224 INFO L354 BasicCegarLoop]: trace histogram [162, 1, 1, 1] [2018-07-25 08:54:33,224 INFO L415 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:33,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2130490912, now seen corresponding path program 162 times [2018-07-25 08:54:33,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:35,636 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:35,636 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-07-25 08:54:35,636 INFO L451 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-07-25 08:54:35,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-07-25 08:54:35,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 08:54:35,637 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 165 states. [2018-07-25 08:54:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:54:37,708 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 08:54:37,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-07-25 08:54:37,709 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 165 [2018-07-25 08:54:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:54:37,709 INFO L225 Difference]: With dead ends: 169 [2018-07-25 08:54:37,709 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 08:54:37,710 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 08:54:37,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 08:54:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 08:54:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 08:54:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 08:54:37,713 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 165 [2018-07-25 08:54:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:54:37,713 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 08:54:37,713 INFO L473 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-07-25 08:54:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 08:54:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 08:54:37,714 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:54:37,714 INFO L354 BasicCegarLoop]: trace histogram [163, 1, 1, 1] [2018-07-25 08:54:37,714 INFO L415 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:54:37,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1620704966, now seen corresponding path program 163 times [2018-07-25 08:54:37,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:54:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:54:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:54:40,197 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:54:40,198 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-07-25 08:54:40,198 INFO L451 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-07-25 08:54:40,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-07-25 08:54:40,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 08:54:40,199 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 166 states. Received shutdown request... [2018-07-25 08:54:41,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 08:54:41,570 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 08:54:41,582 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 08:54:41,582 INFO L202 PluginConnector]: Adding new model AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:54:41 BoogieIcfgContainer [2018-07-25 08:54:41,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:54:41,583 INFO L168 Benchmark]: Toolchain (without parser) took 262375.77 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 401.1 MB). Free memory was 1.5 GB in the beginning and 903.0 MB in the end (delta: 565.8 MB). Peak memory consumption was 966.9 MB. Max. memory is 7.1 GB. [2018-07-25 08:54:41,585 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:54:41,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:54:41,586 INFO L168 Benchmark]: Boogie Preprocessor took 21.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:54:41,586 INFO L168 Benchmark]: RCFGBuilder took 209.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 08:54:41,587 INFO L168 Benchmark]: TraceAbstraction took 262099.22 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 401.1 MB). Free memory was 1.5 GB in the beginning and 903.0 MB in the end (delta: 555.2 MB). Peak memory consumption was 956.3 MB. Max. memory is 7.1 GB. [2018-07-25 08:54:41,596 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.19 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 41.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.52 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 209.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 262099.22 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 401.1 MB). Free memory was 1.5 GB in the beginning and 903.0 MB in the end (delta: 555.2 MB). Peak memory consumption was 956.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 24). Cancelled while BasicCegarLoop was constructing difference of abstraction (167states) and interpolant automaton (currently 112 states, 166 states before enhancement), while ReachableStatesComputation was computing reachable states (110 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 262.0s OverallTime, 164 OverallIterations, 163 TraceHistogramMax, 119.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 492 SDtfs, 165 SDslu, 13206 SDs, 0 SdLazy, 1501426 SolverSat, 163 SolverUnsat, 78 SolverUnknown, 0 SolverNotchecked, 84.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13693 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 13530 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 125.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=163, 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.6s AutomataMinimizationTime, 163 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 131.4s InterpolantComputationTime, 13858 NumberOfCodeBlocks, 13858 NumberOfCodeBlocksAsserted, 164 NumberOfCheckSat, 13694 ConstructedInterpolants, 0 QuantifiedInterpolants, 16429450 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 164 InterpolantComputations, 1 PerfectInterpolantSequences, 0/735130 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/AnnoyingVillain.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-54-41-614.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/AnnoyingVillain.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-54-41-614.csv Completed graceful shutdown