java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/abstractInterpretation/unclassified/Fibonaccinacci_big_incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:14:55,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:14:55,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:14:55,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:14:55,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:14:55,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:14:55,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:14:55,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:14:55,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:14:55,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:14:55,961 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:14:55,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:14:55,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:14:55,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:14:55,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:14:55,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:14:55,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:14:55,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:14:55,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:14:55,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:14:55,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:14:55,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:14:55,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:14:55,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:14:56,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:14:56,001 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:14:56,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:14:56,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:14:56,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:14:56,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:14:56,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:14:56,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:14:56,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:14:56,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:14:56,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:14:56,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:14:56,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:14:56,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:14:56,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:14:56,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:14:56,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:14:56,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:14:56,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:14:56,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:14:56,078 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:14:56,079 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:14:56,080 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/Fibonaccinacci_big_incorrect.bpl [2019-08-05 11:14:56,080 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/Fibonaccinacci_big_incorrect.bpl' [2019-08-05 11:14:56,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:14:56,121 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:14:56,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:56,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:14:56,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:14:56,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Fibonaccinacci_big_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:56,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Fibonaccinacci_big_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:56,158 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:14:56,159 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:14:56,159 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:14:56,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:56,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:14:56,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:14:56,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:14:56,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Fibonaccinacci_big_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:56,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Fibonaccinacci_big_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:56,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Fibonaccinacci_big_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:56,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Fibonaccinacci_big_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:56,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Fibonaccinacci_big_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:56,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Fibonaccinacci_big_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:56,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Fibonaccinacci_big_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... [2019-08-05 11:14:56,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:14:56,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:14:56,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:14:56,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:14:56,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Fibonaccinacci_big_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:14:56,252 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:14:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:14:56,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:14:56,419 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:14:56,419 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:14:56,421 INFO L202 PluginConnector]: Adding new model Fibonaccinacci_big_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:56 BoogieIcfgContainer [2019-08-05 11:14:56,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:14:56,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:14:56,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:14:56,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:14:56,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Fibonaccinacci_big_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:56" (1/2) ... [2019-08-05 11:14:56,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eddc4e0 and model type Fibonaccinacci_big_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:14:56, skipping insertion in model container [2019-08-05 11:14:56,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Fibonaccinacci_big_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:56" (2/2) ... [2019-08-05 11:14:56,432 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonaccinacci_big_incorrect.bpl [2019-08-05 11:14:56,443 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:14:56,452 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:14:56,469 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:14:56,502 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:14:56,502 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:14:56,503 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:14:56,503 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:14:56,503 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:14:56,504 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:14:56,504 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:14:56,504 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:14:56,504 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:14:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:14:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:14:56,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:56,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:14:56,528 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:56,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:56,534 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-08-05 11:14:56,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:56,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:14:56,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:56,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:56,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:14:56,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:14:56,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:14:56,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:56,683 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 11:14:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:56,793 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-08-05 11:14:56,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:14:56,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:14:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:56,818 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:14:56,818 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:14:56,825 INFO L628 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 [2019-08-05 11:14:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:14:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 11:14:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:14:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 11:14:56,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 11:14:56,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:56,906 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 11:14:56,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:14:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 11:14:56,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:14:56,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:56,907 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:14:56,910 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:56,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:56,911 INFO L82 PathProgramCache]: Analyzing trace with hash 28758310, now seen corresponding path program 1 times [2019-08-05 11:14:56,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:56,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:56,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:57,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:57,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:57,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:14:57,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:14:57,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:14:57,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:57,067 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-08-05 11:14:57,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:57,115 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-08-05 11:14:57,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:14:57,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:14:57,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:57,116 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:14:57,117 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:14:57,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:14:57,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 11:14:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:14:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 11:14:57,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 11:14:57,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:57,121 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 11:14:57,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:14:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 11:14:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:14:57,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:57,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:14:57,123 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:57,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:57,123 INFO L82 PathProgramCache]: Analyzing trace with hash 891446088, now seen corresponding path program 1 times [2019-08-05 11:14:57,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:57,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:57,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:57,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:14:57,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:57,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:14:57,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:14:57,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:14:57,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:57,200 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 11:14:57,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:57,279 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-08-05 11:14:57,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:14:57,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 11:14:57,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:57,282 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:14:57,282 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:14:57,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:57,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:14:57,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 11:14:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:14:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-08-05 11:14:57,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2019-08-05 11:14:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:57,285 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-08-05 11:14:57,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:14:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-08-05 11:14:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:14:57,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:57,286 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 11:14:57,287 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:57,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:57,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1980957838, now seen corresponding path program 2 times [2019-08-05 11:14:57,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:57,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:57,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:57,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:57,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:57,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:14:57,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:14:57,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:14:57,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:57,343 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 3 states. [2019-08-05 11:14:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:57,393 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-08-05 11:14:57,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:14:57,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 11:14:57,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:57,394 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:14:57,394 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:14:57,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:14:57,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:14:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:14:57,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-08-05 11:14:57,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2019-08-05 11:14:57,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:57,398 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-08-05 11:14:57,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:14:57,398 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-08-05 11:14:57,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:14:57,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:57,399 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1] [2019-08-05 11:14:57,399 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:57,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:57,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1280089312, now seen corresponding path program 3 times [2019-08-05 11:14:57,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:57,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:57,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:57,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:57,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:57,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:57,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:57,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:57,741 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 8 states. [2019-08-05 11:14:57,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:57,849 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-08-05 11:14:57,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:14:57,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-08-05 11:14:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:57,853 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:14:57,854 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:14:57,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:14:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-08-05 11:14:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:14:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-08-05 11:14:57,859 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 9 [2019-08-05 11:14:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:57,860 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-08-05 11:14:57,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2019-08-05 11:14:57,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:14:57,860 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:57,861 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2019-08-05 11:14:57,861 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:57,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:57,861 INFO L82 PathProgramCache]: Analyzing trace with hash -578925054, now seen corresponding path program 4 times [2019-08-05 11:14:57,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:57,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:14:57,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:58,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:58,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:58,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:58,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:58,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:58,048 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 6 states. [2019-08-05 11:14:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:58,098 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-08-05 11:14:58,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:14:58,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:14:58,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:58,100 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:14:58,100 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:14:58,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:58,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:14:58,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:14:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:14:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-08-05 11:14:58,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2019-08-05 11:14:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:58,104 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-08-05 11:14:58,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:58,104 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-08-05 11:14:58,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:14:58,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:58,105 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2019-08-05 11:14:58,105 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:58,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:58,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1921171744, now seen corresponding path program 5 times [2019-08-05 11:14:58,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:58,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:14:58,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:58,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:58,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:58,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:58,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:58,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:58,329 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-08-05 11:14:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:58,390 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-08-05 11:14:58,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:14:58,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 11:14:58,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:58,391 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:14:58,391 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:14:58,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:14:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:14:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:14:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-08-05 11:14:58,396 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2019-08-05 11:14:58,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:58,396 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-08-05 11:14:58,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-08-05 11:14:58,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:14:58,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:58,397 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1] [2019-08-05 11:14:58,397 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:58,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:58,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2114761154, now seen corresponding path program 6 times [2019-08-05 11:14:58,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:58,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:58,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:58,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:58,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:58,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:58,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:58,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:58,606 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 8 states. [2019-08-05 11:14:58,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:58,693 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-08-05 11:14:58,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:14:58,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 11:14:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:58,694 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:14:58,694 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:14:58,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:14:58,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:14:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:14:58,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-08-05 11:14:58,697 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2019-08-05 11:14:58,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:58,697 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-08-05 11:14:58,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:58,698 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-08-05 11:14:58,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:14:58,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:58,699 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2019-08-05 11:14:58,699 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:58,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:58,699 INFO L82 PathProgramCache]: Analyzing trace with hash -473901728, now seen corresponding path program 7 times [2019-08-05 11:14:58,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:58,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:58,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:59,138 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:59,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:59,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:14:59,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:59,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:59,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:59,140 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 9 states. [2019-08-05 11:14:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:59,188 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-08-05 11:14:59,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:14:59,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-08-05 11:14:59,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:59,189 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:14:59,189 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:14:59,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:59,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:14:59,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:14:59,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:14:59,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-08-05 11:14:59,192 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2019-08-05 11:14:59,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:59,193 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-08-05 11:14:59,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:59,193 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-08-05 11:14:59,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:14:59,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:59,194 INFO L399 BasicCegarLoop]: trace histogram [7, 2, 2, 1, 1, 1] [2019-08-05 11:14:59,194 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:59,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:59,195 INFO L82 PathProgramCache]: Analyzing trace with hash 881927554, now seen corresponding path program 8 times [2019-08-05 11:14:59,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:59,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:14:59,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:14:59,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:59,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:14:59,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:14:59,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:14:59,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:59,392 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 10 states. [2019-08-05 11:14:59,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:59,465 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-08-05 11:14:59,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:14:59,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 11:14:59,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:59,467 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:14:59,467 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:14:59,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:59,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:14:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:14:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:14:59,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-08-05 11:14:59,471 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2019-08-05 11:14:59,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:59,472 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-08-05 11:14:59,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:14:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-08-05 11:14:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:14:59,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:59,473 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2019-08-05 11:14:59,473 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:59,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:59,473 INFO L82 PathProgramCache]: Analyzing trace with hash -37037664, now seen corresponding path program 9 times [2019-08-05 11:14:59,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:59,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:14:59,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:01,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:01,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:15:01,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:15:01,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:15:01,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=133, Unknown=3, NotChecked=0, Total=182 [2019-08-05 11:15:01,496 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 14 states. [2019-08-05 11:15:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:02,267 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-08-05 11:15:02,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:15:02,267 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-08-05 11:15:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:02,268 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:15:02,268 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:15:02,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=117, Invalid=299, Unknown=4, NotChecked=0, Total=420 [2019-08-05 11:15:02,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:15:02,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-08-05 11:15:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:15:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-08-05 11:15:02,272 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 15 [2019-08-05 11:15:02,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:02,273 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-08-05 11:15:02,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:15:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-08-05 11:15:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:15:02,274 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:02,274 INFO L399 BasicCegarLoop]: trace histogram [9, 2, 2, 1, 1, 1] [2019-08-05 11:15:02,274 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:02,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:02,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1539811650, now seen corresponding path program 10 times [2019-08-05 11:15:02,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:02,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:15:02,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:03,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:03,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:15:03,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:15:03,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:15:03,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=154, Unknown=2, NotChecked=0, Total=210 [2019-08-05 11:15:03,813 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 15 states. [2019-08-05 11:15:05,000 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2019-08-05 11:15:05,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:05,013 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-08-05 11:15:05,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:15:05,014 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-08-05 11:15:05,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:05,015 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:15:05,015 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:15:05,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=158, Invalid=391, Unknown=3, NotChecked=0, Total=552 [2019-08-05 11:15:05,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:15:05,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-08-05 11:15:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:15:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-08-05 11:15:05,020 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2019-08-05 11:15:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:05,021 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-08-05 11:15:05,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:15:05,023 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-08-05 11:15:05,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:15:05,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:05,024 INFO L399 BasicCegarLoop]: trace histogram [9, 2, 2, 1, 1, 1] [2019-08-05 11:15:05,026 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:05,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:05,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1148229106, now seen corresponding path program 11 times [2019-08-05 11:15:05,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:05,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:15:05,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:05,225 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-08-05 11:15:05,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:05,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:15:05,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:15:05,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:15:05,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:15:05,228 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 7 states. [2019-08-05 11:15:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:05,305 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2019-08-05 11:15:05,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:15:05,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-08-05 11:15:05,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:05,308 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:15:05,308 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:15:05,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:15:05,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:15:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2019-08-05 11:15:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:15:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-08-05 11:15:05,311 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2019-08-05 11:15:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:05,311 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-08-05 11:15:05,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:15:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-08-05 11:15:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:15:05,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:05,312 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1] [2019-08-05 11:15:05,312 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:05,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:05,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1235425440, now seen corresponding path program 12 times [2019-08-05 11:15:05,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:05,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:15:05,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-08-05 11:15:05,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:05,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:15:05,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:15:05,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:15:05,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:15:05,434 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 8 states. [2019-08-05 11:15:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:05,761 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-08-05 11:15:05,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:15:05,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-08-05 11:15:05,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:05,763 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:15:05,763 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:15:05,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:15:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:15:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-08-05 11:15:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:15:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-08-05 11:15:05,766 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 17 [2019-08-05 11:15:05,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:05,766 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-08-05 11:15:05,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:15:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-08-05 11:15:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:15:05,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:05,767 INFO L399 BasicCegarLoop]: trace histogram [11, 2, 2, 1, 1, 1] [2019-08-05 11:15:05,767 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:05,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:05,768 INFO L82 PathProgramCache]: Analyzing trace with hash 356455502, now seen corresponding path program 13 times [2019-08-05 11:15:05,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:05,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:15:05,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:05,958 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-08-05 11:15:05,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:05,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:15:05,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:15:05,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:15:05,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:15:05,959 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 9 states. [2019-08-05 11:15:06,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:06,341 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-08-05 11:15:06,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:15:06,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 11:15:06,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:06,342 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:15:06,343 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:15:06,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:15:06,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:15:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-08-05 11:15:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:15:06,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-08-05 11:15:06,350 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2019-08-05 11:15:06,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:06,350 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-08-05 11:15:06,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:15:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-08-05 11:15:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:15:06,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:06,351 INFO L399 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1] [2019-08-05 11:15:06,351 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:06,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:06,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1834842848, now seen corresponding path program 14 times [2019-08-05 11:15:06,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:06,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:15:06,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:15:06,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:06,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:15:06,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:15:06,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:15:06,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:15:06,423 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 5 states. [2019-08-05 11:15:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:06,459 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-08-05 11:15:06,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:15:06,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-08-05 11:15:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:06,460 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:15:06,461 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:15:06,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:15:06,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:15:06,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-08-05 11:15:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:15:06,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-08-05 11:15:06,464 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2019-08-05 11:15:06,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:06,464 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-08-05 11:15:06,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:15:06,465 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-08-05 11:15:06,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:15:06,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:06,465 INFO L399 BasicCegarLoop]: trace histogram [13, 3, 3, 1, 1, 1] [2019-08-05 11:15:06,466 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:06,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:06,466 INFO L82 PathProgramCache]: Analyzing trace with hash 237964296, now seen corresponding path program 15 times [2019-08-05 11:15:06,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:06,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:15:06,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 2 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:06,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:06,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:15:06,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:15:06,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:15:06,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:15:06,954 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 20 states. [2019-08-05 11:15:07,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:07,105 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-08-05 11:15:07,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:15:07,105 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 [2019-08-05 11:15:07,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:07,106 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:15:07,107 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:15:07,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:15:07,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:15:07,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-08-05 11:15:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:15:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-08-05 11:15:07,112 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 22 [2019-08-05 11:15:07,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:07,112 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-08-05 11:15:07,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:15:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-08-05 11:15:07,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:15:07,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:07,114 INFO L399 BasicCegarLoop]: trace histogram [14, 3, 3, 1, 1, 1] [2019-08-05 11:15:07,114 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:07,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:07,114 INFO L82 PathProgramCache]: Analyzing trace with hash 209306150, now seen corresponding path program 16 times [2019-08-05 11:15:07,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:07,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:15:07,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-08-05 11:15:07,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:15:07,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-08-05 11:15:07,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:15:07,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:15:07,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:15:07,325 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 11 states. [2019-08-05 11:15:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:07,390 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2019-08-05 11:15:07,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:15:07,391 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-08-05 11:15:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:07,392 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:15:07,392 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:15:07,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:15:07,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:15:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2019-08-05 11:15:07,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:15:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2019-08-05 11:15:07,397 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2019-08-05 11:15:07,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:07,397 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-08-05 11:15:07,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:15:07,398 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2019-08-05 11:15:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:15:07,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:07,399 INFO L399 BasicCegarLoop]: trace histogram [14, 3, 3, 1, 1, 1] [2019-08-05 11:15:07,399 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:07,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:07,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1474937818, now seen corresponding path program 17 times [2019-08-05 11:15:07,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:07,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:15:07,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 2 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:07,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:07,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:15:07,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:15:07,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:15:07,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:15:07,740 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 21 states. [2019-08-05 11:15:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:07,920 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-08-05 11:15:07,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:15:07,921 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2019-08-05 11:15:07,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:07,922 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:15:07,922 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:15:07,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:15:07,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:15:07,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-08-05 11:15:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:15:07,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2019-08-05 11:15:07,927 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2019-08-05 11:15:07,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:07,927 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-08-05 11:15:07,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:15:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2019-08-05 11:15:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:15:07,928 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:07,928 INFO L399 BasicCegarLoop]: trace histogram [14, 3, 3, 1, 1, 1] [2019-08-05 11:15:07,929 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:07,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:07,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1213102938, now seen corresponding path program 18 times [2019-08-05 11:15:07,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:07,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:15:07,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:08,026 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:15:08,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:08,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:15:08,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:15:08,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:15:08,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:15:08,028 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 8 states. [2019-08-05 11:15:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:08,184 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2019-08-05 11:15:08,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:15:08,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-08-05 11:15:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:08,186 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:15:08,186 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:15:08,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:15:08,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:15:08,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2019-08-05 11:15:08,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:15:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-08-05 11:15:08,190 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 23 [2019-08-05 11:15:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:08,191 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-08-05 11:15:08,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:15:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-08-05 11:15:08,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:15:08,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:08,192 INFO L399 BasicCegarLoop]: trace histogram [15, 3, 3, 1, 1, 1] [2019-08-05 11:15:08,192 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1048453064, now seen corresponding path program 19 times [2019-08-05 11:15:08,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:08,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:15:08,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 3 proven. 113 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:15:08,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:08,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:15:08,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:15:08,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:15:08,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:15:08,327 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 9 states. [2019-08-05 11:15:08,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:08,869 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2019-08-05 11:15:08,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:15:08,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-08-05 11:15:08,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:08,870 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:15:08,870 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:15:08,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:15:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:15:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2019-08-05 11:15:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:15:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-08-05 11:15:08,875 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 24 [2019-08-05 11:15:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:08,876 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-08-05 11:15:08,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:15:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-08-05 11:15:08,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:15:08,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:08,877 INFO L399 BasicCegarLoop]: trace histogram [16, 3, 3, 1, 1, 1] [2019-08-05 11:15:08,877 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:08,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:08,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1857754906, now seen corresponding path program 20 times [2019-08-05 11:15:08,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:08,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:15:08,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:08,986 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 3 proven. 131 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 11:15:08,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:08,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:15:08,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:15:08,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:15:08,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:15:08,987 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 10 states. [2019-08-05 11:15:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:09,160 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-08-05 11:15:09,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:15:09,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-08-05 11:15:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:09,164 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:15:09,164 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:15:09,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:15:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:15:09,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-08-05 11:15:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:15:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2019-08-05 11:15:09,167 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 25 [2019-08-05 11:15:09,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:09,168 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-08-05 11:15:09,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:15:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2019-08-05 11:15:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:15:09,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:09,169 INFO L399 BasicCegarLoop]: trace histogram [17, 3, 3, 1, 1, 1] [2019-08-05 11:15:09,169 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:09,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1755888760, now seen corresponding path program 21 times [2019-08-05 11:15:09,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:09,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:15:09,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 88 proven. 64 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-08-05 11:15:09,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:09,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:15:09,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:15:09,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:15:09,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:15:09,537 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 10 states. [2019-08-05 11:15:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:09,659 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2019-08-05 11:15:09,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:15:09,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-08-05 11:15:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:09,660 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:15:09,661 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:15:09,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:15:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:15:09,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:15:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:15:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-08-05 11:15:09,666 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 26 [2019-08-05 11:15:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:09,666 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-08-05 11:15:09,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:15:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-08-05 11:15:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:15:09,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:09,667 INFO L399 BasicCegarLoop]: trace histogram [18, 3, 3, 1, 1, 1] [2019-08-05 11:15:09,667 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:09,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:09,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1838300582, now seen corresponding path program 22 times [2019-08-05 11:15:09,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:09,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:15:09,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:10,028 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:15:10,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:10,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:15:10,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:15:10,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:15:10,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:15:10,030 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 6 states. [2019-08-05 11:15:10,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:10,274 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2019-08-05 11:15:10,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:15:10,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-08-05 11:15:10,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:10,275 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:15:10,275 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:15:10,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:15:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:15:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2019-08-05 11:15:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:15:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2019-08-05 11:15:10,279 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 27 [2019-08-05 11:15:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:10,279 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2019-08-05 11:15:10,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:15:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2019-08-05 11:15:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:15:10,280 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:10,280 INFO L399 BasicCegarLoop]: trace histogram [19, 4, 4, 1, 1, 1] [2019-08-05 11:15:10,281 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:10,281 INFO L82 PathProgramCache]: Analyzing trace with hash 307825806, now seen corresponding path program 23 times [2019-08-05 11:15:10,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:10,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:15:10,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 4 proven. 195 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:15:10,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:10,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:15:10,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:15:10,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:15:10,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:15:10,694 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 8 states. [2019-08-05 11:15:10,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:10,794 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2019-08-05 11:15:10,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:15:10,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-08-05 11:15:10,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:10,796 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:15:10,796 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:15:10,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:15:10,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:15:10,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-08-05 11:15:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:15:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-08-05 11:15:10,800 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 30 [2019-08-05 11:15:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:10,800 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-08-05 11:15:10,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:15:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-08-05 11:15:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:15:10,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:10,801 INFO L399 BasicCegarLoop]: trace histogram [20, 4, 4, 1, 1, 1] [2019-08-05 11:15:10,802 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash 952603872, now seen corresponding path program 24 times [2019-08-05 11:15:10,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:10,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:15:10,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:10,907 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 4 proven. 218 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:15:10,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:10,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:15:10,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:15:10,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:15:10,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:15:10,909 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 9 states. [2019-08-05 11:15:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:11,109 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2019-08-05 11:15:11,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:15:11,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-08-05 11:15:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:11,111 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:15:11,111 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:15:11,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:15:11,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:15:11,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2019-08-05 11:15:11,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:15:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-08-05 11:15:11,115 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 31 [2019-08-05 11:15:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:11,116 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-08-05 11:15:11,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:15:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2019-08-05 11:15:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:15:11,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:11,117 INFO L399 BasicCegarLoop]: trace histogram [21, 4, 4, 1, 1, 1] [2019-08-05 11:15:11,117 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:11,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:11,117 INFO L82 PathProgramCache]: Analyzing trace with hash -534112562, now seen corresponding path program 25 times [2019-08-05 11:15:11,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:11,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:15:11,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:17,986 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:15:19,737 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-08-05 11:15:20,958 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:15:37,176 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 2 proven. 285 refuted. 23 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:37,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:37,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:15:37,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:15:37,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:15:37,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=765, Unknown=46, NotChecked=0, Total=930 [2019-08-05 11:15:37,178 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 31 states. [2019-08-05 11:15:38,488 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 18 [2019-08-05 11:15:40,167 WARN L188 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-08-05 11:15:40,956 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-08-05 11:15:49,658 WARN L188 SmtUtils]: Spent 849.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-08-05 11:16:05,697 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-08-05 11:16:08,432 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-08-05 11:16:12,989 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-08-05 11:16:14,619 WARN L188 SmtUtils]: Spent 651.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-08-05 11:16:18,796 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-08-05 11:16:25,746 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-08-05 11:16:30,508 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-08-05 11:16:33,156 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2019-08-05 11:16:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:33,184 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2019-08-05 11:16:33,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:16:33,184 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 32 [2019-08-05 11:16:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:33,185 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:16:33,186 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:16:33,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 53.6s TimeCoverageRelationStatistics Valid=288, Invalid=2104, Unknown=58, NotChecked=0, Total=2450 [2019-08-05 11:16:33,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:16:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-08-05 11:16:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:16:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-08-05 11:16:33,190 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 32 [2019-08-05 11:16:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:33,190 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-08-05 11:16:33,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:16:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2019-08-05 11:16:33,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:16:33,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:33,191 INFO L399 BasicCegarLoop]: trace histogram [22, 4, 4, 1, 1, 1] [2019-08-05 11:16:33,191 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:33,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:33,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1757851680, now seen corresponding path program 26 times [2019-08-05 11:16:33,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:33,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:16:33,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 95 proven. 3 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-08-05 11:16:33,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:33,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:16:33,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:16:33,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:16:33,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:16:33,305 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 7 states. [2019-08-05 11:16:33,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:33,417 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2019-08-05 11:16:33,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:16:33,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-08-05 11:16:33,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:33,419 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:16:33,419 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:16:33,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:16:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:16:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2019-08-05 11:16:33,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:16:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-08-05 11:16:33,423 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 33 [2019-08-05 11:16:33,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:33,423 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-08-05 11:16:33,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:16:33,423 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-08-05 11:16:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:16:33,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:33,424 INFO L399 BasicCegarLoop]: trace histogram [22, 5, 5, 1, 1, 1] [2019-08-05 11:16:33,424 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:33,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:33,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1098970010, now seen corresponding path program 27 times [2019-08-05 11:16:33,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:33,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:16:33,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:33,864 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 58 proven. 242 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-08-05 11:16:33,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:33,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:16:33,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:16:33,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:16:33,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:16:33,865 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 10 states. [2019-08-05 11:16:34,174 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-08-05 11:16:34,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:34,487 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2019-08-05 11:16:34,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:16:34,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-08-05 11:16:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:34,489 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:16:34,489 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:16:34,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=291, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:16:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:16:34,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2019-08-05 11:16:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:16:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-08-05 11:16:34,494 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 35 [2019-08-05 11:16:34,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:34,494 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-08-05 11:16:34,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:16:34,494 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2019-08-05 11:16:34,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:16:34,495 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:34,495 INFO L399 BasicCegarLoop]: trace histogram [23, 5, 5, 1, 1, 1] [2019-08-05 11:16:34,495 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:34,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:34,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1898656120, now seen corresponding path program 28 times [2019-08-05 11:16:34,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:34,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:16:34,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:40,308 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:17:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 4 proven. 370 refuted. 19 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:09,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:09,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:17:09,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:17:09,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:17:09,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=806, Unknown=41, NotChecked=0, Total=1056 [2019-08-05 11:17:09,366 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 33 states. [2019-08-05 11:17:12,402 WARN L188 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-08-05 11:17:14,524 WARN L188 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-08-05 11:17:20,725 WARN L188 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2019-08-05 11:17:27,501 WARN L188 SmtUtils]: Spent 929.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-08-05 11:17:31,903 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-08-05 11:17:36,713 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-08-05 11:17:37,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:37,788 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2019-08-05 11:17:37,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:17:37,789 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2019-08-05 11:17:37,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:37,789 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:17:37,789 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:17:37,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=467, Invalid=1739, Unknown=50, NotChecked=0, Total=2256 [2019-08-05 11:17:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:17:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-08-05 11:17:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:17:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2019-08-05 11:17:37,793 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 36 [2019-08-05 11:17:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:37,793 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2019-08-05 11:17:37,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:17:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2019-08-05 11:17:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:17:37,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:37,794 INFO L399 BasicCegarLoop]: trace histogram [24, 5, 5, 1, 1, 1] [2019-08-05 11:17:37,794 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:37,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:37,795 INFO L82 PathProgramCache]: Analyzing trace with hash -637505830, now seen corresponding path program 29 times [2019-08-05 11:17:37,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:37,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:17:37,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 100 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:38,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:38,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:17:38,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:17:38,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:17:38,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:17:38,779 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 36 states. [2019-08-05 11:17:42,149 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 36 [2019-08-05 11:17:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:43,028 INFO L93 Difference]: Finished difference Result 159 states and 208 transitions. [2019-08-05 11:17:43,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:17:43,028 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 37 [2019-08-05 11:17:43,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:43,029 INFO L225 Difference]: With dead ends: 159 [2019-08-05 11:17:43,029 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:17:43,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2226 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2064, Invalid=7056, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:17:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:17:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 76. [2019-08-05 11:17:43,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:17:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2019-08-05 11:17:43,035 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 37 [2019-08-05 11:17:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:43,036 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 94 transitions. [2019-08-05 11:17:43,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:17:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2019-08-05 11:17:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:17:43,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:43,037 INFO L399 BasicCegarLoop]: trace histogram [24, 5, 5, 1, 1, 1] [2019-08-05 11:17:43,037 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash -376612466, now seen corresponding path program 30 times [2019-08-05 11:17:43,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:43,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:17:43,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 4 proven. 396 refuted. 21 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:11,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:11,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:18:11,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:18:11,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:18:11,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=774, Unknown=43, NotChecked=0, Total=1056 [2019-08-05 11:18:11,813 INFO L87 Difference]: Start difference. First operand 76 states and 94 transitions. Second operand 33 states. [2019-08-05 11:18:13,613 WARN L188 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 52 DAG size of output: 30 [2019-08-05 11:18:15,664 WARN L188 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2019-08-05 11:18:16,170 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-08-05 11:18:17,247 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2019-08-05 11:18:20,260 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 18 [2019-08-05 11:18:31,641 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-08-05 11:18:41,999 WARN L188 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2019-08-05 11:18:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:42,035 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-08-05 11:18:42,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:18:42,036 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 37 [2019-08-05 11:18:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:42,037 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:18:42,037 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:18:42,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 51.2s TimeCoverageRelationStatistics Valid=528, Invalid=1661, Unknown=67, NotChecked=0, Total=2256 [2019-08-05 11:18:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:18:42,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2019-08-05 11:18:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:18:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2019-08-05 11:18:42,041 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 37 [2019-08-05 11:18:42,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:42,042 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2019-08-05 11:18:42,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:18:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2019-08-05 11:18:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:18:42,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:42,043 INFO L399 BasicCegarLoop]: trace histogram [24, 5, 5, 1, 1, 1] [2019-08-05 11:18:42,043 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:42,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:42,043 INFO L82 PathProgramCache]: Analyzing trace with hash -335785638, now seen corresponding path program 31 times [2019-08-05 11:18:42,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:42,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:18:42,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:45,489 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:18:54,623 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:19:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 3 proven. 401 refuted. 17 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:08,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:08,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:19:08,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:19:08,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:19:08,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1004, Unknown=38, NotChecked=0, Total=1190 [2019-08-05 11:19:08,129 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 35 states. [2019-08-05 11:19:08,987 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2019-08-05 11:19:12,894 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-08-05 11:19:17,089 WARN L188 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-08-05 11:19:17,615 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-08-05 11:19:24,018 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-08-05 11:19:30,865 WARN L188 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 50 DAG size of output: 35 Received shutdown request... [2019-08-05 11:19:39,348 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 41 [2019-08-05 11:19:39,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:19:39,350 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:19:39,355 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:19:39,355 INFO L202 PluginConnector]: Adding new model Fibonaccinacci_big_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:19:39 BoogieIcfgContainer [2019-08-05 11:19:39,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:19:39,357 INFO L168 Benchmark]: Toolchain (without parser) took 283236.22 ms. Allocated memory was 132.6 MB in the beginning and 260.6 MB in the end (delta: 127.9 MB). Free memory was 110.3 MB in the beginning and 152.7 MB in the end (delta: -42.4 MB). Peak memory consumption was 85.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:19:39,357 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory is still 111.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:19:39,358 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.55 ms. Allocated memory is still 132.6 MB. Free memory was 110.3 MB in the beginning and 108.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:19:39,359 INFO L168 Benchmark]: Boogie Preprocessor took 23.09 ms. Allocated memory is still 132.6 MB. Free memory was 108.2 MB in the beginning and 106.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:19:39,359 INFO L168 Benchmark]: RCFGBuilder took 235.43 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 97.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:19:39,360 INFO L168 Benchmark]: TraceAbstraction took 282932.35 ms. Allocated memory was 132.6 MB in the beginning and 260.6 MB in the end (delta: 127.9 MB). Free memory was 97.4 MB in the beginning and 152.7 MB in the end (delta: -55.3 MB). Peak memory consumption was 72.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:19:39,363 INFO L335 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.22 ms. Allocated memory is still 132.6 MB. Free memory is still 111.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.55 ms. Allocated memory is still 132.6 MB. Free memory was 110.3 MB in the beginning and 108.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.09 ms. Allocated memory is still 132.6 MB. Free memory was 108.2 MB in the beginning and 106.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 235.43 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 97.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 282932.35 ms. Allocated memory was 132.6 MB in the beginning and 260.6 MB in the end (delta: 127.9 MB). Free memory was 97.4 MB in the beginning and 152.7 MB in the end (delta: -55.3 MB). Peak memory consumption was 72.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 22]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 22). Cancelled while BasicCegarLoop was constructing difference of abstraction (71states) and FLOYD_HOARE automaton (currently 28 states, 35 states before enhancement),while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 282.8s OverallTime, 33 OverallIterations, 24 TraceHistogramMax, 156.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 112 SDtfs, 177 SDslu, 109 SDs, 0 SdLazy, 2655 SolverSat, 696 SolverUnsat, 87 SolverUnknown, 0 SolverNotchecked, 61.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 889 GetRequests, 309 SyntacticMatches, 2 SemanticMatches, 578 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4659 ImplicationChecksByTransitivity, 218.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=31, 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.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 123 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 125.4s InterpolantComputationTime, 693 NumberOfCodeBlocks, 693 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 660 ConstructedInterpolants, 152 QuantifiedInterpolants, 167258 SizeOfPredicates, 39 NumberOfNonLiveVariables, 3027 ConjunctsInSsa, 530 ConjunctsInUnsatCore, 33 InterpolantComputations, 4 PerfectInterpolantSequences, 1399/5067 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown