java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:20:32,848 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:20:32,850 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:20:32,864 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:20:32,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:20:32,865 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:20:32,869 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:20:32,872 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:20:32,874 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:20:32,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:20:32,879 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:20:32,880 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:20:32,881 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:20:32,882 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:20:32,885 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:20:32,886 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:20:32,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:20:32,889 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:20:32,898 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:20:32,904 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:20:32,905 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:20:32,907 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:20:32,909 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:20:32,909 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:20:32,909 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:20:32,910 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:20:32,911 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:20:32,912 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:20:32,913 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:20:32,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:20:32,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:20:32,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:20:32,915 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:20:32,915 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:20:32,916 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:20:32,917 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:20:32,917 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:20:32,930 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:20:32,930 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:20:32,932 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:20:32,935 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:20:32,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:20:32,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:20:32,936 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:20:32,936 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:20:33,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:20:33,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:20:33,027 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:20:33,028 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:20:33,029 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:20:33,030 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2018-09-26 08:20:33,030 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl' [2018-09-26 08:20:33,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:20:33,087 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:20:33,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:20:33,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:20:33,088 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:20:33,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:33" (1/1) ... [2018-09-26 08:20:33,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:33" (1/1) ... [2018-09-26 08:20:33,130 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:20:33,130 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:20:33,130 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:20:33,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:20:33,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:20:33,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:20:33,135 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:20:33,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:33" (1/1) ... [2018-09-26 08:20:33,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:33" (1/1) ... [2018-09-26 08:20:33,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:33" (1/1) ... [2018-09-26 08:20:33,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:33" (1/1) ... [2018-09-26 08:20:33,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:33" (1/1) ... [2018-09-26 08:20:33,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:33" (1/1) ... [2018-09-26 08:20:33,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:33" (1/1) ... [2018-09-26 08:20:33,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:20:33,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:20:33,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:20:33,160 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:20:33,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:33" (1/1) ... [2018-09-26 08:20:33,252 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-26 08:20:33,252 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 08:20:33,252 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 08:20:33,412 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:20:33,413 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:20:33 BoogieIcfgContainer [2018-09-26 08:20:33,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:20:33,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:20:33,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:20:33,418 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:20:33,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:33" (1/2) ... [2018-09-26 08:20:33,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eeead51 and model type BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:20:33, skipping insertion in model container [2018-09-26 08:20:33,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:20:33" (2/2) ... [2018-09-26 08:20:33,423 INFO L112 eAbstractionObserver]: Analyzing ICFG BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2018-09-26 08:20:33,432 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:20:33,441 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-09-26 08:20:33,488 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:20:33,488 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:20:33,489 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:20:33,489 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:20:33,489 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:20:33,489 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:20:33,490 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:20:33,490 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:20:33,490 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:20:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-09-26 08:20:33,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:20:33,514 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:33,515 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:20:33,516 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:33,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:33,523 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2018-09-26 08:20:33,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:33,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:33,598 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:20:33,598 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:20:33,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:20:33,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:20:33,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:20:33,623 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-09-26 08:20:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:33,645 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:20:33,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:20:33,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 08:20:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:33,658 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:20:33,658 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:20:33,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:20:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:20:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:20:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:20:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:20:33,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2018-09-26 08:20:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:33,702 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:20:33,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:20:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:20:33,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:20:33,703 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:33,704 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:20:33,704 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:33,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:33,705 INFO L82 PathProgramCache]: Analyzing trace with hash 943126, now seen corresponding path program 1 times [2018-09-26 08:20:33,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:33,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:33,732 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:33,733 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:20:33,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:20:33,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:20:33,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:20:33,736 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-09-26 08:20:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:33,754 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:20:33,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:20:33,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 08:20:33,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:33,756 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:20:33,756 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:20:33,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:20:33,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:20:33,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:20:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:20:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:20:33,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2018-09-26 08:20:33,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:33,762 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:20:33,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:20:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:20:33,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:20:33,762 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:33,762 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-26 08:20:33,763 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:33,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:33,763 INFO L82 PathProgramCache]: Analyzing trace with hash 29244576, now seen corresponding path program 2 times [2018-09-26 08:20:33,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:33,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:33,795 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:33,795 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:20:33,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:20:33,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:20:33,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:20:33,797 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2018-09-26 08:20:33,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:33,810 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:20:33,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:20:33,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 08:20:33,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:33,811 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:20:33,811 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:20:33,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:20:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:20:33,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:20:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:20:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:20:33,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2018-09-26 08:20:33,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:33,815 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:20:33,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:20:33,816 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:20:33,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:20:33,816 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:33,816 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-09-26 08:20:33,817 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:33,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:33,817 INFO L82 PathProgramCache]: Analyzing trace with hash 906589526, now seen corresponding path program 3 times [2018-09-26 08:20:33,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:33,860 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:33,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:20:33,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:20:33,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:20:33,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:20:33,861 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-09-26 08:20:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:33,883 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:20:33,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:20:33,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:20:33,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:33,885 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:20:33,885 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:20:33,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:20:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:20:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:20:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:20:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:20:33,889 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2018-09-26 08:20:33,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:33,890 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:20:33,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:20:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:20:33,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:20:33,891 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:33,891 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-09-26 08:20:33,891 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:33,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:33,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1960488096, now seen corresponding path program 4 times [2018-09-26 08:20:33,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:33,963 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:33,963 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:20:33,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:20:33,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:20:33,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:20:33,965 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-09-26 08:20:33,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:33,980 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:20:33,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:20:33,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-09-26 08:20:33,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:33,981 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:20:33,981 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:20:33,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:20:33,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:20:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:20:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:20:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:20:33,985 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2018-09-26 08:20:33,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:33,986 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:20:33,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:20:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:20:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:20:33,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:33,987 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-09-26 08:20:33,987 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:33,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:33,988 INFO L82 PathProgramCache]: Analyzing trace with hash -645581162, now seen corresponding path program 5 times [2018-09-26 08:20:33,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:34,044 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:34,044 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:20:34,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:20:34,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:20:34,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:20:34,046 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-09-26 08:20:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:34,061 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:20:34,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:20:34,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:20:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:34,062 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:20:34,062 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:20:34,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:20:34,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:20:34,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:20:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:20:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:20:34,068 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2018-09-26 08:20:34,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:34,068 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:20:34,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:20:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:20:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:20:34,071 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:34,071 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-09-26 08:20:34,071 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:34,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:34,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1461828128, now seen corresponding path program 6 times [2018-09-26 08:20:34,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:34,120 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:34,120 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:20:34,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:20:34,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:20:34,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:20:34,121 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-09-26 08:20:34,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:34,142 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:20:34,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:20:34,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-26 08:20:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:34,144 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:20:34,144 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:20:34,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:20:34,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:20:34,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:20:34,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:20:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:20:34,153 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2018-09-26 08:20:34,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:34,153 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:20:34,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:20:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:20:34,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:20:34,154 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:34,154 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-09-26 08:20:34,154 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:34,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:34,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1927960618, now seen corresponding path program 7 times [2018-09-26 08:20:34,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:34,208 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:34,208 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:20:34,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:20:34,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:20:34,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:20:34,210 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2018-09-26 08:20:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:34,241 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:20:34,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:20:34,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-09-26 08:20:34,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:34,244 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:20:34,244 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:20:34,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:20:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:20:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:20:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:20:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:20:34,254 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2018-09-26 08:20:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:34,254 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:20:34,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:20:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:20:34,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:20:34,255 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:34,257 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-09-26 08:20:34,258 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:34,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:34,258 INFO L82 PathProgramCache]: Analyzing trace with hash 362770656, now seen corresponding path program 8 times [2018-09-26 08:20:34,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:34,377 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:34,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:20:34,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:20:34,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:20:34,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:20:34,383 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2018-09-26 08:20:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:34,402 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:20:34,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:20:34,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-09-26 08:20:34,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:34,403 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:20:34,403 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:20:34,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:20:34,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:20:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:20:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:20:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:20:34,408 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-09-26 08:20:34,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:34,409 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:20:34,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:20:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:20:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:20:34,410 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:34,410 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-09-26 08:20:34,410 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:34,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:34,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1639003882, now seen corresponding path program 9 times [2018-09-26 08:20:34,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:34,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:34,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:20:34,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:20:34,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:20:34,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:20:34,461 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-09-26 08:20:34,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:34,476 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:20:34,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:20:34,477 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-09-26 08:20:34,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:34,477 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:20:34,478 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:20:34,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:20:34,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:20:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:20:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:20:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:20:34,484 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2018-09-26 08:20:34,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:34,484 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:20:34,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:20:34,485 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:20:34,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:20:34,485 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:34,486 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-09-26 08:20:34,486 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:34,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:34,487 INFO L82 PathProgramCache]: Analyzing trace with hash 730494880, now seen corresponding path program 10 times [2018-09-26 08:20:34,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:34,551 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:34,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:20:34,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:20:34,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:20:34,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:20:34,556 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2018-09-26 08:20:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:34,583 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:20:34,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:20:34,583 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-09-26 08:20:34,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:34,586 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:20:34,586 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:20:34,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:20:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:20:34,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:20:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:20:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:20:34,596 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-09-26 08:20:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:34,596 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:20:34,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:20:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:20:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:20:34,597 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:34,599 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-09-26 08:20:34,599 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:34,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:34,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1170512470, now seen corresponding path program 11 times [2018-09-26 08:20:34,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:34,716 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:34,718 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:34,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:20:34,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:20:34,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:20:34,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:20:34,720 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 14 states. [2018-09-26 08:20:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:34,749 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 08:20:34,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:20:34,749 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-26 08:20:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:34,750 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:20:34,751 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:20:34,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:20:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:20:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 08:20:34,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:20:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-26 08:20:34,760 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2018-09-26 08:20:34,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:34,761 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-26 08:20:34,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:20:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-26 08:20:34,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:20:34,762 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:34,762 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-09-26 08:20:34,763 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:34,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:34,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1926155872, now seen corresponding path program 12 times [2018-09-26 08:20:34,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:34,847 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:34,847 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:20:34,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:20:34,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:20:34,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:20:34,849 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 15 states. [2018-09-26 08:20:34,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:34,880 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:20:34,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:20:34,880 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 08:20:34,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:34,882 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:20:34,882 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:20:34,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:20:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:20:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:20:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:20:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:20:34,890 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2018-09-26 08:20:34,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:34,894 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:20:34,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:20:34,895 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:20:34,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:20:34,895 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:34,895 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-09-26 08:20:34,896 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:34,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:34,896 INFO L82 PathProgramCache]: Analyzing trace with hash -418702442, now seen corresponding path program 13 times [2018-09-26 08:20:34,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:34,974 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:34,974 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:20:34,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:20:34,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:20:34,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:20:34,977 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 16 states. [2018-09-26 08:20:34,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:34,995 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:20:34,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:20:34,996 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-09-26 08:20:34,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:34,996 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:20:34,996 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:20:34,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:20:34,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:20:35,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:20:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:20:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:20:35,007 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2018-09-26 08:20:35,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:35,008 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:20:35,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:20:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:20:35,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:20:35,010 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:35,010 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-09-26 08:20:35,011 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:35,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:35,011 INFO L82 PathProgramCache]: Analyzing trace with hash -94866144, now seen corresponding path program 14 times [2018-09-26 08:20:35,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:35,093 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:35,093 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:20:35,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:20:35,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:20:35,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:20:35,096 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 17 states. [2018-09-26 08:20:35,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:35,111 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:20:35,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:20:35,111 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-09-26 08:20:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:35,112 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:20:35,112 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:20:35,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:20:35,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:20:35,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:20:35,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:20:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:20:35,121 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2018-09-26 08:20:35,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:35,121 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:20:35,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:20:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:20:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:20:35,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:35,124 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-09-26 08:20:35,124 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:35,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:35,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1354124502, now seen corresponding path program 15 times [2018-09-26 08:20:35,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:35,193 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:35,193 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:20:35,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:20:35,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:20:35,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:20:35,195 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 18 states. [2018-09-26 08:20:35,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:35,210 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:20:35,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:20:35,210 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-26 08:20:35,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:35,212 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:20:35,212 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:20:35,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:20:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:20:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:20:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:20:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-26 08:20:35,218 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2018-09-26 08:20:35,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:35,218 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-26 08:20:35,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:20:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-26 08:20:35,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:20:35,223 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:35,223 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-09-26 08:20:35,224 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:35,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:35,224 INFO L82 PathProgramCache]: Analyzing trace with hash -971805728, now seen corresponding path program 16 times [2018-09-26 08:20:35,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:35,329 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:35,329 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:20:35,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:20:35,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:20:35,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:20:35,331 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 19 states. [2018-09-26 08:20:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:35,347 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:20:35,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:20:35,348 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-09-26 08:20:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:35,350 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:20:35,350 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:20:35,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:20:35,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:20:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:20:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:20:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:20:35,365 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2018-09-26 08:20:35,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:35,366 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:20:35,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:20:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:20:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:20:35,367 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:35,367 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-09-26 08:20:35,367 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:35,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:35,370 INFO L82 PathProgramCache]: Analyzing trace with hash -61198826, now seen corresponding path program 17 times [2018-09-26 08:20:35,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:35,452 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:35,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:20:35,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:20:35,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:20:35,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:20:35,455 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 20 states. [2018-09-26 08:20:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:35,472 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 08:20:35,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:20:35,473 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-09-26 08:20:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:35,473 INFO L225 Difference]: With dead ends: 28 [2018-09-26 08:20:35,473 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:20:35,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:20:35,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:20:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-26 08:20:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:20:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-26 08:20:35,481 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2018-09-26 08:20:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:35,484 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-26 08:20:35,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:20:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-26 08:20:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:20:35,485 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:35,485 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-09-26 08:20:35,487 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:35,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:35,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1897155936, now seen corresponding path program 18 times [2018-09-26 08:20:35,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:35,577 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:35,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:20:35,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:20:35,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:20:35,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:20:35,578 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2018-09-26 08:20:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:35,594 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:20:35,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:20:35,594 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-09-26 08:20:35,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:35,595 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:20:35,595 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:20:35,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:20:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:20:35,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:20:35,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:20:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:20:35,599 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2018-09-26 08:20:35,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:35,600 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:20:35,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:20:35,600 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:20:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:20:35,601 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:35,601 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-09-26 08:20:35,601 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:35,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:35,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1317715798, now seen corresponding path program 19 times [2018-09-26 08:20:35,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:35,683 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:35,683 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:20:35,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:20:35,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:20:35,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:20:35,685 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2018-09-26 08:20:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:35,702 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:20:35,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:20:35,702 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-09-26 08:20:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:35,703 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:20:35,703 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:20:35,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:20:35,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:20:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 08:20:35,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:20:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:20:35,710 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2018-09-26 08:20:35,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:35,710 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:20:35,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:20:35,711 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:20:35,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:20:35,711 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:35,712 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-09-26 08:20:35,712 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:35,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:35,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2100475552, now seen corresponding path program 20 times [2018-09-26 08:20:35,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:35,826 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:35,827 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:20:35,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:20:35,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:20:35,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:20:35,828 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2018-09-26 08:20:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:35,848 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:20:35,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:20:35,849 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-09-26 08:20:35,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:35,849 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:20:35,850 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:20:35,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:20:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:20:35,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:20:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:20:35,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:20:35,855 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2018-09-26 08:20:35,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:35,859 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:20:35,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:20:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:20:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:20:35,860 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:35,860 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-09-26 08:20:35,860 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:35,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:35,861 INFO L82 PathProgramCache]: Analyzing trace with hash -690225002, now seen corresponding path program 21 times [2018-09-26 08:20:35,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:35,954 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:35,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:35,955 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:20:35,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:20:35,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:20:35,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:20:35,956 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2018-09-26 08:20:35,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:35,973 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:20:35,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:20:35,974 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-09-26 08:20:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:35,975 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:20:35,975 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:20:35,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:20:35,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:20:35,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-26 08:20:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:20:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-26 08:20:35,984 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2018-09-26 08:20:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:35,984 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-26 08:20:35,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:20:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-26 08:20:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:20:35,985 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:35,985 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-09-26 08:20:35,988 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:35,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:35,989 INFO L82 PathProgramCache]: Analyzing trace with hash 77869088, now seen corresponding path program 22 times [2018-09-26 08:20:35,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:36,142 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:36,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:20:36,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:20:36,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:20:36,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:20:36,144 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 25 states. [2018-09-26 08:20:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:36,171 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:20:36,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:20:36,172 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-09-26 08:20:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:36,173 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:20:36,173 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:20:36,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:20:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:20:36,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:20:36,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:20:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:20:36,180 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2018-09-26 08:20:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:36,181 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:20:36,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:20:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:20:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:20:36,184 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:36,184 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-09-26 08:20:36,185 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:36,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:36,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1881017898, now seen corresponding path program 23 times [2018-09-26 08:20:36,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:36,309 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:36,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:20:36,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:20:36,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:20:36,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:20:36,314 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2018-09-26 08:20:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:36,351 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 08:20:36,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:20:36,352 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-09-26 08:20:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:36,352 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:20:36,352 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:20:36,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:20:36,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:20:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 08:20:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:20:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-26 08:20:36,360 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-09-26 08:20:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:36,360 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-26 08:20:36,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:20:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-26 08:20:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:20:36,361 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:36,361 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-09-26 08:20:36,362 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:36,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1817994976, now seen corresponding path program 24 times [2018-09-26 08:20:36,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:36,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:36,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:20:36,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:20:36,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:20:36,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:20:36,493 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2018-09-26 08:20:36,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:36,517 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:20:36,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:20:36,517 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-09-26 08:20:36,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:36,518 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:20:36,518 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:20:36,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:20:36,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:20:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:20:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:20:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:20:36,526 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2018-09-26 08:20:36,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:36,527 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:20:36,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:20:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:20:36,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:20:36,528 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:36,528 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-09-26 08:20:36,528 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:36,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:36,529 INFO L82 PathProgramCache]: Analyzing trace with hash 523277078, now seen corresponding path program 25 times [2018-09-26 08:20:36,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:36,661 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:36,661 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:20:36,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:20:36,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:20:36,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:20:36,665 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2018-09-26 08:20:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:36,690 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:20:36,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:20:36,691 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-09-26 08:20:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:36,691 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:20:36,691 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:20:36,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:20:36,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:20:36,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:20:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:20:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 08:20:36,697 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2018-09-26 08:20:36,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:36,697 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 08:20:36,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:20:36,697 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 08:20:36,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:20:36,698 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:36,698 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-09-26 08:20:36,698 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:36,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:36,700 INFO L82 PathProgramCache]: Analyzing trace with hash -958272096, now seen corresponding path program 26 times [2018-09-26 08:20:36,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:36,832 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:36,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:20:36,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:20:36,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:20:36,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:20:36,834 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2018-09-26 08:20:36,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:36,858 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:20:36,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:20:36,859 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-09-26 08:20:36,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:36,859 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:20:36,859 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:20:36,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:20:36,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:20:36,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:20:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:20:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:20:36,870 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2018-09-26 08:20:36,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:36,870 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:20:36,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:20:36,870 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:20:36,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:20:36,871 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:36,871 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-09-26 08:20:36,871 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:36,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:36,872 INFO L82 PathProgramCache]: Analyzing trace with hash 358343766, now seen corresponding path program 27 times [2018-09-26 08:20:36,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:37,006 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:37,006 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:20:37,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:20:37,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:20:37,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:20:37,008 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 30 states. [2018-09-26 08:20:37,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:37,030 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:20:37,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:20:37,031 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-09-26 08:20:37,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:37,031 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:20:37,032 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:20:37,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:20:37,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:20:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 08:20:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:20:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-26 08:20:37,036 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2018-09-26 08:20:37,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:37,037 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-26 08:20:37,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:20:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-26 08:20:37,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:20:37,037 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:37,038 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-09-26 08:20:37,038 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:37,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:37,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1776237472, now seen corresponding path program 28 times [2018-09-26 08:20:37,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:37,175 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:37,175 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:20:37,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:20:37,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:20:37,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:20:37,176 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 31 states. [2018-09-26 08:20:37,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:37,193 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:20:37,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:20:37,193 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-09-26 08:20:37,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:37,194 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:20:37,194 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:20:37,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:20:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:20:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:20:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:20:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:20:37,199 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2018-09-26 08:20:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:37,199 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:20:37,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:20:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:20:37,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:20:37,200 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:37,200 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-09-26 08:20:37,200 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:37,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:37,200 INFO L82 PathProgramCache]: Analyzing trace with hash 771220886, now seen corresponding path program 29 times [2018-09-26 08:20:37,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:37,352 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:37,352 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:20:37,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:20:37,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:20:37,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:20:37,354 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 32 states. [2018-09-26 08:20:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:37,370 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:20:37,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:20:37,370 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-09-26 08:20:37,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:37,371 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:20:37,371 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:20:37,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:20:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:20:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 08:20:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:20:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 08:20:37,429 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2018-09-26 08:20:37,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:37,429 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 08:20:37,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:20:37,429 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 08:20:37,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:20:37,430 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:37,430 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-09-26 08:20:37,430 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:37,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:37,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1861948640, now seen corresponding path program 30 times [2018-09-26 08:20:37,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:37,589 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:37,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:20:37,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:20:37,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:20:37,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:20:37,591 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 33 states. [2018-09-26 08:20:37,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:37,610 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:20:37,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:20:37,611 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-09-26 08:20:37,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:37,611 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:20:37,611 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:20:37,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:20:37,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:20:37,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:20:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:20:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:20:37,615 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2018-09-26 08:20:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:37,615 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:20:37,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:20:37,616 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:20:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:20:37,616 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:37,616 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-09-26 08:20:37,616 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:37,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:37,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1885825322, now seen corresponding path program 31 times [2018-09-26 08:20:37,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:37,752 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:37,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:20:37,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:20:37,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:20:37,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:20:37,754 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2018-09-26 08:20:37,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:37,775 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:20:37,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:20:37,775 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-09-26 08:20:37,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:37,775 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:20:37,775 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:20:37,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:20:37,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:20:37,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:20:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:20:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 08:20:37,779 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 34 [2018-09-26 08:20:37,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:37,779 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 08:20:37,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:20:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 08:20:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:20:37,780 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:37,780 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-09-26 08:20:37,780 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:37,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:37,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1668964832, now seen corresponding path program 32 times [2018-09-26 08:20:37,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:37,958 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:37,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:20:37,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:20:37,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:20:37,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:20:37,960 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 35 states. [2018-09-26 08:20:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:37,979 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:20:37,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:20:37,980 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-09-26 08:20:37,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:37,980 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:20:37,980 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:20:37,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:20:37,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:20:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:20:37,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:20:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:20:37,985 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2018-09-26 08:20:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:37,985 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:20:37,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:20:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:20:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:20:37,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:37,986 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-09-26 08:20:37,986 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:37,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:37,986 INFO L82 PathProgramCache]: Analyzing trace with hash 198309910, now seen corresponding path program 33 times [2018-09-26 08:20:37,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:38,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:38,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:20:38,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:20:38,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:20:38,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:20:38,134 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 36 states. [2018-09-26 08:20:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:38,151 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:20:38,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:20:38,152 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-09-26 08:20:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:38,152 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:20:38,152 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:20:38,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:20:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:20:38,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:20:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:20:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-26 08:20:38,162 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2018-09-26 08:20:38,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:38,162 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-26 08:20:38,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:20:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-26 08:20:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:20:38,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:38,163 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-09-26 08:20:38,163 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:38,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:38,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1852647584, now seen corresponding path program 34 times [2018-09-26 08:20:38,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:38,311 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:38,312 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:20:38,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:20:38,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:20:38,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:20:38,313 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 37 states. [2018-09-26 08:20:38,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:38,331 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:20:38,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:20:38,331 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-09-26 08:20:38,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:38,331 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:20:38,331 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:20:38,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:20:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:20:38,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:20:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:20:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:20:38,335 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 37 [2018-09-26 08:20:38,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:38,335 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:20:38,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:20:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:20:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:20:38,335 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:38,336 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-09-26 08:20:38,336 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:38,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:38,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1597507926, now seen corresponding path program 35 times [2018-09-26 08:20:38,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:38,491 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:38,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:38,492 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:20:38,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:20:38,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:20:38,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:20:38,493 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 38 states. [2018-09-26 08:20:38,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:38,514 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 08:20:38,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:20:38,515 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-09-26 08:20:38,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:38,515 INFO L225 Difference]: With dead ends: 46 [2018-09-26 08:20:38,515 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:20:38,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:20:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:20:38,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-26 08:20:38,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:20:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-26 08:20:38,518 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2018-09-26 08:20:38,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:38,519 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-26 08:20:38,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:20:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-26 08:20:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:20:38,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:38,519 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-09-26 08:20:38,520 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:38,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:38,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2016854176, now seen corresponding path program 36 times [2018-09-26 08:20:38,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:38,685 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:38,685 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:20:38,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:20:38,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:20:38,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:20:38,687 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 39 states. [2018-09-26 08:20:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:38,709 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:20:38,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:20:38,709 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-09-26 08:20:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:38,710 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:20:38,710 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:20:38,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:20:38,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:20:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:20:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:20:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:20:38,715 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2018-09-26 08:20:38,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:38,715 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:20:38,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:20:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:20:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:20:38,716 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:38,716 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-09-26 08:20:38,718 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:38,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:38,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1902037654, now seen corresponding path program 37 times [2018-09-26 08:20:38,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:38,889 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:38,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:20:38,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:20:38,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:20:38,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:20:38,891 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 40 states. [2018-09-26 08:20:38,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:38,912 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 08:20:38,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:20:38,912 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-09-26 08:20:38,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:38,913 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:20:38,913 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:20:38,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:20:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:20:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 08:20:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:20:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 08:20:38,917 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 40 [2018-09-26 08:20:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:38,917 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 08:20:38,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:20:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 08:20:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:20:38,918 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:38,918 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-09-26 08:20:38,918 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:38,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:38,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1166367200, now seen corresponding path program 38 times [2018-09-26 08:20:38,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:39,088 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:39,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:20:39,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:20:39,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:20:39,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:20:39,090 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 41 states. [2018-09-26 08:20:39,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:39,112 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 08:20:39,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:20:39,113 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-09-26 08:20:39,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:39,113 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:20:39,113 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:20:39,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:20:39,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:20:39,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:20:39,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:20:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:20:39,117 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2018-09-26 08:20:39,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:39,117 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:20:39,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:20:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:20:39,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:20:39,117 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:39,118 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-09-26 08:20:39,118 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:39,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:39,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1797637162, now seen corresponding path program 39 times [2018-09-26 08:20:39,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:39,291 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:39,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:20:39,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:20:39,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:20:39,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:20:39,293 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 42 states. [2018-09-26 08:20:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:39,316 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:20:39,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:20:39,316 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-09-26 08:20:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:39,317 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:20:39,317 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:20:39,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:20:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:20:39,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 08:20:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:20:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 08:20:39,321 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2018-09-26 08:20:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:39,321 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 08:20:39,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:20:39,321 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 08:20:39,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:20:39,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:39,322 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-09-26 08:20:39,322 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:39,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:39,322 INFO L82 PathProgramCache]: Analyzing trace with hash 107830496, now seen corresponding path program 40 times [2018-09-26 08:20:39,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:39,510 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:39,510 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:20:39,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:20:39,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:20:39,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:20:39,512 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 43 states. [2018-09-26 08:20:39,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:39,532 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:20:39,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:20:39,533 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-09-26 08:20:39,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:39,533 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:20:39,533 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:20:39,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:20:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:20:39,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:20:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:20:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:20:39,538 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 43 [2018-09-26 08:20:39,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:39,538 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:20:39,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:20:39,538 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:20:39,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:20:39,539 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:39,539 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-09-26 08:20:39,539 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:39,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:39,540 INFO L82 PathProgramCache]: Analyzing trace with hash -952214250, now seen corresponding path program 41 times [2018-09-26 08:20:39,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:39,773 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:39,774 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:20:39,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:20:39,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:20:39,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:20:39,776 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 44 states. [2018-09-26 08:20:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:39,806 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-26 08:20:39,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:20:39,806 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-09-26 08:20:39,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:39,807 INFO L225 Difference]: With dead ends: 52 [2018-09-26 08:20:39,807 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:20:39,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:20:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:20:39,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-26 08:20:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:20:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-26 08:20:39,812 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2018-09-26 08:20:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:39,813 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-26 08:20:39,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:20:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-26 08:20:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:20:39,813 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:39,814 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-09-26 08:20:39,814 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:39,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:39,814 INFO L82 PathProgramCache]: Analyzing trace with hash 546136992, now seen corresponding path program 42 times [2018-09-26 08:20:39,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:40,091 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:40,092 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:20:40,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:20:40,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:20:40,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:20:40,094 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 45 states. [2018-09-26 08:20:40,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:40,124 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:20:40,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:20:40,124 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-09-26 08:20:40,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:40,125 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:20:40,125 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:20:40,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:20:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:20:40,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:20:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:20:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:20:40,130 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2018-09-26 08:20:40,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:40,131 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:20:40,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:20:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:20:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:20:40,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:40,133 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-09-26 08:20:40,134 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:40,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:40,134 INFO L82 PathProgramCache]: Analyzing trace with hash -249614762, now seen corresponding path program 43 times [2018-09-26 08:20:40,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:40,335 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:40,335 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:20:40,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:20:40,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:20:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:20:40,338 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 46 states. [2018-09-26 08:20:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:40,369 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 08:20:40,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:20:40,370 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-09-26 08:20:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:40,370 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:20:40,370 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:20:40,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:20:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:20:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 08:20:40,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:20:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-26 08:20:40,375 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2018-09-26 08:20:40,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:40,375 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-26 08:20:40,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:20:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-26 08:20:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 08:20:40,376 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:40,376 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-09-26 08:20:40,377 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:40,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:40,377 INFO L82 PathProgramCache]: Analyzing trace with hash 851884640, now seen corresponding path program 44 times [2018-09-26 08:20:40,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:40,584 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:40,584 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:20:40,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:20:40,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:20:40,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:20:40,586 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 47 states. [2018-09-26 08:20:40,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:40,618 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:20:40,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:20:40,618 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-09-26 08:20:40,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:40,619 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:20:40,619 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:20:40,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:20:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:20:40,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:20:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:20:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:20:40,622 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2018-09-26 08:20:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:40,623 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:20:40,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:20:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:20:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:20:40,624 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:40,624 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-09-26 08:20:40,624 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:40,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:40,624 INFO L82 PathProgramCache]: Analyzing trace with hash 638627734, now seen corresponding path program 45 times [2018-09-26 08:20:40,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:40,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:40,858 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:20:40,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:20:40,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:20:40,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:20:40,860 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 48 states. [2018-09-26 08:20:40,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:40,892 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 08:20:40,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:20:40,892 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-09-26 08:20:40,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:40,893 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:20:40,893 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:20:40,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:20:40,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:20:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-26 08:20:40,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:20:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-26 08:20:40,896 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2018-09-26 08:20:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:40,896 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-26 08:20:40,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:20:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-26 08:20:40,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:20:40,897 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:40,897 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-09-26 08:20:40,897 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:40,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:40,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1677369056, now seen corresponding path program 46 times [2018-09-26 08:20:40,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:41,123 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:41,123 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:20:41,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:20:41,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:20:41,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:20:41,124 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 49 states. [2018-09-26 08:20:41,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:41,154 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:20:41,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:20:41,155 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-09-26 08:20:41,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:41,155 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:20:41,155 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:20:41,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:20:41,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:20:41,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:20:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:20:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:20:41,159 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2018-09-26 08:20:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:41,159 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:20:41,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:20:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:20:41,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:20:41,160 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:41,160 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-09-26 08:20:41,160 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:41,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:41,160 INFO L82 PathProgramCache]: Analyzing trace with hash -458825514, now seen corresponding path program 47 times [2018-09-26 08:20:41,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:41,380 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:41,380 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:20:41,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:20:41,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:20:41,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:20:41,382 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 50 states. [2018-09-26 08:20:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:41,406 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-26 08:20:41,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:20:41,406 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-09-26 08:20:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:41,407 INFO L225 Difference]: With dead ends: 58 [2018-09-26 08:20:41,407 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:20:41,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:20:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:20:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-09-26 08:20:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:20:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-26 08:20:41,411 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2018-09-26 08:20:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:41,411 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-26 08:20:41,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:20:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-26 08:20:41,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 08:20:41,412 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:41,412 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-09-26 08:20:41,412 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:41,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:41,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1338681376, now seen corresponding path program 48 times [2018-09-26 08:20:41,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:41,636 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:41,636 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:20:41,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:20:41,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:20:41,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:20:41,638 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 51 states. [2018-09-26 08:20:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:41,662 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:20:41,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:20:41,663 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-09-26 08:20:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:41,663 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:20:41,663 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:20:41,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:20:41,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:20:41,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:20:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:20:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:20:41,668 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2018-09-26 08:20:41,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:41,668 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:20:41,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:20:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:20:41,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:20:41,669 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:41,669 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-09-26 08:20:41,669 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:41,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:41,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1450557974, now seen corresponding path program 49 times [2018-09-26 08:20:41,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:41,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:41,932 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:41,932 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:20:41,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:20:41,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:20:41,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:20:41,934 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 52 states. [2018-09-26 08:20:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:41,967 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:20:41,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:20:41,967 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-09-26 08:20:41,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:41,968 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:20:41,968 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:20:41,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:20:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:20:41,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-26 08:20:41,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:20:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 08:20:41,972 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2018-09-26 08:20:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:41,972 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 08:20:41,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:20:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 08:20:41,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:20:41,972 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:41,973 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-09-26 08:20:41,973 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:41,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:41,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2017631904, now seen corresponding path program 50 times [2018-09-26 08:20:41,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:42,272 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:42,272 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:20:42,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:20:42,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:20:42,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:20:42,275 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 53 states. [2018-09-26 08:20:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:42,308 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 08:20:42,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:20:42,308 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-09-26 08:20:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:42,309 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:20:42,309 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:20:42,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:20:42,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:20:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:20:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:20:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:20:42,314 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2018-09-26 08:20:42,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:42,314 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:20:42,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:20:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:20:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:20:42,316 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:42,316 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-09-26 08:20:42,317 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:42,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:42,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1877912746, now seen corresponding path program 51 times [2018-09-26 08:20:42,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:42,593 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:42,594 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:20:42,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:20:42,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:20:42,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:20:42,596 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 54 states. [2018-09-26 08:20:42,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:42,638 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-26 08:20:42,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:20:42,639 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-09-26 08:20:42,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:42,639 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:20:42,640 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:20:42,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:20:42,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:20:42,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-26 08:20:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:20:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-26 08:20:42,645 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2018-09-26 08:20:42,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:42,645 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-26 08:20:42,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:20:42,645 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-26 08:20:42,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:20:42,646 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:42,646 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-09-26 08:20:42,646 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:42,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:42,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1914254688, now seen corresponding path program 52 times [2018-09-26 08:20:42,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:43,142 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:43,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:20:43,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:20:43,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:20:43,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2760, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:20:43,144 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 55 states. [2018-09-26 08:20:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:43,586 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:20:43,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:20:43,587 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-09-26 08:20:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:43,587 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:20:43,587 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:20:43,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=2760, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:20:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:20:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:20:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:20:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:20:43,594 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2018-09-26 08:20:43,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:43,594 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:20:43,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:20:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:20:43,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:20:43,595 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:43,595 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-09-26 08:20:43,595 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:43,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:43,595 INFO L82 PathProgramCache]: Analyzing trace with hash -787639146, now seen corresponding path program 53 times [2018-09-26 08:20:43,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:43,977 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:43,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:20:43,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:20:43,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:20:43,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2866, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:20:43,978 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 56 states. [2018-09-26 08:20:44,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:44,490 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-26 08:20:44,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:20:44,491 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-09-26 08:20:44,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:44,491 INFO L225 Difference]: With dead ends: 64 [2018-09-26 08:20:44,492 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:20:44,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=214, Invalid=2866, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:20:44,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:20:44,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-26 08:20:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-26 08:20:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-26 08:20:44,497 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2018-09-26 08:20:44,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:44,498 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-26 08:20:44,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:20:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-26 08:20:44,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:20:44,498 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:44,498 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-09-26 08:20:44,499 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:44,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:44,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1352997920, now seen corresponding path program 54 times [2018-09-26 08:20:44,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:44,908 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:44,908 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:20:44,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:20:44,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:20:44,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2974, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:20:44,910 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 57 states. [2018-09-26 08:20:45,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:45,422 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:20:45,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:20:45,422 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-09-26 08:20:45,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:45,423 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:20:45,423 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:20:45,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=2974, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:20:45,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:20:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:20:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:20:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:20:45,429 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2018-09-26 08:20:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:45,429 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:20:45,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:20:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:20:45,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:20:45,430 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:45,430 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-09-26 08:20:45,430 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:45,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:45,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1006729770, now seen corresponding path program 55 times [2018-09-26 08:20:45,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:45,820 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:45,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:20:45,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:20:45,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:20:45,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3084, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:20:45,822 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 58 states. [2018-09-26 08:20:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:46,343 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 08:20:46,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:20:46,343 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-09-26 08:20:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:46,344 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:20:46,344 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:20:46,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=3084, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:20:46,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:20:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-09-26 08:20:46,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:20:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-26 08:20:46,351 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2018-09-26 08:20:46,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:46,351 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-26 08:20:46,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:20:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-26 08:20:46,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-26 08:20:46,352 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:46,352 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-09-26 08:20:46,353 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:46,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:46,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1143844128, now seen corresponding path program 56 times [2018-09-26 08:20:46,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:46,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:46,818 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:46,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:20:46,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:20:46,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:20:46,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3196, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:20:46,820 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 59 states. [2018-09-26 08:20:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:47,287 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 08:20:47,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:20:47,287 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-09-26 08:20:47,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:47,288 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:20:47,288 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:20:47,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=3196, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:20:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:20:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:20:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:20:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:20:47,293 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2018-09-26 08:20:47,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:47,293 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:20:47,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:20:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:20:47,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:20:47,294 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:47,294 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-09-26 08:20:47,295 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:47,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:47,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1099421930, now seen corresponding path program 57 times [2018-09-26 08:20:47,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:47,644 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:47,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:20:47,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:20:47,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:20:47,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3310, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:20:47,646 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 60 states. [2018-09-26 08:20:48,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:48,111 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-26 08:20:48,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:20:48,112 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-09-26 08:20:48,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:48,112 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:20:48,112 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:20:48,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=3310, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:20:48,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:20:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-26 08:20:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:20:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-26 08:20:48,118 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2018-09-26 08:20:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:48,119 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-26 08:20:48,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:20:48,119 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-26 08:20:48,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:20:48,119 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:48,120 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-09-26 08:20:48,120 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:48,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:48,120 INFO L82 PathProgramCache]: Analyzing trace with hash 277666208, now seen corresponding path program 58 times [2018-09-26 08:20:48,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:48,460 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:48,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:20:48,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:20:48,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:20:48,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3426, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:20:48,462 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 61 states. [2018-09-26 08:20:48,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:48,915 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:20:48,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:20:48,915 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-09-26 08:20:48,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:48,916 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:20:48,916 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:20:48,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=3426, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:20:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:20:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:20:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:20:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:20:48,925 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2018-09-26 08:20:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:48,925 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:20:48,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:20:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:20:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:20:48,926 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:48,926 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-09-26 08:20:48,926 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:48,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:48,927 INFO L82 PathProgramCache]: Analyzing trace with hash 17725526, now seen corresponding path program 59 times [2018-09-26 08:20:48,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:49,305 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:49,305 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:20:49,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:20:49,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:20:49,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3544, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:20:49,307 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 62 states. [2018-09-26 08:20:49,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:49,781 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 08:20:49,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:20:49,781 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-09-26 08:20:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:49,782 INFO L225 Difference]: With dead ends: 70 [2018-09-26 08:20:49,782 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:20:49,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=3544, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:20:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:20:49,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-26 08:20:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:20:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-26 08:20:49,788 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2018-09-26 08:20:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:49,788 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-26 08:20:49,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:20:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-26 08:20:49,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:20:49,789 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:49,789 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-09-26 08:20:49,789 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:49,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:49,789 INFO L82 PathProgramCache]: Analyzing trace with hash 549498976, now seen corresponding path program 60 times [2018-09-26 08:20:49,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:50,165 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:50,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:20:50,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:20:50,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:20:50,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3664, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:20:50,166 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 63 states. [2018-09-26 08:20:50,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:50,605 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:20:50,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:20:50,605 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-09-26 08:20:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:50,606 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:20:50,606 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:20:50,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=3664, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:20:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:20:50,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:20:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:20:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:20:50,611 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2018-09-26 08:20:50,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:50,612 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:20:50,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:20:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:20:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:20:50,612 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:50,613 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-09-26 08:20:50,613 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:50,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:50,613 INFO L82 PathProgramCache]: Analyzing trace with hash -145393258, now seen corresponding path program 61 times [2018-09-26 08:20:50,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:50,960 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:50,960 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:20:50,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:20:50,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:20:50,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3786, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:20:50,962 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 64 states. [2018-09-26 08:20:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:51,391 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-26 08:20:51,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:20:51,391 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-09-26 08:20:51,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:51,392 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:20:51,392 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:20:51,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=246, Invalid=3786, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:20:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:20:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-09-26 08:20:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:20:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-26 08:20:51,398 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2018-09-26 08:20:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:51,398 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-26 08:20:51,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:20:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-26 08:20:51,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:20:51,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:51,399 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-09-26 08:20:51,399 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:51,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:51,400 INFO L82 PathProgramCache]: Analyzing trace with hash -212216032, now seen corresponding path program 62 times [2018-09-26 08:20:51,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:51,744 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:51,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:20:51,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:20:51,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:20:51,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=3910, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:20:51,746 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 65 states. [2018-09-26 08:20:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:52,191 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-26 08:20:52,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:20:52,191 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-09-26 08:20:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:52,192 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:20:52,192 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:20:52,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=250, Invalid=3910, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:20:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:20:52,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:20:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:20:52,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:20:52,198 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2018-09-26 08:20:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:52,199 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:20:52,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:20:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:20:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:20:52,200 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:52,200 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-09-26 08:20:52,200 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:52,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:52,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2011245270, now seen corresponding path program 63 times [2018-09-26 08:20:52,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:52,658 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:52,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:20:52,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:20:52,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:20:52,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4036, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:20:52,663 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 66 states. [2018-09-26 08:20:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:53,191 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-26 08:20:53,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:20:53,191 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-09-26 08:20:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:53,193 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:20:53,193 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:20:53,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=4036, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:20:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:20:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-09-26 08:20:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:20:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-26 08:20:53,203 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2018-09-26 08:20:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:53,204 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-26 08:20:53,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:20:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-26 08:20:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:20:53,205 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:53,205 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-09-26 08:20:53,205 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:53,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:53,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2075898400, now seen corresponding path program 64 times [2018-09-26 08:20:53,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:53,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:53,632 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:53,632 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:20:53,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:20:53,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:20:53,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=4164, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:20:53,634 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 67 states. [2018-09-26 08:20:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:54,063 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:20:54,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:20:54,063 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-09-26 08:20:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:54,064 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:20:54,064 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:20:54,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=258, Invalid=4164, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:20:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:20:54,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:20:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:20:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:20:54,070 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2018-09-26 08:20:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:54,070 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:20:54,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:20:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:20:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:20:54,071 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:54,071 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-09-26 08:20:54,071 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:54,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:54,072 INFO L82 PathProgramCache]: Analyzing trace with hash 71666710, now seen corresponding path program 65 times [2018-09-26 08:20:54,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:54,473 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:54,473 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:20:54,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:20:54,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:20:54,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=4294, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:20:54,474 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 68 states. [2018-09-26 08:20:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:54,907 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-26 08:20:54,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:20:54,907 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-09-26 08:20:54,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:54,908 INFO L225 Difference]: With dead ends: 76 [2018-09-26 08:20:54,908 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:20:54,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=262, Invalid=4294, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:20:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:20:54,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-26 08:20:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:20:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-26 08:20:54,914 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2018-09-26 08:20:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:54,915 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-26 08:20:54,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:20:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-26 08:20:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 08:20:54,915 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:54,916 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-09-26 08:20:54,916 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:54,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:54,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2073291616, now seen corresponding path program 66 times [2018-09-26 08:20:54,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:55,316 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:55,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:20:55,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:20:55,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:20:55,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=4426, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:20:55,318 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 69 states. [2018-09-26 08:20:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:55,776 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:20:55,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:20:55,776 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-09-26 08:20:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:55,777 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:20:55,777 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:20:55,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=266, Invalid=4426, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:20:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:20:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:20:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:20:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:20:55,783 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2018-09-26 08:20:55,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:55,783 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:20:55,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:20:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:20:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:20:55,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:55,784 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-09-26 08:20:55,784 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:55,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:55,784 INFO L82 PathProgramCache]: Analyzing trace with hash 152477014, now seen corresponding path program 67 times [2018-09-26 08:20:55,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:56,167 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:56,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:20:56,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:20:56,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:20:56,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=4560, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:20:56,168 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 70 states. [2018-09-26 08:20:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:56,662 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-26 08:20:56,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:20:56,663 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-09-26 08:20:56,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:56,663 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:20:56,663 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:20:56,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=4560, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:20:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:20:56,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 08:20:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:20:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-26 08:20:56,669 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2018-09-26 08:20:56,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:56,669 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-26 08:20:56,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:20:56,669 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-26 08:20:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 08:20:56,670 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:56,670 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-09-26 08:20:56,670 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:56,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:56,670 INFO L82 PathProgramCache]: Analyzing trace with hash 431827808, now seen corresponding path program 68 times [2018-09-26 08:20:56,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:57,098 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:57,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:20:57,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:20:57,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:20:57,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=4696, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:20:57,100 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 71 states. [2018-09-26 08:20:57,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:57,531 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 08:20:57,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:20:57,532 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-09-26 08:20:57,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:57,532 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:20:57,533 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:20:57,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=274, Invalid=4696, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:20:57,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:20:57,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:20:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:20:57,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:20:57,538 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2018-09-26 08:20:57,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:57,539 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:20:57,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:20:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:20:57,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:20:57,540 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:57,540 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-09-26 08:20:57,540 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:57,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:57,540 INFO L82 PathProgramCache]: Analyzing trace with hash 501767830, now seen corresponding path program 69 times [2018-09-26 08:20:57,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:57,895 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:57,896 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:20:57,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:20:57,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:20:57,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=4834, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:20:57,897 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 72 states. [2018-09-26 08:20:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:58,257 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:20:58,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:20:58,257 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-09-26 08:20:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:58,258 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:20:58,258 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:20:58,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=278, Invalid=4834, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:20:58,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:20:58,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 08:20:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:20:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-26 08:20:58,263 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2018-09-26 08:20:58,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:58,263 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-26 08:20:58,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:20:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-26 08:20:58,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:20:58,264 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:58,265 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-09-26 08:20:58,265 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:58,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:58,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1625058784, now seen corresponding path program 70 times [2018-09-26 08:20:58,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:58,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:58,639 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:58,640 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:20:58,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:20:58,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:20:58,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=4974, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:20:58,641 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 73 states. [2018-09-26 08:20:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:58,998 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:20:58,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:20:58,998 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-09-26 08:20:58,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:58,999 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:20:58,999 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:20:59,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=282, Invalid=4974, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:20:59,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:20:59,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:20:59,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:20:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:20:59,004 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2018-09-26 08:20:59,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:59,004 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:20:59,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:20:59,004 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:20:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:20:59,005 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:59,005 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-09-26 08:20:59,005 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:59,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:59,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1162792918, now seen corresponding path program 71 times [2018-09-26 08:20:59,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:59,453 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:59,454 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:20:59,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:20:59,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:20:59,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=5116, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:20:59,455 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 74 states. [2018-09-26 08:20:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:59,888 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-26 08:20:59,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:20:59,888 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-09-26 08:20:59,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:59,888 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:20:59,889 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:20:59,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=5116, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:20:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:20:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-09-26 08:20:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:20:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-26 08:20:59,893 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2018-09-26 08:20:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:59,893 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-26 08:20:59,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:20:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-26 08:20:59,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:20:59,894 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:59,894 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-09-26 08:20:59,895 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:59,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:59,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1686849760, now seen corresponding path program 72 times [2018-09-26 08:20:59,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:00,298 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:00,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:21:00,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:21:00,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:21:00,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=5260, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:21:00,299 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 75 states. [2018-09-26 08:21:00,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:00,656 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:21:00,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:21:00,656 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-09-26 08:21:00,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:00,656 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:21:00,657 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:21:00,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=290, Invalid=5260, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:21:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:21:00,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:21:00,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:21:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:21:00,662 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2018-09-26 08:21:00,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:00,662 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:21:00,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:21:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:21:00,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:21:00,663 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:00,663 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-09-26 08:21:00,663 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:00,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:00,664 INFO L82 PathProgramCache]: Analyzing trace with hash 752742678, now seen corresponding path program 73 times [2018-09-26 08:21:00,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:01,041 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:01,041 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:21:01,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:21:01,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:21:01,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=5406, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:21:01,042 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 76 states. [2018-09-26 08:21:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:01,404 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-26 08:21:01,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:21:01,404 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-09-26 08:21:01,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:01,405 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:21:01,405 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:21:01,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=294, Invalid=5406, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:21:01,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:21:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 08:21:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:21:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-26 08:21:01,411 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2018-09-26 08:21:01,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:01,411 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-26 08:21:01,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:21:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-26 08:21:01,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 08:21:01,412 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:01,412 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-09-26 08:21:01,412 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:01,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:01,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1860194208, now seen corresponding path program 74 times [2018-09-26 08:21:01,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:01,777 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:01,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:21:01,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:21:01,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:21:01,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=5554, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:21:01,778 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 77 states. [2018-09-26 08:21:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:02,152 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:21:02,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:21:02,152 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-09-26 08:21:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:02,153 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:21:02,153 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:21:02,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=298, Invalid=5554, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:21:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:21:02,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:21:02,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:21:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:21:02,158 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2018-09-26 08:21:02,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:02,158 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:21:02,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:21:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:21:02,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:21:02,159 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:02,159 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-09-26 08:21:02,159 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:02,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:02,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1831453270, now seen corresponding path program 75 times [2018-09-26 08:21:02,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:02,624 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:02,624 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:21:02,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:21:02,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:21:02,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=5704, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:21:02,625 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 78 states. [2018-09-26 08:21:02,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:02,986 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 08:21:02,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:21:02,986 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-09-26 08:21:02,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:02,987 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:21:02,987 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:21:02,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=5704, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:21:02,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:21:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-26 08:21:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:21:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-26 08:21:02,991 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2018-09-26 08:21:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:02,992 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-26 08:21:02,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:21:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-26 08:21:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:21:02,992 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:02,993 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-09-26 08:21:02,993 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:02,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:02,993 INFO L82 PathProgramCache]: Analyzing trace with hash 940484192, now seen corresponding path program 76 times [2018-09-26 08:21:02,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:03,460 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:03,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:21:03,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:21:03,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:21:03,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=5856, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:21:03,461 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 79 states. [2018-09-26 08:21:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:04,064 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:21:04,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:21:04,064 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-09-26 08:21:04,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:04,065 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:21:04,065 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:21:04,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=5856, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:21:04,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:21:04,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:21:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:21:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:21:04,070 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2018-09-26 08:21:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:04,071 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:21:04,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:21:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:21:04,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:21:04,071 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:04,071 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-09-26 08:21:04,072 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:04,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:04,072 INFO L82 PathProgramCache]: Analyzing trace with hash -909753450, now seen corresponding path program 77 times [2018-09-26 08:21:04,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:04,471 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:04,471 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:21:04,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:21:04,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:21:04,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=6010, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:21:04,472 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 80 states. [2018-09-26 08:21:04,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:04,880 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-26 08:21:04,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:21:04,881 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-09-26 08:21:04,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:04,881 INFO L225 Difference]: With dead ends: 88 [2018-09-26 08:21:04,882 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:21:04,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=310, Invalid=6010, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:21:04,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:21:04,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-09-26 08:21:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:21:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-26 08:21:04,887 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2018-09-26 08:21:04,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:04,887 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-26 08:21:04,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:21:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-26 08:21:04,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:21:04,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:04,888 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-09-26 08:21:04,888 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:04,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:04,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1862421792, now seen corresponding path program 78 times [2018-09-26 08:21:04,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:05,351 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:05,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:21:05,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:21:05,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:21:05,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=6166, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:21:05,352 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 81 states. [2018-09-26 08:21:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:05,822 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:21:05,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:21:05,822 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-09-26 08:21:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:05,823 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:21:05,823 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:21:05,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=314, Invalid=6166, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:21:05,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:21:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:21:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:21:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:21:05,830 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2018-09-26 08:21:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:05,830 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:21:05,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:21:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:21:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:21:05,831 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:05,831 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-09-26 08:21:05,832 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:05,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:05,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1900508374, now seen corresponding path program 79 times [2018-09-26 08:21:05,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:06,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:06,304 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:06,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:21:06,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:21:06,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:21:06,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=6324, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:21:06,305 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 82 states. [2018-09-26 08:21:06,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:06,716 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:21:06,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:21:06,716 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-09-26 08:21:06,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:06,716 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:21:06,717 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:21:06,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=6324, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:21:06,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:21:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-09-26 08:21:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:21:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 08:21:06,721 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2018-09-26 08:21:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:06,721 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 08:21:06,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:21:06,721 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 08:21:06,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:21:06,721 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:06,721 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-09-26 08:21:06,722 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:06,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:06,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1213774880, now seen corresponding path program 80 times [2018-09-26 08:21:06,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:07,096 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:07,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:21:07,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:21:07,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:21:07,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=6484, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:21:07,097 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 83 states. [2018-09-26 08:21:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:07,532 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 08:21:07,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:21:07,532 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-09-26 08:21:07,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:07,533 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:21:07,533 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:21:07,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=322, Invalid=6484, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:21:07,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:21:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:21:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:21:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:21:07,539 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2018-09-26 08:21:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:07,539 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:21:07,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:21:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:21:07,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:21:07,540 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:07,540 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-09-26 08:21:07,540 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:07,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:07,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1027692054, now seen corresponding path program 81 times [2018-09-26 08:21:07,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:07,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:07,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:21:07,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:21:07,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:21:07,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=6646, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:21:07,942 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 84 states. [2018-09-26 08:21:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:08,370 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-26 08:21:08,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:21:08,370 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-09-26 08:21:08,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:08,371 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:21:08,371 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:21:08,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=326, Invalid=6646, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:21:08,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:21:08,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-09-26 08:21:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:21:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-26 08:21:08,376 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2018-09-26 08:21:08,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:08,376 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-26 08:21:08,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:21:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-26 08:21:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:21:08,377 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:08,377 INFO L375 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-09-26 08:21:08,377 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:08,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:08,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1793690272, now seen corresponding path program 82 times [2018-09-26 08:21:08,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:08,787 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:08,787 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:21:08,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:21:08,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:21:08,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=6810, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:21:08,788 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 85 states. [2018-09-26 08:21:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:09,220 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-26 08:21:09,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:21:09,220 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-09-26 08:21:09,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:09,221 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:21:09,221 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:21:09,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=6810, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:21:09,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:21:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:21:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:21:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:21:09,226 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2018-09-26 08:21:09,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:09,226 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:21:09,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:21:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:21:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:21:09,227 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:09,227 INFO L375 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-09-26 08:21:09,227 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:09,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:09,228 INFO L82 PathProgramCache]: Analyzing trace with hash -230168746, now seen corresponding path program 83 times [2018-09-26 08:21:09,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:09,596 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:09,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:21:09,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:21:09,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:21:09,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=6976, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:21:09,598 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 86 states. [2018-09-26 08:21:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:10,077 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-26 08:21:10,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:21:10,077 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-09-26 08:21:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:10,077 INFO L225 Difference]: With dead ends: 94 [2018-09-26 08:21:10,078 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:21:10,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=334, Invalid=6976, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:21:10,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:21:10,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-09-26 08:21:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:21:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-26 08:21:10,081 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2018-09-26 08:21:10,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:10,082 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-26 08:21:10,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:21:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-26 08:21:10,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 08:21:10,082 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:10,083 INFO L375 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-09-26 08:21:10,083 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:10,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:10,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1454711136, now seen corresponding path program 84 times [2018-09-26 08:21:10,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:10,477 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:10,477 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:21:10,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:21:10,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:21:10,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=7144, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:21:10,478 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 87 states. [2018-09-26 08:21:10,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:10,979 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:21:10,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:21:10,979 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-09-26 08:21:10,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:10,980 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:21:10,980 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:21:10,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=7144, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:21:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:21:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:21:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:21:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:21:10,988 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2018-09-26 08:21:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:10,988 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:21:10,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:21:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:21:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:21:10,989 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:10,989 INFO L375 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-09-26 08:21:10,989 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:10,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2146379926, now seen corresponding path program 85 times [2018-09-26 08:21:10,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:11,435 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:11,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:21:11,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:21:11,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:21:11,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=7314, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:21:11,436 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 88 states. [2018-09-26 08:21:12,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:12,031 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-26 08:21:12,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:21:12,031 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-09-26 08:21:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:12,032 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:21:12,032 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:21:12,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=342, Invalid=7314, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:21:12,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:21:12,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-26 08:21:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:21:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-26 08:21:12,040 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2018-09-26 08:21:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:12,040 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-26 08:21:12,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:21:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-26 08:21:12,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-26 08:21:12,042 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:12,042 INFO L375 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-09-26 08:21:12,042 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:12,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:12,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2113275936, now seen corresponding path program 86 times [2018-09-26 08:21:12,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:12,506 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:12,506 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:21:12,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:21:12,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:21:12,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=7486, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:21:12,508 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 89 states. [2018-09-26 08:21:12,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:12,997 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-09-26 08:21:12,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:21:12,997 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-09-26 08:21:12,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:12,997 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:21:12,997 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:21:12,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=346, Invalid=7486, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:21:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:21:13,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:21:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:21:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:21:13,003 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 89 [2018-09-26 08:21:13,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:13,003 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:21:13,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:21:13,003 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:21:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:21:13,003 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:13,004 INFO L375 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-09-26 08:21:13,004 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:13,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:13,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1087052246, now seen corresponding path program 87 times [2018-09-26 08:21:13,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:13,419 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:13,419 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:21:13,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:21:13,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:21:13,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=7660, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:21:13,420 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 90 states. [2018-09-26 08:21:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:13,917 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-26 08:21:13,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:21:13,917 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-09-26 08:21:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:13,918 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:21:13,918 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:21:13,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=350, Invalid=7660, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:21:13,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:21:13,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-26 08:21:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:21:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-26 08:21:13,923 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2018-09-26 08:21:13,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:13,924 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-26 08:21:13,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:21:13,924 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-26 08:21:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:21:13,925 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:13,925 INFO L375 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-09-26 08:21:13,925 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:13,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:13,925 INFO L82 PathProgramCache]: Analyzing trace with hash -661111072, now seen corresponding path program 88 times [2018-09-26 08:21:13,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:14,363 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:14,364 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:21:14,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:21:14,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:21:14,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=7836, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:21:14,365 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 91 states. [2018-09-26 08:21:14,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:14,877 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 08:21:14,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:21:14,877 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-09-26 08:21:14,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:14,878 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:21:14,878 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:21:14,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=354, Invalid=7836, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:21:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:21:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:21:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:21:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:21:14,882 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2018-09-26 08:21:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:14,882 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:21:14,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:21:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:21:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:21:14,883 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:14,884 INFO L375 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-09-26 08:21:14,884 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:14,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:14,884 INFO L82 PathProgramCache]: Analyzing trace with hash 980400918, now seen corresponding path program 89 times [2018-09-26 08:21:14,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:15,404 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:15,404 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:21:15,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:21:15,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:21:15,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=8014, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:21:15,406 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 92 states. [2018-09-26 08:21:15,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:15,941 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-26 08:21:15,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:21:15,941 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-09-26 08:21:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:15,942 INFO L225 Difference]: With dead ends: 100 [2018-09-26 08:21:15,942 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:21:15,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=358, Invalid=8014, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:21:15,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:21:15,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-26 08:21:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:21:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-26 08:21:15,946 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 92 [2018-09-26 08:21:15,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:15,946 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-26 08:21:15,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:21:15,946 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-26 08:21:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:21:15,947 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:15,947 INFO L375 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-09-26 08:21:15,947 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:15,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:15,948 INFO L82 PathProgramCache]: Analyzing trace with hash 327665056, now seen corresponding path program 90 times [2018-09-26 08:21:15,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:16,392 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:16,392 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:21:16,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:21:16,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:21:16,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=8194, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:21:16,393 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 93 states. [2018-09-26 08:21:16,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:16,936 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 08:21:16,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:21:16,936 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-09-26 08:21:16,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:16,937 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:21:16,937 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:21:16,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=8194, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:21:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:21:16,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:21:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:21:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:21:16,943 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2018-09-26 08:21:16,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:16,943 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:21:16,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:21:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:21:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:21:16,944 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:16,944 INFO L375 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-09-26 08:21:16,944 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:16,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:16,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1567689814, now seen corresponding path program 91 times [2018-09-26 08:21:16,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:17,406 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:17,406 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:21:17,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:21:17,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:21:17,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=8376, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:21:17,407 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 94 states. [2018-09-26 08:21:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:17,961 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-26 08:21:17,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:21:17,962 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-09-26 08:21:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:17,962 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:21:17,962 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:21:17,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=366, Invalid=8376, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:21:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:21:17,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-26 08:21:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:21:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-26 08:21:17,968 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2018-09-26 08:21:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:17,968 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-26 08:21:17,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:21:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-26 08:21:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 08:21:17,969 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:17,969 INFO L375 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-09-26 08:21:17,969 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:17,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1353751648, now seen corresponding path program 92 times [2018-09-26 08:21:17,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:18,488 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:18,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:21:18,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:21:18,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:21:18,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=8560, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:21:18,490 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 95 states. [2018-09-26 08:21:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:19,137 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 08:21:19,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:21:19,138 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-09-26 08:21:19,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:19,138 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:21:19,138 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:21:19,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=370, Invalid=8560, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:21:19,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:21:19,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:21:19,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:21:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:21:19,142 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 95 [2018-09-26 08:21:19,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:19,142 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:21:19,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:21:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:21:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:21:19,143 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:19,143 INFO L375 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-09-26 08:21:19,143 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:19,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:19,143 INFO L82 PathProgramCache]: Analyzing trace with hash -983364202, now seen corresponding path program 93 times [2018-09-26 08:21:19,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:19,606 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:19,606 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:21:19,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:21:19,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:21:19,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=8746, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:21:19,607 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 96 states. [2018-09-26 08:21:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:20,215 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:21:20,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:21:20,215 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-09-26 08:21:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:20,216 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:21:20,216 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:21:20,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=374, Invalid=8746, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:21:20,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:21:20,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-26 08:21:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:21:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-26 08:21:20,222 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2018-09-26 08:21:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:20,223 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-26 08:21:20,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:21:20,223 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-26 08:21:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-26 08:21:20,223 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:20,224 INFO L375 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-09-26 08:21:20,224 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:20,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:20,224 INFO L82 PathProgramCache]: Analyzing trace with hash -419511520, now seen corresponding path program 94 times [2018-09-26 08:21:20,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:20,711 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:20,712 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:21:20,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:21:20,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:21:20,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=8934, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:21:20,713 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 97 states. [2018-09-26 08:21:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:21,311 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:21:21,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:21:21,311 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-09-26 08:21:21,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:21,312 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:21:21,312 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:21:21,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=8934, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:21:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:21:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:21:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:21:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:21:21,318 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2018-09-26 08:21:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:21,318 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:21:21,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:21:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:21:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:21:21,318 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:21,318 INFO L375 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-09-26 08:21:21,319 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:21,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:21,319 INFO L82 PathProgramCache]: Analyzing trace with hash -119947562, now seen corresponding path program 95 times [2018-09-26 08:21:21,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:21,804 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:21,804 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:21:21,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:21:21,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:21:21,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=9124, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:21:21,806 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 98 states. [2018-09-26 08:21:22,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:22,429 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-26 08:21:22,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:21:22,430 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-09-26 08:21:22,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:22,430 INFO L225 Difference]: With dead ends: 106 [2018-09-26 08:21:22,430 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:21:22,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=382, Invalid=9124, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:21:22,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:21:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-09-26 08:21:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:21:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-26 08:21:22,435 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 98 [2018-09-26 08:21:22,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:22,436 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-26 08:21:22,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:21:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-26 08:21:22,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 08:21:22,436 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:22,436 INFO L375 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-09-26 08:21:22,437 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:22,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:22,437 INFO L82 PathProgramCache]: Analyzing trace with hash 576600544, now seen corresponding path program 96 times [2018-09-26 08:21:22,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:22,897 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:22,897 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:21:22,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:21:22,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:21:22,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=9316, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:21:22,898 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 99 states. [2018-09-26 08:21:23,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:23,504 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-26 08:21:23,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:21:23,504 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-09-26 08:21:23,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:23,504 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:21:23,505 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:21:23,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=386, Invalid=9316, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:21:23,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:21:23,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:21:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:21:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:21:23,509 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2018-09-26 08:21:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:23,509 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:21:23,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:21:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:21:23,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:21:23,510 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:23,510 INFO L375 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-09-26 08:21:23,510 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:23,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:23,511 INFO L82 PathProgramCache]: Analyzing trace with hash 694755350, now seen corresponding path program 97 times [2018-09-26 08:21:23,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:24,030 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:24,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:21:24,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:21:24,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:21:24,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=9510, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:21:24,031 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 100 states. [2018-09-26 08:21:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:24,674 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-09-26 08:21:24,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:21:24,674 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-09-26 08:21:24,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:24,675 INFO L225 Difference]: With dead ends: 108 [2018-09-26 08:21:24,675 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:21:24,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=390, Invalid=9510, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:21:24,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:21:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-26 08:21:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:21:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-26 08:21:24,680 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2018-09-26 08:21:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:24,680 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-26 08:21:24,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:21:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-26 08:21:24,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 08:21:24,681 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:24,681 INFO L375 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-09-26 08:21:24,681 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:24,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:24,682 INFO L82 PathProgramCache]: Analyzing trace with hash 62587040, now seen corresponding path program 98 times [2018-09-26 08:21:24,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:25,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:25,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:25,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:21:25,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:21:25,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:21:25,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=9706, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:21:25,235 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 101 states. [2018-09-26 08:21:25,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:25,935 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-09-26 08:21:25,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:21:25,935 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-09-26 08:21:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:25,936 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:21:25,936 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:21:25,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=9706, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:21:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:21:25,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:21:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:21:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 08:21:25,941 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 101 [2018-09-26 08:21:25,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:25,942 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 08:21:25,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:21:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 08:21:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:21:25,942 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:25,943 INFO L375 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-09-26 08:21:25,943 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:25,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:25,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1940205910, now seen corresponding path program 99 times [2018-09-26 08:21:25,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:26,554 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:26,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:21:26,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:21:26,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:21:26,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=9904, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:21:26,555 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 102 states. [2018-09-26 08:21:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:27,187 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-26 08:21:27,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:21:27,187 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-09-26 08:21:27,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:27,188 INFO L225 Difference]: With dead ends: 110 [2018-09-26 08:21:27,188 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:21:27,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=398, Invalid=9904, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:21:27,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:21:27,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-09-26 08:21:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:21:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-26 08:21:27,192 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2018-09-26 08:21:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:27,193 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-26 08:21:27,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:21:27,193 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-26 08:21:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 08:21:27,193 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:27,193 INFO L375 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-09-26 08:21:27,193 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:27,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:27,194 INFO L82 PathProgramCache]: Analyzing trace with hash 16848736, now seen corresponding path program 100 times [2018-09-26 08:21:27,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 1225 proven. 3825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:27,911 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:27,912 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:21:27,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:21:27,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:21:27,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1428, Invalid=9078, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:21:27,913 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 103 states. [2018-09-26 08:21:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:29,123 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-26 08:21:29,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:21:29,124 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-09-26 08:21:29,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:29,125 INFO L225 Difference]: With dead ends: 106 [2018-09-26 08:21:29,125 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:21:29,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1481, Invalid=9231, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:21:29,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:21:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:21:29,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:21:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 08:21:29,133 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-09-26 08:21:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:29,133 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 08:21:29,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:21:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 08:21:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:21:29,134 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:29,134 INFO L375 BasicCegarLoop]: trace histogram [100, 1, 1, 1, 1] [2018-09-26 08:21:29,134 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:29,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:29,135 INFO L82 PathProgramCache]: Analyzing trace with hash 522310862, now seen corresponding path program 1 times [2018-09-26 08:21:29,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:30,153 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:30,153 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:21:30,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:21:30,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:21:30,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=10104, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:21:30,155 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 103 states. [2018-09-26 08:21:31,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:31,992 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-09-26 08:21:31,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:21:31,992 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 104 [2018-09-26 08:21:31,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:31,993 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:21:31,993 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:21:31,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=402, Invalid=10104, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:21:31,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:21:32,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-09-26 08:21:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:21:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-26 08:21:32,000 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-09-26 08:21:32,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:32,001 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-26 08:21:32,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:21:32,001 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-26 08:21:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-26 08:21:32,002 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:32,002 INFO L375 BasicCegarLoop]: trace histogram [101, 1, 1, 1, 1] [2018-09-26 08:21:32,002 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:32,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:32,002 INFO L82 PathProgramCache]: Analyzing trace with hash -987996072, now seen corresponding path program 2 times [2018-09-26 08:21:32,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 1376 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:32,702 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:32,703 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:21:32,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:21:32,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:21:32,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1478, Invalid=9028, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:21:32,704 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 103 states. [2018-09-26 08:21:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:33,331 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-26 08:21:33,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:21:33,331 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 105 [2018-09-26 08:21:33,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:33,331 INFO L225 Difference]: With dead ends: 106 [2018-09-26 08:21:33,331 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:21:33,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1478, Invalid=9028, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:21:33,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:21:33,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:21:33,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:21:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:21:33,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2018-09-26 08:21:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,333 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:21:33,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:21:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:21:33,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:21:33,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:21:33,492 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 508 [2018-09-26 08:21:34,673 WARN L178 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 508 DAG size of output: 508 [2018-09-26 08:21:34,683 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 11 26) the Hoare annotation is: true [2018-09-26 08:21:34,683 INFO L422 ceAbstractionStarter]: At program point mainErr0ASSERT_VIOLATIONASSERT(line 24) the Hoare annotation is: false [2018-09-26 08:21:34,684 INFO L422 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (and (<= 99 x) (<= 100 y) (<= y 100)) [2018-09-26 08:21:34,684 INFO L429 ceAbstractionStarter]: At program point mainEXIT(lines 11 26) the Hoare annotation is: true [2018-09-26 08:21:34,684 INFO L422 ceAbstractionStarter]: At program point L24(line 24) the Hoare annotation is: (and (<= 99 x) (<= 100 y) (<= y 100)) [2018-09-26 08:21:34,685 INFO L422 ceAbstractionStarter]: At program point mainErr1ASSERT_VIOLATIONASSERT(line 25) the Hoare annotation is: false [2018-09-26 08:21:34,685 INFO L426 ceAbstractionStarter]: For program point L16(lines 16 21) no Hoare annotation was computed. [2018-09-26 08:21:34,699 INFO L422 ceAbstractionStarter]: At program point L16-2(lines 15 22) the Hoare annotation is: (let ((.cse0 (<= y 50)) (.cse1 (<= 50 y))) (or (and (<= 54 x) (<= x 54) (<= 54 y) (<= y 54)) (and .cse0 .cse1 (<= x 17) (<= 17 x)) (and .cse0 (<= x 43) .cse1 (<= 43 x)) (and (<= 14 x) .cse0 .cse1 (<= x 14)) (and .cse0 .cse1 (<= 20 x) (<= x 20)) (and .cse0 (<= 3 x) .cse1 (<= x 3)) (and .cse0 .cse1 (<= x 28) (<= 28 x)) (and (<= 93 x) (<= x 93) (<= 93 y) (<= y 93)) (and (<= x 72) (<= y 72) (<= 72 x) (<= 72 y)) (and (<= x 75) (<= 75 x) (<= y 75) (<= 75 y)) (and (<= x 84) (<= 84 x) (<= 84 y) (<= y 84)) (and (<= 63 y) (<= 63 x) (<= y 63) (<= x 63)) (and (<= 99 x) (<= 99 y) (<= y 99) (<= x 99)) (and (<= 80 x) (<= y 80) (<= x 80) (<= 80 y)) (and (<= x 71) (<= 71 x) (<= 71 y) (<= y 71)) (and .cse0 .cse1 (<= 50 x) (<= x 50)) (and (<= y 78) (<= 78 x) (<= 78 y) (<= x 78)) (and .cse0 .cse1 (<= 0 x) (<= x 0)) (and (<= 62 x) (<= y 62) (<= 62 y) (<= x 62)) (and .cse0 .cse1 (<= 10 x) (<= x 10)) (and (<= 12 x) .cse0 .cse1 (<= x 12)) (and .cse0 .cse1 (<= x 32) (<= 32 x)) (and .cse0 .cse1 (<= 31 x) (<= x 31)) (and (<= 68 x) (<= 68 y) (<= x 68) (<= y 68)) (and (<= 87 x) (<= y 87) (<= 87 y) (<= x 87)) (and .cse0 .cse1 (<= x 19) (<= 19 x)) (and .cse0 .cse1 (<= 42 x) (<= x 42)) (and (<= y 65) (<= 65 x) (<= 65 y) (<= x 65)) (and (<= 2 x) .cse0 .cse1 (<= x 2)) (and .cse0 .cse1 (<= x 25) (<= 25 x)) (and .cse0 .cse1 (<= x 22) (<= 22 x)) (and .cse0 .cse1 (<= x 26) (<= 26 x)) (and .cse0 .cse1 (<= x 8) (<= 8 x)) (and .cse0 (<= 18 x) .cse1 (<= x 18)) (and (<= y 76) (<= x 76) (<= 76 x) (<= 76 y)) (and .cse0 .cse1 (<= 27 x) (<= x 27)) (and (<= 9 x) .cse0 (<= x 9) .cse1) (and (<= x 51) (<= 51 x) (<= y 51) (<= 51 y)) (and (<= 69 y) (<= y 69) (<= 69 x) (<= x 69)) (and (<= 58 y) (<= y 58) (<= x 58) (<= 58 x)) (and (<= x 4) .cse0 .cse1 (<= 4 x)) (and .cse0 (<= x 1) .cse1 (<= 1 x)) (and .cse0 .cse1 (<= 36 x) (<= x 36)) (and .cse0 (<= 46 x) .cse1 (<= x 46)) (and (<= 52 y) (<= 52 x) (<= y 52) (<= x 52)) (and .cse0 .cse1 (<= x 48) (<= 48 x)) (and .cse0 .cse1 (<= x 15) (<= 15 x)) (and (<= 96 y) (<= x 96) (<= y 96) (<= 96 x)) (and (<= y 91) (<= 91 y) (<= x 91) (<= 91 x)) (and (<= x 98) (<= y 98) (<= 98 y) (<= 98 x)) (and (<= x 95) (<= 95 x) (<= y 95) (<= 95 y)) (and (<= 88 x) (<= x 88) (<= y 88) (<= 88 y)) (and (<= x 39) .cse0 .cse1 (<= 39 x)) (and (<= x 73) (<= 73 x) (<= y 73) (<= 73 y)) (and (<= x 66) (<= 66 y) (<= y 66) (<= 66 x)) (and (<= 77 y) (<= y 77) (<= x 77) (<= 77 x)) (and .cse0 .cse1 (<= 35 x) (<= x 35)) (and (<= 97 y) (<= 97 x) (<= x 97) (<= y 97)) (and .cse0 (<= x 5) .cse1 (<= 5 x)) (and (<= x 59) (<= 59 y) (<= y 59) (<= 59 x)) (and (<= 85 x) (<= y 85) (<= 85 y) (<= x 85)) (and (<= 53 y) (<= x 53) (<= 53 x) (<= y 53)) (and (<= 60 y) (<= 60 x) (<= x 60) (<= y 60)) (and .cse0 .cse1 (<= 38 x) (<= x 38)) (and .cse0 (<= x 21) .cse1 (<= 21 x)) (and .cse0 .cse1 (<= 23 x) (<= x 23)) (and .cse0 .cse1 (<= x 33) (<= 33 x)) (and (<= 70 x) (<= 70 y) (<= x 70) (<= y 70)) (and (<= 64 x) (<= y 64) (<= 64 y) (<= x 64)) (and (<= y 55) (<= x 55) (<= 55 x) (<= 55 y)) (and (<= y 81) (<= x 81) (<= 81 y) (<= 81 x)) (and .cse0 .cse1 (<= 49 x) (<= x 49)) (and .cse0 .cse1 (<= x 11) (<= 11 x)) (and .cse0 .cse1 (<= x 16) (<= 16 x)) (and (<= 92 y) (<= x 92) (<= 92 x) (<= y 92)) (and (<= x 74) (<= 74 x) (<= y 74) (<= 74 y)) (and .cse0 .cse1 (<= 7 x) (<= x 7)) (and (<= y 79) (<= 79 y) (<= 79 x) (<= x 79)) (and .cse0 (<= x 34) .cse1 (<= 34 x)) (and (<= x 47) .cse0 .cse1 (<= 47 x)) (and (<= x 94) (<= 94 y) (<= y 94) (<= 94 x)) (and (<= 67 y) (<= y 67) (<= x 67) (<= 67 x)) (and (<= 56 x) (<= y 56) (<= x 56) (<= 56 y)) (and (<= 61 x) (<= y 61) (<= 61 y) (<= x 61)) (and .cse0 .cse1 (<= x 44) (<= 44 x)) (and .cse0 (<= 40 x) .cse1 (<= x 40)) (and .cse0 .cse1 (<= 45 x) (<= x 45)) (and (<= x 83) (<= y 83) (<= 83 x) (<= 83 y)) (and (<= x 89) (<= 89 y) (<= y 89) (<= 89 x)) (and (<= 100 x) (<= 100 y) (<= y 100)) (and (<= 57 x) (<= x 57) (<= y 57) (<= 57 y)) (and .cse0 .cse1 (<= 24 x) (<= x 24)) (and .cse0 (<= 13 x) .cse1 (<= x 13)) (and (<= 86 x) (<= 86 y) (<= y 86) (<= x 86)) (and .cse0 .cse1 (<= x 30) (<= 30 x)) (and .cse0 .cse1 (<= 6 x) (<= x 6)) (and .cse0 .cse1 (<= x 29) (<= 29 x)) (and .cse0 .cse1 (<= 37 x) (<= x 37)) (and (<= y 90) (<= x 90) (<= 90 y) (<= 90 x)) (and (<= 82 x) (<= y 82) (<= x 82) (<= 82 y)) (and .cse0 .cse1 (<= 41 x) (<= x 41)))) [2018-09-26 08:21:34,699 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 11 26) no Hoare annotation was computed. [2018-09-26 08:21:34,769 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:21:34 BoogieIcfgContainer [2018-09-26 08:21:34,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:21:34,773 INFO L168 Benchmark]: Toolchain (without parser) took 61688.98 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -646.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-09-26 08:21:34,776 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:21:34,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:21:34,780 INFO L168 Benchmark]: Boogie Preprocessor took 25.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:21:34,780 INFO L168 Benchmark]: RCFGBuilder took 254.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:21:34,781 INFO L168 Benchmark]: TraceAbstraction took 61354.16 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -656.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-09-26 08:21:34,785 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.21 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 46.06 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 25.38 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 254.07 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 61354.16 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -656.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 24]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((54 <= x && x <= 54) && 54 <= y) && y <= 54) || (((y <= 50 && 50 <= y) && x <= 17) && 17 <= x)) || (((y <= 50 && x <= 43) && 50 <= y) && 43 <= x)) || (((14 <= x && y <= 50) && 50 <= y) && x <= 14)) || (((y <= 50 && 50 <= y) && 20 <= x) && x <= 20)) || (((y <= 50 && 3 <= x) && 50 <= y) && x <= 3)) || (((y <= 50 && 50 <= y) && x <= 28) && 28 <= x)) || (((93 <= x && x <= 93) && 93 <= y) && y <= 93)) || (((x <= 72 && y <= 72) && 72 <= x) && 72 <= y)) || (((x <= 75 && 75 <= x) && y <= 75) && 75 <= y)) || (((x <= 84 && 84 <= x) && 84 <= y) && y <= 84)) || (((63 <= y && 63 <= x) && y <= 63) && x <= 63)) || (((99 <= x && 99 <= y) && y <= 99) && x <= 99)) || (((80 <= x && y <= 80) && x <= 80) && 80 <= y)) || (((x <= 71 && 71 <= x) && 71 <= y) && y <= 71)) || (((y <= 50 && 50 <= y) && 50 <= x) && x <= 50)) || (((y <= 78 && 78 <= x) && 78 <= y) && x <= 78)) || (((y <= 50 && 50 <= y) && 0 <= x) && x <= 0)) || (((62 <= x && y <= 62) && 62 <= y) && x <= 62)) || (((y <= 50 && 50 <= y) && 10 <= x) && x <= 10)) || (((12 <= x && y <= 50) && 50 <= y) && x <= 12)) || (((y <= 50 && 50 <= y) && x <= 32) && 32 <= x)) || (((y <= 50 && 50 <= y) && 31 <= x) && x <= 31)) || (((68 <= x && 68 <= y) && x <= 68) && y <= 68)) || (((87 <= x && y <= 87) && 87 <= y) && x <= 87)) || (((y <= 50 && 50 <= y) && x <= 19) && 19 <= x)) || (((y <= 50 && 50 <= y) && 42 <= x) && x <= 42)) || (((y <= 65 && 65 <= x) && 65 <= y) && x <= 65)) || (((2 <= x && y <= 50) && 50 <= y) && x <= 2)) || (((y <= 50 && 50 <= y) && x <= 25) && 25 <= x)) || (((y <= 50 && 50 <= y) && x <= 22) && 22 <= x)) || (((y <= 50 && 50 <= y) && x <= 26) && 26 <= x)) || (((y <= 50 && 50 <= y) && x <= 8) && 8 <= x)) || (((y <= 50 && 18 <= x) && 50 <= y) && x <= 18)) || (((y <= 76 && x <= 76) && 76 <= x) && 76 <= y)) || (((y <= 50 && 50 <= y) && 27 <= x) && x <= 27)) || (((9 <= x && y <= 50) && x <= 9) && 50 <= y)) || (((x <= 51 && 51 <= x) && y <= 51) && 51 <= y)) || (((69 <= y && y <= 69) && 69 <= x) && x <= 69)) || (((58 <= y && y <= 58) && x <= 58) && 58 <= x)) || (((x <= 4 && y <= 50) && 50 <= y) && 4 <= x)) || (((y <= 50 && x <= 1) && 50 <= y) && 1 <= x)) || (((y <= 50 && 50 <= y) && 36 <= x) && x <= 36)) || (((y <= 50 && 46 <= x) && 50 <= y) && x <= 46)) || (((52 <= y && 52 <= x) && y <= 52) && x <= 52)) || (((y <= 50 && 50 <= y) && x <= 48) && 48 <= x)) || (((y <= 50 && 50 <= y) && x <= 15) && 15 <= x)) || (((96 <= y && x <= 96) && y <= 96) && 96 <= x)) || (((y <= 91 && 91 <= y) && x <= 91) && 91 <= x)) || (((x <= 98 && y <= 98) && 98 <= y) && 98 <= x)) || (((x <= 95 && 95 <= x) && y <= 95) && 95 <= y)) || (((88 <= x && x <= 88) && y <= 88) && 88 <= y)) || (((x <= 39 && y <= 50) && 50 <= y) && 39 <= x)) || (((x <= 73 && 73 <= x) && y <= 73) && 73 <= y)) || (((x <= 66 && 66 <= y) && y <= 66) && 66 <= x)) || (((77 <= y && y <= 77) && x <= 77) && 77 <= x)) || (((y <= 50 && 50 <= y) && 35 <= x) && x <= 35)) || (((97 <= y && 97 <= x) && x <= 97) && y <= 97)) || (((y <= 50 && x <= 5) && 50 <= y) && 5 <= x)) || (((x <= 59 && 59 <= y) && y <= 59) && 59 <= x)) || (((85 <= x && y <= 85) && 85 <= y) && x <= 85)) || (((53 <= y && x <= 53) && 53 <= x) && y <= 53)) || (((60 <= y && 60 <= x) && x <= 60) && y <= 60)) || (((y <= 50 && 50 <= y) && 38 <= x) && x <= 38)) || (((y <= 50 && x <= 21) && 50 <= y) && 21 <= x)) || (((y <= 50 && 50 <= y) && 23 <= x) && x <= 23)) || (((y <= 50 && 50 <= y) && x <= 33) && 33 <= x)) || (((70 <= x && 70 <= y) && x <= 70) && y <= 70)) || (((64 <= x && y <= 64) && 64 <= y) && x <= 64)) || (((y <= 55 && x <= 55) && 55 <= x) && 55 <= y)) || (((y <= 81 && x <= 81) && 81 <= y) && 81 <= x)) || (((y <= 50 && 50 <= y) && 49 <= x) && x <= 49)) || (((y <= 50 && 50 <= y) && x <= 11) && 11 <= x)) || (((y <= 50 && 50 <= y) && x <= 16) && 16 <= x)) || (((92 <= y && x <= 92) && 92 <= x) && y <= 92)) || (((x <= 74 && 74 <= x) && y <= 74) && 74 <= y)) || (((y <= 50 && 50 <= y) && 7 <= x) && x <= 7)) || (((y <= 79 && 79 <= y) && 79 <= x) && x <= 79)) || (((y <= 50 && x <= 34) && 50 <= y) && 34 <= x)) || (((x <= 47 && y <= 50) && 50 <= y) && 47 <= x)) || (((x <= 94 && 94 <= y) && y <= 94) && 94 <= x)) || (((67 <= y && y <= 67) && x <= 67) && 67 <= x)) || (((56 <= x && y <= 56) && x <= 56) && 56 <= y)) || (((61 <= x && y <= 61) && 61 <= y) && x <= 61)) || (((y <= 50 && 50 <= y) && x <= 44) && 44 <= x)) || (((y <= 50 && 40 <= x) && 50 <= y) && x <= 40)) || (((y <= 50 && 50 <= y) && 45 <= x) && x <= 45)) || (((x <= 83 && y <= 83) && 83 <= x) && 83 <= y)) || (((x <= 89 && 89 <= y) && y <= 89) && 89 <= x)) || ((100 <= x && 100 <= y) && y <= 100)) || (((57 <= x && x <= 57) && y <= 57) && 57 <= y)) || (((y <= 50 && 50 <= y) && 24 <= x) && x <= 24)) || (((y <= 50 && 13 <= x) && 50 <= y) && x <= 13)) || (((86 <= x && 86 <= y) && y <= 86) && x <= 86)) || (((y <= 50 && 50 <= y) && x <= 30) && 30 <= x)) || (((y <= 50 && 50 <= y) && 6 <= x) && x <= 6)) || (((y <= 50 && 50 <= y) && x <= 29) && 29 <= x)) || (((y <= 50 && 50 <= y) && 37 <= x) && x <= 37)) || (((y <= 90 && x <= 90) && 90 <= y) && 90 <= x)) || (((82 <= x && y <= 82) && x <= 82) && 82 <= y)) || (((y <= 50 && 50 <= y) && 41 <= x) && x <= 41) - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: true - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 2 error locations. SAFE Result, 61.2s OverallTime, 103 OverallIterations, 101 TraceHistogramMax, 28.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 506 SDtfs, 152 SDslu, 10713 SDs, 0 SdLazy, 305203 SolverSat, 3749 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5455 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=100, 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.5s AutomataMinimizationTime, 103 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 111 NumberOfFragments, 1335 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 27.8s InterpolantComputationTime, 5562 NumberOfCodeBlocks, 5562 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 5459 ConstructedInterpolants, 0 QuantifiedInterpolants, 2408759 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 103 InterpolantComputations, 1 PerfectInterpolantSequences, 2601/181901 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-21-34-798.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-21-34-798.csv Received shutdown request...