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/random/RanFile092.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:02:13,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:02:13,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:02:13,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:02:13,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:02:13,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:02:13,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:02:13,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:02:13,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:02:13,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:02:13,890 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:02:13,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:02:13,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:02:13,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:02:13,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:02:13,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:02:13,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:02:13,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:02:13,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:02:13,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:02:13,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:02:13,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:02:13,919 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:02:13,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:02:13,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:02:13,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:02:13,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:02:13,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:02:13,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:02:13,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:02:13,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:02:13,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:02:13,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:02:13,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:02:13,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:02:13,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:02:13,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:02:13,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:02:13,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:02:13,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:02:13,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:02:13,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:02:13,998 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:02:14,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:02:14,004 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:02:14,005 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:02:14,006 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile092.bpl [2019-08-05 10:02:14,006 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile092.bpl' [2019-08-05 10:02:14,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:02:14,087 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:02:14,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:02:14,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:02:14,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:02:14,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RanFile092.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:14" (1/1) ... [2019-08-05 10:02:14,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RanFile092.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:14" (1/1) ... [2019-08-05 10:02:14,139 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:02:14,140 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:02:14,140 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:02:14,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:02:14,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:02:14,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:02:14,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:02:14,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RanFile092.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:14" (1/1) ... [2019-08-05 10:02:14,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RanFile092.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:14" (1/1) ... [2019-08-05 10:02:14,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RanFile092.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:14" (1/1) ... [2019-08-05 10:02:14,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RanFile092.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:14" (1/1) ... [2019-08-05 10:02:14,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RanFile092.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:14" (1/1) ... [2019-08-05 10:02:14,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RanFile092.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:14" (1/1) ... [2019-08-05 10:02:14,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RanFile092.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:14" (1/1) ... [2019-08-05 10:02:14,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:02:14,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:02:14,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:02:14,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:02:14,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RanFile092.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:14" (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 10:02:14,288 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:02:14,288 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:02:14,289 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:02:16,315 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:02:16,315 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:02:16,317 INFO L202 PluginConnector]: Adding new model RanFile092.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:02:16 BoogieIcfgContainer [2019-08-05 10:02:16,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:02:16,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:02:16,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:02:16,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:02:16,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile092.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:02:14" (1/2) ... [2019-08-05 10:02:16,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e3355d and model type RanFile092.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:02:16, skipping insertion in model container [2019-08-05 10:02:16,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile092.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:02:16" (2/2) ... [2019-08-05 10:02:16,326 INFO L109 eAbstractionObserver]: Analyzing ICFG RanFile092.bpl [2019-08-05 10:02:16,336 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:02:16,347 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:02:16,364 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:02:16,392 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:02:16,394 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:02:16,394 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:02:16,394 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:02:16,394 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:02:16,395 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:02:16,395 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:02:16,396 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:02:16,396 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:02:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-08-05 10:02:16,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:02:16,433 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:16,435 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:16,439 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:16,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:16,447 INFO L82 PathProgramCache]: Analyzing trace with hash -975783655, now seen corresponding path program 1 times [2019-08-05 10:02:16,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:16,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:02:16,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:17,396 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 10:02:17,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:17,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:02:17,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:02:17,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:02:17,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:02:17,418 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 9 states. [2019-08-05 10:02:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:18,705 INFO L93 Difference]: Finished difference Result 81 states and 141 transitions. [2019-08-05 10:02:18,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:02:18,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-08-05 10:02:18,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:18,728 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:02:18,728 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:02:18,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:02:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:02:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2019-08-05 10:02:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:02:18,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 122 transitions. [2019-08-05 10:02:18,772 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 122 transitions. Word has length 17 [2019-08-05 10:02:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:18,772 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 122 transitions. [2019-08-05 10:02:18,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:02:18,773 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 122 transitions. [2019-08-05 10:02:18,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:02:18,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:18,774 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:18,775 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:18,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:18,778 INFO L82 PathProgramCache]: Analyzing trace with hash -351986525, now seen corresponding path program 1 times [2019-08-05 10:02:18,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:18,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:02:18,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:02:19,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:19,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:02:19,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:02:19,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:02:19,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:02:19,063 INFO L87 Difference]: Start difference. First operand 70 states and 122 transitions. Second operand 5 states. [2019-08-05 10:02:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:23,018 INFO L93 Difference]: Finished difference Result 145 states and 245 transitions. [2019-08-05 10:02:23,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:02:23,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-08-05 10:02:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:23,021 INFO L225 Difference]: With dead ends: 145 [2019-08-05 10:02:23,021 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 10:02:23,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:02:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 10:02:23,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 104. [2019-08-05 10:02:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:02:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 181 transitions. [2019-08-05 10:02:23,037 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 181 transitions. Word has length 18 [2019-08-05 10:02:23,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:23,040 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 181 transitions. [2019-08-05 10:02:23,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:02:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 181 transitions. [2019-08-05 10:02:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:02:23,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:23,043 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:23,043 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:23,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:23,043 INFO L82 PathProgramCache]: Analyzing trace with hash 800785512, now seen corresponding path program 1 times [2019-08-05 10:02:23,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:23,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:02:23,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:02:23,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:23,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-08-05 10:02:23,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:02:23,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:02:23,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:02:23,976 INFO L87 Difference]: Start difference. First operand 104 states and 181 transitions. Second operand 12 states. [2019-08-05 10:02:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:29,542 INFO L93 Difference]: Finished difference Result 136 states and 230 transitions. [2019-08-05 10:02:29,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:02:29,544 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-08-05 10:02:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:29,546 INFO L225 Difference]: With dead ends: 136 [2019-08-05 10:02:29,547 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:02:29,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:02:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:02:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2019-08-05 10:02:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:02:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 227 transitions. [2019-08-05 10:02:29,559 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 227 transitions. Word has length 19 [2019-08-05 10:02:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:29,560 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 227 transitions. [2019-08-05 10:02:29,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:02:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 227 transitions. [2019-08-05 10:02:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:02:29,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:29,562 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:29,562 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:29,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:29,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2086467716, now seen corresponding path program 1 times [2019-08-05 10:02:29,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:29,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:02:29,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:02:29,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:29,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:02:29,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:02:29,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:02:29,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:02:29,616 INFO L87 Difference]: Start difference. First operand 133 states and 227 transitions. Second operand 3 states. [2019-08-05 10:02:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:29,821 INFO L93 Difference]: Finished difference Result 165 states and 282 transitions. [2019-08-05 10:02:29,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:02:29,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-08-05 10:02:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:29,827 INFO L225 Difference]: With dead ends: 165 [2019-08-05 10:02:29,828 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 10:02:29,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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 10:02:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 10:02:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 134. [2019-08-05 10:02:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 10:02:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 227 transitions. [2019-08-05 10:02:29,847 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 227 transitions. Word has length 19 [2019-08-05 10:02:29,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:29,847 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 227 transitions. [2019-08-05 10:02:29,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:02:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 227 transitions. [2019-08-05 10:02:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:02:29,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:29,850 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:29,850 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:29,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:29,850 INFO L82 PathProgramCache]: Analyzing trace with hash -211025599, now seen corresponding path program 1 times [2019-08-05 10:02:29,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:29,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:02:29,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:02:29,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:29,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:02:29,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:02:29,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:02:29,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:02:29,917 INFO L87 Difference]: Start difference. First operand 134 states and 227 transitions. Second operand 4 states. [2019-08-05 10:02:30,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:30,123 INFO L93 Difference]: Finished difference Result 149 states and 249 transitions. [2019-08-05 10:02:30,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:02:30,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-08-05 10:02:30,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:30,125 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:02:30,125 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:02:30,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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 10:02:30,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:02:30,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 136. [2019-08-05 10:02:30,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 10:02:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 228 transitions. [2019-08-05 10:02:30,136 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 228 transitions. Word has length 19 [2019-08-05 10:02:30,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:30,139 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 228 transitions. [2019-08-05 10:02:30,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:02:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 228 transitions. [2019-08-05 10:02:30,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:02:30,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:30,142 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:30,142 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:30,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:30,143 INFO L82 PathProgramCache]: Analyzing trace with hash -741401714, now seen corresponding path program 1 times [2019-08-05 10:02:30,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:30,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:02:30,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:30,190 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 10:02:30,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:30,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:02:30,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:02:30,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:02:30,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:02:30,192 INFO L87 Difference]: Start difference. First operand 136 states and 228 transitions. Second operand 4 states. [2019-08-05 10:02:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:30,573 INFO L93 Difference]: Finished difference Result 190 states and 315 transitions. [2019-08-05 10:02:30,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:02:30,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-08-05 10:02:30,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:30,576 INFO L225 Difference]: With dead ends: 190 [2019-08-05 10:02:30,576 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 10:02:30,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:02:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 10:02:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 179. [2019-08-05 10:02:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-08-05 10:02:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 301 transitions. [2019-08-05 10:02:30,587 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 301 transitions. Word has length 20 [2019-08-05 10:02:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:30,587 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 301 transitions. [2019-08-05 10:02:30,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:02:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 301 transitions. [2019-08-05 10:02:30,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:02:30,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:30,590 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:30,590 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:30,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:30,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1409433901, now seen corresponding path program 1 times [2019-08-05 10:02:30,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:30,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:02:30,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:30,694 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 10:02:30,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:30,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:02:30,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:02:30,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:02:30,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:02:30,696 INFO L87 Difference]: Start difference. First operand 179 states and 301 transitions. Second operand 5 states. [2019-08-05 10:02:31,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:31,008 INFO L93 Difference]: Finished difference Result 193 states and 318 transitions. [2019-08-05 10:02:31,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:02:31,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-08-05 10:02:31,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:31,011 INFO L225 Difference]: With dead ends: 193 [2019-08-05 10:02:31,011 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 10:02:31,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:02:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 10:02:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 177. [2019-08-05 10:02:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-08-05 10:02:31,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 295 transitions. [2019-08-05 10:02:31,020 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 295 transitions. Word has length 20 [2019-08-05 10:02:31,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:31,020 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 295 transitions. [2019-08-05 10:02:31,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:02:31,020 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 295 transitions. [2019-08-05 10:02:31,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:02:31,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:31,022 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:31,022 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:31,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:31,023 INFO L82 PathProgramCache]: Analyzing trace with hash 405244087, now seen corresponding path program 1 times [2019-08-05 10:02:31,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:31,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:02:31,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:02:31,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:31,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:02:31,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:02:31,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:02:31,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:02:31,095 INFO L87 Difference]: Start difference. First operand 177 states and 295 transitions. Second operand 3 states. [2019-08-05 10:02:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:31,311 INFO L93 Difference]: Finished difference Result 161 states and 265 transitions. [2019-08-05 10:02:31,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:02:31,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-08-05 10:02:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:31,314 INFO L225 Difference]: With dead ends: 161 [2019-08-05 10:02:31,314 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:02:31,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 10:02:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:02:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2019-08-05 10:02:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:02:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 238 transitions. [2019-08-05 10:02:31,324 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 238 transitions. Word has length 20 [2019-08-05 10:02:31,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:31,324 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 238 transitions. [2019-08-05 10:02:31,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:02:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 238 transitions. [2019-08-05 10:02:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:02:31,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:31,328 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:31,328 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:31,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:31,329 INFO L82 PathProgramCache]: Analyzing trace with hash 2120150923, now seen corresponding path program 1 times [2019-08-05 10:02:31,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:31,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:02:31,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:32,103 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-08-05 10:02:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:02:32,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:32,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-08-05 10:02:32,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:02:32,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:02:32,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:02:32,239 INFO L87 Difference]: Start difference. First operand 143 states and 238 transitions. Second operand 13 states. [2019-08-05 10:02:37,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:37,314 INFO L93 Difference]: Finished difference Result 171 states and 277 transitions. [2019-08-05 10:02:37,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:02:37,315 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-08-05 10:02:37,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:37,317 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:02:37,318 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 10:02:37,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:02:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 10:02:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 146. [2019-08-05 10:02:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 10:02:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 242 transitions. [2019-08-05 10:02:37,323 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 242 transitions. Word has length 21 [2019-08-05 10:02:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:37,323 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 242 transitions. [2019-08-05 10:02:37,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:02:37,324 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 242 transitions. [2019-08-05 10:02:37,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:02:37,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:37,325 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:37,325 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:37,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:37,326 INFO L82 PathProgramCache]: Analyzing trace with hash -421313603, now seen corresponding path program 1 times [2019-08-05 10:02:37,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:37,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:02:37,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:02:37,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:37,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:02:37,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:02:37,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:02:37,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:02:37,448 INFO L87 Difference]: Start difference. First operand 146 states and 242 transitions. Second operand 3 states. [2019-08-05 10:02:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:37,611 INFO L93 Difference]: Finished difference Result 155 states and 256 transitions. [2019-08-05 10:02:37,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:02:37,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-08-05 10:02:37,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:37,614 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:02:37,614 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 10:02:37,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:02:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 10:02:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-08-05 10:02:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 10:02:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 251 transitions. [2019-08-05 10:02:37,619 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 251 transitions. Word has length 21 [2019-08-05 10:02:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:37,620 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 251 transitions. [2019-08-05 10:02:37,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:02:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 251 transitions. [2019-08-05 10:02:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:02:37,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:37,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:37,621 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:37,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:37,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1524591676, now seen corresponding path program 1 times [2019-08-05 10:02:37,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:37,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:02:37,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:02:37,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:37,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:02:37,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:02:37,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:02:37,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:02:37,725 INFO L87 Difference]: Start difference. First operand 152 states and 251 transitions. Second operand 7 states. [2019-08-05 10:02:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:38,688 INFO L93 Difference]: Finished difference Result 275 states and 445 transitions. [2019-08-05 10:02:38,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:02:38,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-08-05 10:02:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:38,692 INFO L225 Difference]: With dead ends: 275 [2019-08-05 10:02:38,692 INFO L226 Difference]: Without dead ends: 275 [2019-08-05 10:02:38,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:02:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-08-05 10:02:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 176. [2019-08-05 10:02:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 10:02:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 297 transitions. [2019-08-05 10:02:38,699 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 297 transitions. Word has length 21 [2019-08-05 10:02:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:38,700 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 297 transitions. [2019-08-05 10:02:38,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:02:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 297 transitions. [2019-08-05 10:02:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:02:38,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:38,701 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:38,701 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:38,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:38,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2102343433, now seen corresponding path program 1 times [2019-08-05 10:02:38,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:38,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:02:38,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:02:38,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:38,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:02:38,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:02:38,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:02:38,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:02:38,796 INFO L87 Difference]: Start difference. First operand 176 states and 297 transitions. Second operand 6 states. [2019-08-05 10:02:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:39,273 INFO L93 Difference]: Finished difference Result 266 states and 450 transitions. [2019-08-05 10:02:39,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:02:39,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-08-05 10:02:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:39,277 INFO L225 Difference]: With dead ends: 266 [2019-08-05 10:02:39,277 INFO L226 Difference]: Without dead ends: 266 [2019-08-05 10:02:39,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:02:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-08-05 10:02:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 200. [2019-08-05 10:02:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 10:02:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 340 transitions. [2019-08-05 10:02:39,284 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 340 transitions. Word has length 21 [2019-08-05 10:02:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:39,284 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 340 transitions. [2019-08-05 10:02:39,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:02:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 340 transitions. [2019-08-05 10:02:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:02:39,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:39,286 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:39,286 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:39,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:39,287 INFO L82 PathProgramCache]: Analyzing trace with hash 749833023, now seen corresponding path program 1 times [2019-08-05 10:02:39,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:39,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:02:39,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:39,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:02:39,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:39,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:02:39,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:02:39,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:02:39,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:02:39,342 INFO L87 Difference]: Start difference. First operand 200 states and 340 transitions. Second operand 4 states. [2019-08-05 10:02:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:39,506 INFO L93 Difference]: Finished difference Result 209 states and 353 transitions. [2019-08-05 10:02:39,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:02:39,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-08-05 10:02:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:39,509 INFO L225 Difference]: With dead ends: 209 [2019-08-05 10:02:39,509 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 10:02:39,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:02:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 10:02:39,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 165. [2019-08-05 10:02:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 10:02:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 275 transitions. [2019-08-05 10:02:39,514 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 275 transitions. Word has length 22 [2019-08-05 10:02:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:39,515 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 275 transitions. [2019-08-05 10:02:39,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:02:39,515 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 275 transitions. [2019-08-05 10:02:39,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:02:39,516 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:39,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:39,516 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:39,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:39,516 INFO L82 PathProgramCache]: Analyzing trace with hash -17701261, now seen corresponding path program 1 times [2019-08-05 10:02:39,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:39,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:02:39,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:39,568 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 10:02:39,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:02:39,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:02:39,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:02:39,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:02:39,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:02:39,570 INFO L87 Difference]: Start difference. First operand 165 states and 275 transitions. Second operand 4 states. [2019-08-05 10:02:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:40,033 INFO L93 Difference]: Finished difference Result 171 states and 281 transitions. [2019-08-05 10:02:40,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:02:40,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-08-05 10:02:40,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:40,035 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:02:40,036 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 10:02:40,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:02:40,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 10:02:40,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2019-08-05 10:02:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-08-05 10:02:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 277 transitions. [2019-08-05 10:02:40,041 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 277 transitions. Word has length 22 [2019-08-05 10:02:40,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:40,041 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 277 transitions. [2019-08-05 10:02:40,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:02:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 277 transitions. [2019-08-05 10:02:40,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:02:40,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:40,042 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:40,043 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:40,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:40,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1227521538, now seen corresponding path program 1 times [2019-08-05 10:02:40,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:40,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:02:40,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:41,400 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 10:02:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:02:41,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:02:41,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:02:41,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:02:41,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:02:41,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:02:41,406 INFO L87 Difference]: Start difference. First operand 167 states and 277 transitions. Second operand 9 states. [2019-08-05 10:02:43,188 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-08-05 10:02:43,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:43,422 INFO L93 Difference]: Finished difference Result 238 states and 382 transitions. [2019-08-05 10:02:43,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:02:43,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-08-05 10:02:43,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:43,425 INFO L225 Difference]: With dead ends: 238 [2019-08-05 10:02:43,425 INFO L226 Difference]: Without dead ends: 238 [2019-08-05 10:02:43,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:02:43,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-08-05 10:02:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 198. [2019-08-05 10:02:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-08-05 10:02:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 327 transitions. [2019-08-05 10:02:43,432 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 327 transitions. Word has length 22 [2019-08-05 10:02:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:43,432 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 327 transitions. [2019-08-05 10:02:43,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:02:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 327 transitions. [2019-08-05 10:02:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:02:43,433 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:43,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:43,434 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:43,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:43,434 INFO L82 PathProgramCache]: Analyzing trace with hash -389384780, now seen corresponding path program 1 times [2019-08-05 10:02:43,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:43,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:02:43,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:43,767 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 10:02:43,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:02:43,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:02:43,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:02:43,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:02:43,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:02:43,768 INFO L87 Difference]: Start difference. First operand 198 states and 327 transitions. Second operand 10 states. [2019-08-05 10:02:44,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:44,410 INFO L93 Difference]: Finished difference Result 239 states and 389 transitions. [2019-08-05 10:02:44,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:02:44,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-08-05 10:02:44,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:44,413 INFO L225 Difference]: With dead ends: 239 [2019-08-05 10:02:44,413 INFO L226 Difference]: Without dead ends: 239 [2019-08-05 10:02:44,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:02:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-08-05 10:02:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 212. [2019-08-05 10:02:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 10:02:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 352 transitions. [2019-08-05 10:02:44,421 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 352 transitions. Word has length 22 [2019-08-05 10:02:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:44,421 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 352 transitions. [2019-08-05 10:02:44,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:02:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 352 transitions. [2019-08-05 10:02:44,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:02:44,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:44,422 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:44,423 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:44,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:44,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1550798039, now seen corresponding path program 1 times [2019-08-05 10:02:44,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:44,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:02:44,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:02:44,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:44,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:02:44,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:02:44,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:02:44,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:02:44,525 INFO L87 Difference]: Start difference. First operand 212 states and 352 transitions. Second operand 7 states. [2019-08-05 10:02:44,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:44,925 INFO L93 Difference]: Finished difference Result 190 states and 319 transitions. [2019-08-05 10:02:44,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:02:44,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-08-05 10:02:44,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:44,928 INFO L225 Difference]: With dead ends: 190 [2019-08-05 10:02:44,928 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 10:02:44,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:02:44,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 10:02:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-08-05 10:02:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-08-05 10:02:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 312 transitions. [2019-08-05 10:02:44,933 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 312 transitions. Word has length 23 [2019-08-05 10:02:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:44,933 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 312 transitions. [2019-08-05 10:02:44,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:02:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 312 transitions. [2019-08-05 10:02:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:02:44,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:44,934 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:44,935 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1482834641, now seen corresponding path program 1 times [2019-08-05 10:02:44,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:44,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:02:44,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:45,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:02:45,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:45,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:02:45,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:02:45,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:02:45,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:02:45,424 INFO L87 Difference]: Start difference. First operand 185 states and 312 transitions. Second operand 7 states. [2019-08-05 10:02:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:45,829 INFO L93 Difference]: Finished difference Result 187 states and 315 transitions. [2019-08-05 10:02:45,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:02:45,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-08-05 10:02:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:45,831 INFO L225 Difference]: With dead ends: 187 [2019-08-05 10:02:45,831 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 10:02:45,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:02:45,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 10:02:45,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-08-05 10:02:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 10:02:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 313 transitions. [2019-08-05 10:02:45,835 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 313 transitions. Word has length 23 [2019-08-05 10:02:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:45,835 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 313 transitions. [2019-08-05 10:02:45,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:02:45,835 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 313 transitions. [2019-08-05 10:02:45,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:02:45,836 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:45,836 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:45,836 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:45,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:45,837 INFO L82 PathProgramCache]: Analyzing trace with hash 815667175, now seen corresponding path program 1 times [2019-08-05 10:02:45,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:45,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:02:45,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:45,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:02:45,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:45,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:02:45,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:02:45,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:02:45,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:02:45,992 INFO L87 Difference]: Start difference. First operand 186 states and 313 transitions. Second operand 4 states. [2019-08-05 10:02:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:46,376 INFO L93 Difference]: Finished difference Result 240 states and 396 transitions. [2019-08-05 10:02:46,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:02:46,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-08-05 10:02:46,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:46,383 INFO L225 Difference]: With dead ends: 240 [2019-08-05 10:02:46,383 INFO L226 Difference]: Without dead ends: 240 [2019-08-05 10:02:46,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:02:46,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-08-05 10:02:46,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 197. [2019-08-05 10:02:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-08-05 10:02:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 333 transitions. [2019-08-05 10:02:46,392 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 333 transitions. Word has length 23 [2019-08-05 10:02:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:46,393 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 333 transitions. [2019-08-05 10:02:46,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:02:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 333 transitions. [2019-08-05 10:02:46,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:02:46,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:46,394 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:46,394 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:46,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:46,395 INFO L82 PathProgramCache]: Analyzing trace with hash 813974147, now seen corresponding path program 1 times [2019-08-05 10:02:46,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:46,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:02:46,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:02:46,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:46,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:02:46,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:02:46,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:02:46,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:02:46,529 INFO L87 Difference]: Start difference. First operand 197 states and 333 transitions. Second operand 6 states. [2019-08-05 10:02:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:46,876 INFO L93 Difference]: Finished difference Result 227 states and 387 transitions. [2019-08-05 10:02:46,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:02:46,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-08-05 10:02:46,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:46,879 INFO L225 Difference]: With dead ends: 227 [2019-08-05 10:02:46,879 INFO L226 Difference]: Without dead ends: 227 [2019-08-05 10:02:46,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:02:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-08-05 10:02:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 195. [2019-08-05 10:02:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-08-05 10:02:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 329 transitions. [2019-08-05 10:02:46,884 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 329 transitions. Word has length 23 [2019-08-05 10:02:46,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:46,885 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 329 transitions. [2019-08-05 10:02:46,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:02:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 329 transitions. [2019-08-05 10:02:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:02:46,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:46,886 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:46,886 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:46,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:46,886 INFO L82 PathProgramCache]: Analyzing trace with hash -799214078, now seen corresponding path program 1 times [2019-08-05 10:02:46,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:46,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:02:46,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:02:46,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:02:46,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:02:46,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:02:46,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:02:46,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:02:46,938 INFO L87 Difference]: Start difference. First operand 195 states and 329 transitions. Second operand 3 states. [2019-08-05 10:02:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:02:47,051 INFO L93 Difference]: Finished difference Result 252 states and 420 transitions. [2019-08-05 10:02:47,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:02:47,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-08-05 10:02:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:02:47,054 INFO L225 Difference]: With dead ends: 252 [2019-08-05 10:02:47,054 INFO L226 Difference]: Without dead ends: 252 [2019-08-05 10:02:47,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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 10:02:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-08-05 10:02:47,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 238. [2019-08-05 10:02:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-08-05 10:02:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 398 transitions. [2019-08-05 10:02:47,059 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 398 transitions. Word has length 24 [2019-08-05 10:02:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:02:47,059 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 398 transitions. [2019-08-05 10:02:47,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:02:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 398 transitions. [2019-08-05 10:02:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:02:47,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:02:47,061 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:02:47,061 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:02:47,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:02:47,061 INFO L82 PathProgramCache]: Analyzing trace with hash -199008031, now seen corresponding path program 1 times [2019-08-05 10:02:47,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:02:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:02:47,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:02:47,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:02:48,350 WARN L188 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 10:02:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:02:48,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:02:48,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:02:48,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:02:48,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:02:48,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:02:48,473 INFO L87 Difference]: Start difference. First operand 238 states and 398 transitions. Second operand 10 states. [2019-08-05 10:03:08,372 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-08-05 10:03:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:09,674 INFO L93 Difference]: Finished difference Result 329 states and 562 transitions. [2019-08-05 10:03:09,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:03:09,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-08-05 10:03:09,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:09,683 INFO L225 Difference]: With dead ends: 329 [2019-08-05 10:03:09,683 INFO L226 Difference]: Without dead ends: 329 [2019-08-05 10:03:09,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=68, Invalid=271, Unknown=3, NotChecked=0, Total=342 [2019-08-05 10:03:09,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-08-05 10:03:09,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 262. [2019-08-05 10:03:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-08-05 10:03:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 443 transitions. [2019-08-05 10:03:09,689 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 443 transitions. Word has length 24 [2019-08-05 10:03:09,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:09,690 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 443 transitions. [2019-08-05 10:03:09,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:03:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 443 transitions. [2019-08-05 10:03:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:03:09,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:09,691 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:09,691 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:09,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:09,691 INFO L82 PathProgramCache]: Analyzing trace with hash 639128727, now seen corresponding path program 1 times [2019-08-05 10:03:09,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:09,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:03:09,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:03:13,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:13,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:03:13,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:03:13,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:03:13,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=105, Unknown=3, NotChecked=0, Total=132 [2019-08-05 10:03:13,475 INFO L87 Difference]: Start difference. First operand 262 states and 443 transitions. Second operand 12 states. [2019-08-05 10:03:16,780 WARN L188 SmtUtils]: Spent 1.65 s on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 10:03:20,803 WARN L188 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-08-05 10:03:22,143 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 29 [2019-08-05 10:03:27,554 WARN L188 SmtUtils]: Spent 1.70 s on a formula simplification that was a NOOP. DAG size: 38 [2019-08-05 10:04:06,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:06,512 INFO L93 Difference]: Finished difference Result 341 states and 566 transitions. [2019-08-05 10:04:06,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:04:06,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-08-05 10:04:06,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:06,520 INFO L225 Difference]: With dead ends: 341 [2019-08-05 10:04:06,520 INFO L226 Difference]: Without dead ends: 341 [2019-08-05 10:04:06,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=123, Invalid=519, Unknown=8, NotChecked=0, Total=650 [2019-08-05 10:04:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-08-05 10:04:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 262. [2019-08-05 10:04:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-08-05 10:04:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 443 transitions. [2019-08-05 10:04:06,527 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 443 transitions. Word has length 24 [2019-08-05 10:04:06,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:06,527 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 443 transitions. [2019-08-05 10:04:06,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:04:06,527 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 443 transitions. [2019-08-05 10:04:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:04:06,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:06,528 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:06,528 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:06,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:06,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1329031182, now seen corresponding path program 1 times [2019-08-05 10:04:06,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:06,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:04:06,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:06,587 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 10:04:06,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:06,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:04:06,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:04:06,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:04:06,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:06,589 INFO L87 Difference]: Start difference. First operand 262 states and 443 transitions. Second operand 7 states. [2019-08-05 10:04:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:07,028 INFO L93 Difference]: Finished difference Result 305 states and 515 transitions. [2019-08-05 10:04:07,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:07,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-08-05 10:04:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:07,031 INFO L225 Difference]: With dead ends: 305 [2019-08-05 10:04:07,031 INFO L226 Difference]: Without dead ends: 305 [2019-08-05 10:04:07,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-08-05 10:04:07,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 289. [2019-08-05 10:04:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-08-05 10:04:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 490 transitions. [2019-08-05 10:04:07,037 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 490 transitions. Word has length 24 [2019-08-05 10:04:07,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:07,037 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 490 transitions. [2019-08-05 10:04:07,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:04:07,037 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 490 transitions. [2019-08-05 10:04:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:04:07,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:07,038 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:07,039 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:07,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:07,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1895439244, now seen corresponding path program 1 times [2019-08-05 10:04:07,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:07,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:07,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:07,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:07,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:07,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:07,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:07,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:07,099 INFO L87 Difference]: Start difference. First operand 289 states and 490 transitions. Second operand 3 states. [2019-08-05 10:04:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:08,105 INFO L93 Difference]: Finished difference Result 302 states and 509 transitions. [2019-08-05 10:04:08,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:08,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-08-05 10:04:08,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:08,108 INFO L225 Difference]: With dead ends: 302 [2019-08-05 10:04:08,108 INFO L226 Difference]: Without dead ends: 286 [2019-08-05 10:04:08,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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 10:04:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-08-05 10:04:08,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 249. [2019-08-05 10:04:08,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-08-05 10:04:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 423 transitions. [2019-08-05 10:04:08,112 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 423 transitions. Word has length 25 [2019-08-05 10:04:08,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:08,113 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 423 transitions. [2019-08-05 10:04:08,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:08,113 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 423 transitions. [2019-08-05 10:04:08,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:04:08,114 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:08,114 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:08,114 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:08,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:08,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1661845504, now seen corresponding path program 1 times [2019-08-05 10:04:08,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:08,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:04:08,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:08,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:08,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:04:08,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:08,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:08,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:08,243 INFO L87 Difference]: Start difference. First operand 249 states and 423 transitions. Second operand 8 states. [2019-08-05 10:04:08,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:08,706 INFO L93 Difference]: Finished difference Result 236 states and 395 transitions. [2019-08-05 10:04:08,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:08,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-08-05 10:04:08,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:08,709 INFO L225 Difference]: With dead ends: 236 [2019-08-05 10:04:08,709 INFO L226 Difference]: Without dead ends: 234 [2019-08-05 10:04:08,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:08,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-08-05 10:04:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 216. [2019-08-05 10:04:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-08-05 10:04:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 362 transitions. [2019-08-05 10:04:08,714 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 362 transitions. Word has length 25 [2019-08-05 10:04:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:08,714 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 362 transitions. [2019-08-05 10:04:08,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 362 transitions. [2019-08-05 10:04:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:04:08,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:08,715 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:08,716 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:08,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:08,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1749705879, now seen corresponding path program 1 times [2019-08-05 10:04:08,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:08,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:04:08,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:08,967 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 10:04:09,235 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 10:04:09,595 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-08-05 10:04:09,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:09,719 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 10:04:09,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:09,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:04:09,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:04:09,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:04:09,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:09,720 INFO L87 Difference]: Start difference. First operand 216 states and 362 transitions. Second operand 11 states. [2019-08-05 10:04:10,275 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-08-05 10:04:13,353 WARN L188 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-08-05 10:04:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:14,806 INFO L93 Difference]: Finished difference Result 229 states and 380 transitions. [2019-08-05 10:04:14,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:04:14,806 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-08-05 10:04:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:14,808 INFO L225 Difference]: With dead ends: 229 [2019-08-05 10:04:14,808 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 10:04:14,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:04:14,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 10:04:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-08-05 10:04:14,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-08-05 10:04:14,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 358 transitions. [2019-08-05 10:04:14,813 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 358 transitions. Word has length 25 [2019-08-05 10:04:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:14,813 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 358 transitions. [2019-08-05 10:04:14,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:04:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 358 transitions. [2019-08-05 10:04:14,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:04:14,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:14,814 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:14,815 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:14,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:14,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2004305955, now seen corresponding path program 1 times [2019-08-05 10:04:14,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:14,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:04:14,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:14,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:15,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:15,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:15,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:04:15,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:15,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:15,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:15,100 INFO L87 Difference]: Start difference. First operand 214 states and 358 transitions. Second operand 9 states. [2019-08-05 10:04:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:17,242 INFO L93 Difference]: Finished difference Result 232 states and 383 transitions. [2019-08-05 10:04:17,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:17,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-08-05 10:04:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:17,244 INFO L225 Difference]: With dead ends: 232 [2019-08-05 10:04:17,244 INFO L226 Difference]: Without dead ends: 230 [2019-08-05 10:04:17,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:17,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-08-05 10:04:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2019-08-05 10:04:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-08-05 10:04:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 371 transitions. [2019-08-05 10:04:17,249 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 371 transitions. Word has length 26 [2019-08-05 10:04:17,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:17,249 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 371 transitions. [2019-08-05 10:04:17,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:17,250 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 371 transitions. [2019-08-05 10:04:17,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:04:17,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:17,250 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:17,251 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:17,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1329261891, now seen corresponding path program 1 times [2019-08-05 10:04:17,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:17,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:04:17,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:04:17,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:17,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:04:17,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:17,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:17,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:17,286 INFO L87 Difference]: Start difference. First operand 223 states and 371 transitions. Second operand 5 states. [2019-08-05 10:04:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:17,606 INFO L93 Difference]: Finished difference Result 305 states and 508 transitions. [2019-08-05 10:04:17,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:17,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-08-05 10:04:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:17,609 INFO L225 Difference]: With dead ends: 305 [2019-08-05 10:04:17,609 INFO L226 Difference]: Without dead ends: 303 [2019-08-05 10:04:17,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:17,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-08-05 10:04:17,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 241. [2019-08-05 10:04:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-08-05 10:04:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 403 transitions. [2019-08-05 10:04:17,615 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 403 transitions. Word has length 27 [2019-08-05 10:04:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:17,615 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 403 transitions. [2019-08-05 10:04:17,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:17,615 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 403 transitions. [2019-08-05 10:04:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:17,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:17,616 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:17,617 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:17,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:17,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1222653420, now seen corresponding path program 1 times [2019-08-05 10:04:17,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:17,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:04:17,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:17,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:17,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:04:17,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:04:17,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:04:17,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:17,788 INFO L87 Difference]: Start difference. First operand 241 states and 403 transitions. Second operand 10 states. [2019-08-05 10:04:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:18,447 INFO L93 Difference]: Finished difference Result 248 states and 412 transitions. [2019-08-05 10:04:18,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:18,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-08-05 10:04:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:18,448 INFO L225 Difference]: With dead ends: 248 [2019-08-05 10:04:18,448 INFO L226 Difference]: Without dead ends: 247 [2019-08-05 10:04:18,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:18,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-08-05 10:04:18,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 243. [2019-08-05 10:04:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-08-05 10:04:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 406 transitions. [2019-08-05 10:04:18,453 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 406 transitions. Word has length 28 [2019-08-05 10:04:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:18,453 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 406 transitions. [2019-08-05 10:04:18,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:04:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 406 transitions. [2019-08-05 10:04:18,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:18,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:18,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:18,455 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:18,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:18,455 INFO L82 PathProgramCache]: Analyzing trace with hash 7479875, now seen corresponding path program 1 times [2019-08-05 10:04:18,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:18,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:04:18,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:18,521 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:18,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:18,818 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-08-05 10:04:18,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:04:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:19,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:19,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:04:19,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:04:19,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:04:19,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:19,344 INFO L87 Difference]: Start difference. First operand 243 states and 406 transitions. Second operand 10 states. [2019-08-05 10:04:20,331 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-08-05 10:04:20,897 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-08-05 10:04:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:22,582 INFO L93 Difference]: Finished difference Result 269 states and 448 transitions. [2019-08-05 10:04:22,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:04:22,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-08-05 10:04:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:22,583 INFO L225 Difference]: With dead ends: 269 [2019-08-05 10:04:22,583 INFO L226 Difference]: Without dead ends: 268 [2019-08-05 10:04:22,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:04:22,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-08-05 10:04:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 253. [2019-08-05 10:04:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-08-05 10:04:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 420 transitions. [2019-08-05 10:04:22,587 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 420 transitions. Word has length 28 [2019-08-05 10:04:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:22,588 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 420 transitions. [2019-08-05 10:04:22,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:04:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 420 transitions. [2019-08-05 10:04:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:22,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:22,589 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:22,589 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:22,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:22,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1434161294, now seen corresponding path program 1 times [2019-08-05 10:04:22,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:22,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:04:22,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:22,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:22,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:22,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:04:22,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:04:22,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:04:22,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:22,649 INFO L87 Difference]: Start difference. First operand 253 states and 420 transitions. Second operand 6 states. [2019-08-05 10:04:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:23,185 INFO L93 Difference]: Finished difference Result 367 states and 606 transitions. [2019-08-05 10:04:23,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:23,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-08-05 10:04:23,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:23,187 INFO L225 Difference]: With dead ends: 367 [2019-08-05 10:04:23,187 INFO L226 Difference]: Without dead ends: 365 [2019-08-05 10:04:23,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:23,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-08-05 10:04:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 306. [2019-08-05 10:04:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-08-05 10:04:23,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 510 transitions. [2019-08-05 10:04:23,192 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 510 transitions. Word has length 28 [2019-08-05 10:04:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:23,193 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 510 transitions. [2019-08-05 10:04:23,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:04:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 510 transitions. [2019-08-05 10:04:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:23,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:23,194 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:23,194 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:23,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:23,195 INFO L82 PathProgramCache]: Analyzing trace with hash -526455951, now seen corresponding path program 1 times [2019-08-05 10:04:23,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:23,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:04:23,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:23,589 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2019-08-05 10:04:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:23,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:23,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:04:23,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:04:23,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:04:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:23,673 INFO L87 Difference]: Start difference. First operand 306 states and 510 transitions. Second operand 11 states. [2019-08-05 10:04:24,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:24,274 INFO L93 Difference]: Finished difference Result 628 states and 1032 transitions. [2019-08-05 10:04:24,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:04:24,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-08-05 10:04:24,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:24,277 INFO L225 Difference]: With dead ends: 628 [2019-08-05 10:04:24,278 INFO L226 Difference]: Without dead ends: 627 [2019-08-05 10:04:24,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:04:24,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-08-05 10:04:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 332. [2019-08-05 10:04:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-08-05 10:04:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 552 transitions. [2019-08-05 10:04:24,284 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 552 transitions. Word has length 29 [2019-08-05 10:04:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:24,285 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 552 transitions. [2019-08-05 10:04:24,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:04:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 552 transitions. [2019-08-05 10:04:24,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:24,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:24,286 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:24,286 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:24,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:24,286 INFO L82 PathProgramCache]: Analyzing trace with hash -538916909, now seen corresponding path program 1 times [2019-08-05 10:04:24,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:24,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:04:24,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:24,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:24,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:04:24,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:24,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:24,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:24,399 INFO L87 Difference]: Start difference. First operand 332 states and 552 transitions. Second operand 9 states. [2019-08-05 10:04:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:24,896 INFO L93 Difference]: Finished difference Result 398 states and 651 transitions. [2019-08-05 10:04:24,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:04:24,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-08-05 10:04:24,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:24,898 INFO L225 Difference]: With dead ends: 398 [2019-08-05 10:04:24,898 INFO L226 Difference]: Without dead ends: 363 [2019-08-05 10:04:24,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:04:24,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-08-05 10:04:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 345. [2019-08-05 10:04:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-08-05 10:04:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 567 transitions. [2019-08-05 10:04:24,905 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 567 transitions. Word has length 29 [2019-08-05 10:04:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:24,905 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 567 transitions. [2019-08-05 10:04:24,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:24,905 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 567 transitions. [2019-08-05 10:04:24,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:24,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:24,906 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:24,907 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:24,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:24,907 INFO L82 PathProgramCache]: Analyzing trace with hash 928844867, now seen corresponding path program 2 times [2019-08-05 10:04:24,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:24,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:04:24,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:25,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:04:25,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:25,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:04:25,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:25,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:25,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:25,045 INFO L87 Difference]: Start difference. First operand 345 states and 567 transitions. Second operand 5 states. [2019-08-05 10:04:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:26,473 INFO L93 Difference]: Finished difference Result 346 states and 564 transitions. [2019-08-05 10:04:26,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:26,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-08-05 10:04:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:26,475 INFO L225 Difference]: With dead ends: 346 [2019-08-05 10:04:26,475 INFO L226 Difference]: Without dead ends: 346 [2019-08-05 10:04:26,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-08-05 10:04:26,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 333. [2019-08-05 10:04:26,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-08-05 10:04:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 546 transitions. [2019-08-05 10:04:26,482 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 546 transitions. Word has length 29 [2019-08-05 10:04:26,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:26,482 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 546 transitions. [2019-08-05 10:04:26,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 546 transitions. [2019-08-05 10:04:26,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:26,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:26,483 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:26,484 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:26,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:26,484 INFO L82 PathProgramCache]: Analyzing trace with hash 670441103, now seen corresponding path program 1 times [2019-08-05 10:04:26,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:26,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:04:26,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:26,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:26,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:04:26,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:26,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:04:26,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:26,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:26,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:26,580 INFO L87 Difference]: Start difference. First operand 333 states and 546 transitions. Second operand 5 states. [2019-08-05 10:04:27,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:27,018 INFO L93 Difference]: Finished difference Result 412 states and 671 transitions. [2019-08-05 10:04:27,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:27,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-08-05 10:04:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:27,021 INFO L225 Difference]: With dead ends: 412 [2019-08-05 10:04:27,021 INFO L226 Difference]: Without dead ends: 406 [2019-08-05 10:04:27,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-08-05 10:04:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 328. [2019-08-05 10:04:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-08-05 10:04:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 535 transitions. [2019-08-05 10:04:27,026 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 535 transitions. Word has length 30 [2019-08-05 10:04:27,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:27,026 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 535 transitions. [2019-08-05 10:04:27,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 535 transitions. [2019-08-05 10:04:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:27,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:27,028 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:27,028 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:27,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:27,028 INFO L82 PathProgramCache]: Analyzing trace with hash 504694217, now seen corresponding path program 1 times [2019-08-05 10:04:27,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:27,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:04:27,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:27,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:27,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:27,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:27,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:27,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:27,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:04:27,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:27,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:04:27,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:04:27,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:04:27,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:27,304 INFO L87 Difference]: Start difference. First operand 328 states and 535 transitions. Second operand 7 states. [2019-08-05 10:04:27,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:27,915 INFO L93 Difference]: Finished difference Result 364 states and 585 transitions. [2019-08-05 10:04:27,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:27,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-08-05 10:04:27,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:27,918 INFO L225 Difference]: With dead ends: 364 [2019-08-05 10:04:27,918 INFO L226 Difference]: Without dead ends: 364 [2019-08-05 10:04:27,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-08-05 10:04:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 337. [2019-08-05 10:04:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-08-05 10:04:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 549 transitions. [2019-08-05 10:04:27,924 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 549 transitions. Word has length 30 [2019-08-05 10:04:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:27,924 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 549 transitions. [2019-08-05 10:04:27,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:04:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 549 transitions. [2019-08-05 10:04:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:27,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:27,925 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:27,925 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:27,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:27,926 INFO L82 PathProgramCache]: Analyzing trace with hash -39663527, now seen corresponding path program 1 times [2019-08-05 10:04:27,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:27,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:04:27,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:27,944 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 10:04:27,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:27,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:04:27,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:27,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:27,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:27,953 INFO L87 Difference]: Start difference. First operand 337 states and 549 transitions. Second operand 5 states. [2019-08-05 10:04:28,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:28,161 INFO L93 Difference]: Finished difference Result 360 states and 585 transitions. [2019-08-05 10:04:28,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:28,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-08-05 10:04:28,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:28,164 INFO L225 Difference]: With dead ends: 360 [2019-08-05 10:04:28,164 INFO L226 Difference]: Without dead ends: 359 [2019-08-05 10:04:28,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-08-05 10:04:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 344. [2019-08-05 10:04:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-08-05 10:04:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 562 transitions. [2019-08-05 10:04:28,169 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 562 transitions. Word has length 30 [2019-08-05 10:04:28,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:28,169 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 562 transitions. [2019-08-05 10:04:28,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 562 transitions. [2019-08-05 10:04:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:28,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:28,170 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:28,171 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:28,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:28,171 INFO L82 PathProgramCache]: Analyzing trace with hash -932983007, now seen corresponding path program 1 times [2019-08-05 10:04:28,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:28,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:04:28,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:28,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:28,462 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-08-05 10:04:28,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:28,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:28,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:28,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:04:28,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:04:28,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:04:28,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:28,772 INFO L87 Difference]: Start difference. First operand 344 states and 562 transitions. Second operand 12 states. [2019-08-05 10:04:30,412 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-08-05 10:04:31,379 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-08-05 10:04:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:33,885 INFO L93 Difference]: Finished difference Result 607 states and 972 transitions. [2019-08-05 10:04:33,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:04:33,886 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-08-05 10:04:33,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:33,888 INFO L225 Difference]: With dead ends: 607 [2019-08-05 10:04:33,888 INFO L226 Difference]: Without dead ends: 606 [2019-08-05 10:04:33,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:04:33,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-08-05 10:04:33,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 453. [2019-08-05 10:04:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-08-05 10:04:33,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 736 transitions. [2019-08-05 10:04:33,894 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 736 transitions. Word has length 30 [2019-08-05 10:04:33,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:33,895 INFO L475 AbstractCegarLoop]: Abstraction has 453 states and 736 transitions. [2019-08-05 10:04:33,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:04:33,895 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 736 transitions. [2019-08-05 10:04:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:33,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:33,896 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:33,896 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:33,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:33,897 INFO L82 PathProgramCache]: Analyzing trace with hash -573704243, now seen corresponding path program 2 times [2019-08-05 10:04:33,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:33,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:04:33,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:34,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:34,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:04:34,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:04:34,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:04:34,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:34,410 INFO L87 Difference]: Start difference. First operand 453 states and 736 transitions. Second operand 12 states. [2019-08-05 10:04:35,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:35,222 INFO L93 Difference]: Finished difference Result 463 states and 746 transitions. [2019-08-05 10:04:35,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:04:35,222 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-08-05 10:04:35,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:35,225 INFO L225 Difference]: With dead ends: 463 [2019-08-05 10:04:35,225 INFO L226 Difference]: Without dead ends: 462 [2019-08-05 10:04:35,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:04:35,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-08-05 10:04:35,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 456. [2019-08-05 10:04:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-08-05 10:04:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 739 transitions. [2019-08-05 10:04:35,232 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 739 transitions. Word has length 31 [2019-08-05 10:04:35,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:35,232 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 739 transitions. [2019-08-05 10:04:35,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:04:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 739 transitions. [2019-08-05 10:04:35,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:35,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:35,234 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:35,234 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:35,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:35,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1812920110, now seen corresponding path program 1 times [2019-08-05 10:04:35,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:35,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:04:35,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:35,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:36,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:36,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:04:36,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:04:36,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:04:36,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=151, Unknown=1, NotChecked=0, Total=182 [2019-08-05 10:04:36,363 INFO L87 Difference]: Start difference. First operand 456 states and 739 transitions. Second operand 14 states. [2019-08-05 10:04:38,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:38,806 INFO L93 Difference]: Finished difference Result 469 states and 752 transitions. [2019-08-05 10:04:38,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:04:38,809 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-08-05 10:04:38,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:38,812 INFO L225 Difference]: With dead ends: 469 [2019-08-05 10:04:38,812 INFO L226 Difference]: Without dead ends: 468 [2019-08-05 10:04:38,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=34, Invalid=175, Unknown=1, NotChecked=0, Total=210 [2019-08-05 10:04:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-08-05 10:04:38,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 453. [2019-08-05 10:04:38,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-08-05 10:04:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 735 transitions. [2019-08-05 10:04:38,818 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 735 transitions. Word has length 31 [2019-08-05 10:04:38,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:38,818 INFO L475 AbstractCegarLoop]: Abstraction has 453 states and 735 transitions. [2019-08-05 10:04:38,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:04:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 735 transitions. [2019-08-05 10:04:38,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:38,819 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:38,820 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:38,820 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:38,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:38,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1187195, now seen corresponding path program 1 times [2019-08-05 10:04:38,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:38,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:38,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:04:38,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:38,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:38,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:38,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:38,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:38,855 INFO L87 Difference]: Start difference. First operand 453 states and 735 transitions. Second operand 3 states. [2019-08-05 10:04:38,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:38,936 INFO L93 Difference]: Finished difference Result 457 states and 739 transitions. [2019-08-05 10:04:38,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:38,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-08-05 10:04:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:38,939 INFO L225 Difference]: With dead ends: 457 [2019-08-05 10:04:38,939 INFO L226 Difference]: Without dead ends: 355 [2019-08-05 10:04:38,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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 10:04:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-08-05 10:04:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 352. [2019-08-05 10:04:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-08-05 10:04:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 564 transitions. [2019-08-05 10:04:38,944 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 564 transitions. Word has length 31 [2019-08-05 10:04:38,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:38,944 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 564 transitions. [2019-08-05 10:04:38,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 564 transitions. [2019-08-05 10:04:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:38,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:38,945 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:38,946 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:38,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:38,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1265910655, now seen corresponding path program 1 times [2019-08-05 10:04:38,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:38,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:38,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:04:38,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:38,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:04:38,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:04:38,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:04:38,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:38,996 INFO L87 Difference]: Start difference. First operand 352 states and 564 transitions. Second operand 4 states. [2019-08-05 10:04:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:39,199 INFO L93 Difference]: Finished difference Result 418 states and 665 transitions. [2019-08-05 10:04:39,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:04:39,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-08-05 10:04:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:39,202 INFO L225 Difference]: With dead ends: 418 [2019-08-05 10:04:39,202 INFO L226 Difference]: Without dead ends: 416 [2019-08-05 10:04:39,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 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 10:04:39,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-08-05 10:04:39,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 362. [2019-08-05 10:04:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-08-05 10:04:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 579 transitions. [2019-08-05 10:04:39,208 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 579 transitions. Word has length 31 [2019-08-05 10:04:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:39,208 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 579 transitions. [2019-08-05 10:04:39,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:04:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 579 transitions. [2019-08-05 10:04:39,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:04:39,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:39,209 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:39,209 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:39,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:39,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1747740632, now seen corresponding path program 2 times [2019-08-05 10:04:39,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:39,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:04:39,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:39,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:39,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:04:39,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:04:39,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:04:39,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:04:39,477 INFO L87 Difference]: Start difference. First operand 362 states and 579 transitions. Second operand 13 states. [2019-08-05 10:04:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:40,312 INFO L93 Difference]: Finished difference Result 696 states and 1098 transitions. [2019-08-05 10:04:40,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:04:40,312 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-08-05 10:04:40,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:40,316 INFO L225 Difference]: With dead ends: 696 [2019-08-05 10:04:40,316 INFO L226 Difference]: Without dead ends: 695 [2019-08-05 10:04:40,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:04:40,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-08-05 10:04:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 365. [2019-08-05 10:04:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-08-05 10:04:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 583 transitions. [2019-08-05 10:04:40,322 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 583 transitions. Word has length 32 [2019-08-05 10:04:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:40,322 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 583 transitions. [2019-08-05 10:04:40,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:04:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 583 transitions. [2019-08-05 10:04:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:04:40,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:40,323 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:40,323 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:40,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:40,324 INFO L82 PathProgramCache]: Analyzing trace with hash -318751656, now seen corresponding path program 2 times [2019-08-05 10:04:40,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:40,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:04:40,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:40,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:40,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:40,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:04:40,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:40,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:04:40,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:40,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:40,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:40,414 INFO L87 Difference]: Start difference. First operand 365 states and 583 transitions. Second operand 9 states. [2019-08-05 10:04:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:41,008 INFO L93 Difference]: Finished difference Result 393 states and 615 transitions. [2019-08-05 10:04:41,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:04:41,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-08-05 10:04:41,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:41,011 INFO L225 Difference]: With dead ends: 393 [2019-08-05 10:04:41,012 INFO L226 Difference]: Without dead ends: 392 [2019-08-05 10:04:41,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:04:41,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-08-05 10:04:41,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 358. [2019-08-05 10:04:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-08-05 10:04:41,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 570 transitions. [2019-08-05 10:04:41,017 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 570 transitions. Word has length 32 [2019-08-05 10:04:41,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:41,017 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 570 transitions. [2019-08-05 10:04:41,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 570 transitions. [2019-08-05 10:04:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:04:41,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:41,018 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:41,018 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:41,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:41,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1646441442, now seen corresponding path program 1 times [2019-08-05 10:04:41,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:41,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:04:41,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:04:41,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:41,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:04:41,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:41,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:41,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:41,129 INFO L87 Difference]: Start difference. First operand 358 states and 570 transitions. Second operand 8 states. [2019-08-05 10:04:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:41,546 INFO L93 Difference]: Finished difference Result 307 states and 482 transitions. [2019-08-05 10:04:41,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:04:41,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-08-05 10:04:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:41,548 INFO L225 Difference]: With dead ends: 307 [2019-08-05 10:04:41,548 INFO L226 Difference]: Without dead ends: 307 [2019-08-05 10:04:41,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-08-05 10:04:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 284. [2019-08-05 10:04:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-08-05 10:04:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 449 transitions. [2019-08-05 10:04:41,553 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 449 transitions. Word has length 32 [2019-08-05 10:04:41,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:41,553 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 449 transitions. [2019-08-05 10:04:41,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 449 transitions. [2019-08-05 10:04:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:04:41,553 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:41,553 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:41,554 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:41,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1745353340, now seen corresponding path program 1 times [2019-08-05 10:04:41,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:41,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:04:41,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:41,663 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:04:41,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:41,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:04:41,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:41,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:41,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:41,664 INFO L87 Difference]: Start difference. First operand 284 states and 449 transitions. Second operand 5 states. [2019-08-05 10:04:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:41,904 INFO L93 Difference]: Finished difference Result 251 states and 384 transitions. [2019-08-05 10:04:41,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:41,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-08-05 10:04:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:41,906 INFO L225 Difference]: With dead ends: 251 [2019-08-05 10:04:41,906 INFO L226 Difference]: Without dead ends: 251 [2019-08-05 10:04:41,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:41,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-08-05 10:04:41,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 230. [2019-08-05 10:04:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-08-05 10:04:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-08-05 10:04:41,910 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 33 [2019-08-05 10:04:41,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:41,910 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-08-05 10:04:41,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-08-05 10:04:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:04:41,910 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:41,911 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:41,911 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:41,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1836351353, now seen corresponding path program 2 times [2019-08-05 10:04:41,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:41,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:04:41,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:41,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:42,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:42,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:42,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:42,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:42,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:04:42,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:04:42,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:04:42,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:04:42,915 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 18 states. [2019-08-05 10:04:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:44,958 INFO L93 Difference]: Finished difference Result 219 states and 333 transitions. [2019-08-05 10:04:44,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:04:44,959 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-08-05 10:04:44,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:44,960 INFO L225 Difference]: With dead ends: 219 [2019-08-05 10:04:44,960 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 10:04:44,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:04:44,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 10:04:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 202. [2019-08-05 10:04:44,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 10:04:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 311 transitions. [2019-08-05 10:04:44,965 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 311 transitions. Word has length 33 [2019-08-05 10:04:44,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:44,965 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 311 transitions. [2019-08-05 10:04:44,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:04:44,965 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 311 transitions. [2019-08-05 10:04:44,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:04:44,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:44,966 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:44,966 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:44,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:44,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1141782947, now seen corresponding path program 1 times [2019-08-05 10:04:44,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:44,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:04:44,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:04:45,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:45,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:04:45,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:45,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:45,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:45,060 INFO L87 Difference]: Start difference. First operand 202 states and 311 transitions. Second operand 5 states. [2019-08-05 10:04:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:45,325 INFO L93 Difference]: Finished difference Result 212 states and 313 transitions. [2019-08-05 10:04:45,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:45,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-08-05 10:04:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:45,327 INFO L225 Difference]: With dead ends: 212 [2019-08-05 10:04:45,327 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 10:04:45,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 10:04:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2019-08-05 10:04:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 10:04:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 229 transitions. [2019-08-05 10:04:45,331 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 229 transitions. Word has length 33 [2019-08-05 10:04:45,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:45,331 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 229 transitions. [2019-08-05 10:04:45,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:45,332 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 229 transitions. [2019-08-05 10:04:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:04:45,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:45,332 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:45,332 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:45,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:45,333 INFO L82 PathProgramCache]: Analyzing trace with hash -572334516, now seen corresponding path program 3 times [2019-08-05 10:04:45,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:45,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:04:45,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:45,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:45,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:04:45,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:04:45,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:04:45,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:04:45,708 INFO L87 Difference]: Start difference. First operand 150 states and 229 transitions. Second operand 15 states. [2019-08-05 10:04:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:47,090 INFO L93 Difference]: Finished difference Result 173 states and 255 transitions. [2019-08-05 10:04:47,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:04:47,091 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-08-05 10:04:47,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:47,093 INFO L225 Difference]: With dead ends: 173 [2019-08-05 10:04:47,093 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 10:04:47,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:04:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 10:04:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2019-08-05 10:04:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 10:04:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 250 transitions. [2019-08-05 10:04:47,095 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 250 transitions. Word has length 34 [2019-08-05 10:04:47,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:47,095 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 250 transitions. [2019-08-05 10:04:47,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:04:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 250 transitions. [2019-08-05 10:04:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:04:47,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:47,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:47,096 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:47,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:47,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1356704634, now seen corresponding path program 1 times [2019-08-05 10:04:47,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:47,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:04:47,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:04:47,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:47,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:04:47,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:47,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:47,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:47,556 INFO L87 Difference]: Start difference. First operand 169 states and 250 transitions. Second operand 8 states. [2019-08-05 10:04:47,818 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-08-05 10:04:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:50,447 INFO L93 Difference]: Finished difference Result 174 states and 256 transitions. [2019-08-05 10:04:50,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:50,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-08-05 10:04:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:50,449 INFO L225 Difference]: With dead ends: 174 [2019-08-05 10:04:50,449 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 10:04:50,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:50,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 10:04:50,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-08-05 10:04:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 10:04:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 249 transitions. [2019-08-05 10:04:50,452 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 249 transitions. Word has length 34 [2019-08-05 10:04:50,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:50,452 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 249 transitions. [2019-08-05 10:04:50,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:50,453 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 249 transitions. [2019-08-05 10:04:50,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:04:50,453 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:50,453 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:50,454 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:50,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:50,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1486648103, now seen corresponding path program 2 times [2019-08-05 10:04:50,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:50,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:04:50,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:50,749 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:50,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:50,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:04:50,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:04:50,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:04:50,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:04:50,750 INFO L87 Difference]: Start difference. First operand 169 states and 249 transitions. Second operand 13 states. [2019-08-05 10:04:51,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:51,763 INFO L93 Difference]: Finished difference Result 200 states and 286 transitions. [2019-08-05 10:04:51,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:04:51,764 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-08-05 10:04:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:51,765 INFO L225 Difference]: With dead ends: 200 [2019-08-05 10:04:51,766 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 10:04:51,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:04:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 10:04:51,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 175. [2019-08-05 10:04:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-08-05 10:04:51,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 256 transitions. [2019-08-05 10:04:51,769 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 256 transitions. Word has length 34 [2019-08-05 10:04:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:51,769 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 256 transitions. [2019-08-05 10:04:51,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:04:51,769 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 256 transitions. [2019-08-05 10:04:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:04:51,770 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:51,770 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:51,770 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:51,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:51,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1923259409, now seen corresponding path program 3 times [2019-08-05 10:04:51,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:51,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:04:51,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:52,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:52,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:04:52,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:04:52,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:04:52,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:04:52,071 INFO L87 Difference]: Start difference. First operand 175 states and 256 transitions. Second operand 15 states. [2019-08-05 10:04:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:53,055 INFO L93 Difference]: Finished difference Result 287 states and 416 transitions. [2019-08-05 10:04:53,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:04:53,055 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2019-08-05 10:04:53,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:53,057 INFO L225 Difference]: With dead ends: 287 [2019-08-05 10:04:53,057 INFO L226 Difference]: Without dead ends: 286 [2019-08-05 10:04:53,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:04:53,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-08-05 10:04:53,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 178. [2019-08-05 10:04:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-08-05 10:04:53,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 259 transitions. [2019-08-05 10:04:53,061 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 259 transitions. Word has length 35 [2019-08-05 10:04:53,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:53,061 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 259 transitions. [2019-08-05 10:04:53,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:04:53,061 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 259 transitions. [2019-08-05 10:04:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:04:53,061 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:53,062 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:53,062 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:53,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:53,062 INFO L82 PathProgramCache]: Analyzing trace with hash -442668737, now seen corresponding path program 1 times [2019-08-05 10:04:53,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:53,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:04:53,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:04:53,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:53,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:04:53,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:04:53,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:04:53,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:53,316 INFO L87 Difference]: Start difference. First operand 178 states and 259 transitions. Second operand 7 states. [2019-08-05 10:04:53,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:53,556 INFO L93 Difference]: Finished difference Result 180 states and 261 transitions. [2019-08-05 10:04:53,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:04:53,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-08-05 10:04:53,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:53,558 INFO L225 Difference]: With dead ends: 180 [2019-08-05 10:04:53,558 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 10:04:53,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:53,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 10:04:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-08-05 10:04:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-08-05 10:04:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 254 transitions. [2019-08-05 10:04:53,562 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 254 transitions. Word has length 35 [2019-08-05 10:04:53,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:53,562 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 254 transitions. [2019-08-05 10:04:53,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:04:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 254 transitions. [2019-08-05 10:04:53,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:04:53,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:53,563 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:53,563 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:53,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:53,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1578496877, now seen corresponding path program 4 times [2019-08-05 10:04:53,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:53,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:04:53,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:54,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:54,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:04:54,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:04:54,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:04:54,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:04:54,175 INFO L87 Difference]: Start difference. First operand 175 states and 254 transitions. Second operand 17 states. [2019-08-05 10:04:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:56,203 INFO L93 Difference]: Finished difference Result 195 states and 276 transitions. [2019-08-05 10:04:56,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:04:56,205 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2019-08-05 10:04:56,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:56,206 INFO L225 Difference]: With dead ends: 195 [2019-08-05 10:04:56,206 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 10:04:56,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:04:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 10:04:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2019-08-05 10:04:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:04:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 264 transitions. [2019-08-05 10:04:56,209 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 264 transitions. Word has length 37 [2019-08-05 10:04:56,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:56,210 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 264 transitions. [2019-08-05 10:04:56,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:04:56,210 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 264 transitions. [2019-08-05 10:04:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:04:56,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:56,211 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:56,211 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:56,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:56,211 INFO L82 PathProgramCache]: Analyzing trace with hash 6778034, now seen corresponding path program 3 times [2019-08-05 10:04:56,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:56,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:04:56,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:57,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:57,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:04:57,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:04:57,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:04:57,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:04:57,417 INFO L87 Difference]: Start difference. First operand 184 states and 264 transitions. Second operand 14 states. [2019-08-05 10:04:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:58,465 INFO L93 Difference]: Finished difference Result 204 states and 287 transitions. [2019-08-05 10:04:58,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:04:58,466 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-08-05 10:04:58,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:58,467 INFO L225 Difference]: With dead ends: 204 [2019-08-05 10:04:58,467 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 10:04:58,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:04:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 10:04:58,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 166. [2019-08-05 10:04:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 10:04:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 242 transitions. [2019-08-05 10:04:58,470 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 242 transitions. Word has length 37 [2019-08-05 10:04:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:58,470 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 242 transitions. [2019-08-05 10:04:58,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:04:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 242 transitions. [2019-08-05 10:04:58,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:04:58,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:58,471 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:58,471 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:58,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:58,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1935817184, now seen corresponding path program 1 times [2019-08-05 10:04:58,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:58,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:04:58,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:04:58,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:58,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:04:58,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:04:58,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:04:58,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:58,538 INFO L87 Difference]: Start difference. First operand 166 states and 242 transitions. Second operand 7 states. [2019-08-05 10:04:58,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:58,901 INFO L93 Difference]: Finished difference Result 170 states and 251 transitions. [2019-08-05 10:04:58,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:58,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-08-05 10:04:58,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:58,902 INFO L225 Difference]: With dead ends: 170 [2019-08-05 10:04:58,903 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:04:58,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:04:58,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2019-08-05 10:04:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:04:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 154 transitions. [2019-08-05 10:04:58,905 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 154 transitions. Word has length 37 [2019-08-05 10:04:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:58,905 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 154 transitions. [2019-08-05 10:04:58,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:04:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 154 transitions. [2019-08-05 10:04:58,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:04:58,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:58,906 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:58,906 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:58,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1933222792, now seen corresponding path program 4 times [2019-08-05 10:04:58,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:58,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:04:58,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:59,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:59,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:04:59,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:04:59,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:04:59,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:04:59,313 INFO L87 Difference]: Start difference. First operand 102 states and 154 transitions. Second operand 16 states. [2019-08-05 10:05:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:00,195 INFO L93 Difference]: Finished difference Result 192 states and 272 transitions. [2019-08-05 10:05:00,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:05:00,196 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-08-05 10:05:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:00,197 INFO L225 Difference]: With dead ends: 192 [2019-08-05 10:05:00,197 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 10:05:00,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:05:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 10:05:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 102. [2019-08-05 10:05:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:05:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 154 transitions. [2019-08-05 10:05:00,201 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 154 transitions. Word has length 38 [2019-08-05 10:05:00,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:00,201 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 154 transitions. [2019-08-05 10:05:00,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:05:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 154 transitions. [2019-08-05 10:05:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:05:00,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:00,201 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:00,202 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:00,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:00,202 INFO L82 PathProgramCache]: Analyzing trace with hash 379436716, now seen corresponding path program 5 times [2019-08-05 10:05:00,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:00,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:05:00,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:02,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:02,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:05:02,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:05:02,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:05:02,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:05:02,279 INFO L87 Difference]: Start difference. First operand 102 states and 154 transitions. Second operand 19 states. [2019-08-05 10:05:04,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:04,560 INFO L93 Difference]: Finished difference Result 128 states and 180 transitions. [2019-08-05 10:05:04,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:05:04,560 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-08-05 10:05:04,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:04,561 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:05:04,561 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:05:04,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:05:04,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:05:04,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2019-08-05 10:05:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:05:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2019-08-05 10:05:04,564 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 40 [2019-08-05 10:05:04,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:04,565 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2019-08-05 10:05:04,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:05:04,565 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2019-08-05 10:05:04,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:05:04,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:04,565 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:04,565 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:04,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:04,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1036845895, now seen corresponding path program 4 times [2019-08-05 10:05:04,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:04,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:05:04,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:05,086 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 10:05:05,288 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:05:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:05,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:05,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:05:05,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:05:05,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:05:05,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:05:05,726 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. Second operand 16 states. [2019-08-05 10:05:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:06,837 INFO L93 Difference]: Finished difference Result 137 states and 193 transitions. [2019-08-05 10:05:06,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:05:06,838 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-08-05 10:05:06,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:06,839 INFO L225 Difference]: With dead ends: 137 [2019-08-05 10:05:06,839 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:05:06,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:05:06,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:05:06,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2019-08-05 10:05:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:05:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 157 transitions. [2019-08-05 10:05:06,842 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 157 transitions. Word has length 40 [2019-08-05 10:05:06,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:06,842 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 157 transitions. [2019-08-05 10:05:06,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:05:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 157 transitions. [2019-08-05 10:05:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:05:06,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:06,843 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:06,843 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:06,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:06,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1895344975, now seen corresponding path program 5 times [2019-08-05 10:05:06,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:06,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:05:06,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:07,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:07,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:05:07,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:05:07,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:05:07,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:05:07,172 INFO L87 Difference]: Start difference. First operand 105 states and 157 transitions. Second operand 18 states. [2019-08-05 10:05:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:08,386 INFO L93 Difference]: Finished difference Result 198 states and 278 transitions. [2019-08-05 10:05:08,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:05:08,386 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-08-05 10:05:08,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:08,387 INFO L225 Difference]: With dead ends: 198 [2019-08-05 10:05:08,388 INFO L226 Difference]: Without dead ends: 197 [2019-08-05 10:05:08,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:05:08,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-08-05 10:05:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 105. [2019-08-05 10:05:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:05:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 157 transitions. [2019-08-05 10:05:08,391 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 157 transitions. Word has length 41 [2019-08-05 10:05:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:08,391 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 157 transitions. [2019-08-05 10:05:08,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:05:08,391 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 157 transitions. [2019-08-05 10:05:08,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:05:08,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:08,392 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:08,392 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:08,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:08,392 INFO L82 PathProgramCache]: Analyzing trace with hash 421181197, now seen corresponding path program 6 times [2019-08-05 10:05:08,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:08,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:05:08,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:08,709 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:05:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:11,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:11,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:05:11,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:05:11,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:05:11,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=372, Unknown=3, NotChecked=0, Total=420 [2019-08-05 10:05:11,142 INFO L87 Difference]: Start difference. First operand 105 states and 157 transitions. Second operand 21 states. [2019-08-05 10:05:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:14,889 INFO L93 Difference]: Finished difference Result 134 states and 186 transitions. [2019-08-05 10:05:14,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:05:14,889 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 43 [2019-08-05 10:05:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:14,890 INFO L225 Difference]: With dead ends: 134 [2019-08-05 10:05:14,890 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:05:14,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=89, Invalid=900, Unknown=3, NotChecked=0, Total=992 [2019-08-05 10:05:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:05:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 110. [2019-08-05 10:05:14,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:05:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2019-08-05 10:05:14,893 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 43 [2019-08-05 10:05:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:14,893 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2019-08-05 10:05:14,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:05:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2019-08-05 10:05:14,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:05:14,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:14,894 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:14,894 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:14,894 INFO L82 PathProgramCache]: Analyzing trace with hash 247163026, now seen corresponding path program 5 times [2019-08-05 10:05:14,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:14,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:05:14,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:15,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:15,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:05:15,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:05:15,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:05:15,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:05:15,318 INFO L87 Difference]: Start difference. First operand 110 states and 162 transitions. Second operand 18 states. [2019-08-05 10:05:16,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:16,648 INFO L93 Difference]: Finished difference Result 143 states and 199 transitions. [2019-08-05 10:05:16,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:05:16,648 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2019-08-05 10:05:16,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:16,649 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:05:16,649 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 10:05:16,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:05:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 10:05:16,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 108. [2019-08-05 10:05:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:05:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2019-08-05 10:05:16,652 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 43 [2019-08-05 10:05:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:16,652 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2019-08-05 10:05:16,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:05:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2019-08-05 10:05:16,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:05:16,652 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:16,653 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:16,653 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:16,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:16,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1606179096, now seen corresponding path program 6 times [2019-08-05 10:05:16,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:16,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:05:16,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:16,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:16,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:05:17,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:05:17,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:05:17,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:05:17,000 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand 20 states. [2019-08-05 10:05:18,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:18,870 INFO L93 Difference]: Finished difference Result 204 states and 284 transitions. [2019-08-05 10:05:18,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:05:18,871 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2019-08-05 10:05:18,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:18,872 INFO L225 Difference]: With dead ends: 204 [2019-08-05 10:05:18,872 INFO L226 Difference]: Without dead ends: 203 [2019-08-05 10:05:18,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:05:18,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-08-05 10:05:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 108. [2019-08-05 10:05:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:05:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2019-08-05 10:05:18,876 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 44 [2019-08-05 10:05:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:18,876 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2019-08-05 10:05:18,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:05:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2019-08-05 10:05:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:05:18,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:18,877 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:18,878 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:18,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:18,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1509501172, now seen corresponding path program 7 times [2019-08-05 10:05:18,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:18,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:05:18,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:19,481 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:19,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:19,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:05:19,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:05:19,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:05:19,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:05:19,482 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand 22 states. [2019-08-05 10:05:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:21,517 INFO L93 Difference]: Finished difference Result 137 states and 189 transitions. [2019-08-05 10:05:21,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:05:21,518 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-08-05 10:05:21,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:21,519 INFO L225 Difference]: With dead ends: 137 [2019-08-05 10:05:21,519 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:05:21,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=1029, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:05:21,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:05:21,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2019-08-05 10:05:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:05:21,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2019-08-05 10:05:21,522 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 46 [2019-08-05 10:05:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:21,523 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2019-08-05 10:05:21,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:05:21,523 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2019-08-05 10:05:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:05:21,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:21,523 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:21,524 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:21,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1659307161, now seen corresponding path program 6 times [2019-08-05 10:05:21,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:21,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:05:21,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:21,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:21,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:05:21,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:05:21,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:05:21,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:05:21,974 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand 20 states. [2019-08-05 10:05:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:23,616 INFO L93 Difference]: Finished difference Result 149 states and 205 transitions. [2019-08-05 10:05:23,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:05:23,616 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2019-08-05 10:05:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:23,618 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:05:23,618 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:05:23,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:05:23,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:05:23,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 111. [2019-08-05 10:05:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:05:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2019-08-05 10:05:23,620 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 46 [2019-08-05 10:05:23,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:23,621 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2019-08-05 10:05:23,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:05:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2019-08-05 10:05:23,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:05:23,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:23,621 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:23,621 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:23,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:23,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1525093713, now seen corresponding path program 7 times [2019-08-05 10:05:23,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:23,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:05:23,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:24,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:24,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:05:24,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:05:24,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:05:24,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:05:24,031 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand 22 states. [2019-08-05 10:05:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:26,272 INFO L93 Difference]: Finished difference Result 210 states and 290 transitions. [2019-08-05 10:05:26,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:05:26,272 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2019-08-05 10:05:26,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:26,273 INFO L225 Difference]: With dead ends: 210 [2019-08-05 10:05:26,274 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 10:05:26,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=1234, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:05:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 10:05:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 111. [2019-08-05 10:05:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:05:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2019-08-05 10:05:26,276 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 47 [2019-08-05 10:05:26,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:26,276 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2019-08-05 10:05:26,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:05:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2019-08-05 10:05:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:05:26,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:26,277 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:26,277 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:26,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:26,278 INFO L82 PathProgramCache]: Analyzing trace with hash -265928019, now seen corresponding path program 8 times [2019-08-05 10:05:26,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:26,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:05:26,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:05:26,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:26,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:05:26,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:05:26,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:05:26,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:05:26,900 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand 24 states. [2019-08-05 10:05:29,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:29,067 INFO L93 Difference]: Finished difference Result 143 states and 195 transitions. [2019-08-05 10:05:29,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:05:29,068 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 49 [2019-08-05 10:05:29,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:29,069 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:05:29,069 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 10:05:29,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=1301, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:05:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 10:05:29,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 116. [2019-08-05 10:05:29,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:05:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2019-08-05 10:05:29,072 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 49 [2019-08-05 10:05:29,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:29,072 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2019-08-05 10:05:29,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:05:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2019-08-05 10:05:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:05:29,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:29,073 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:29,073 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:29,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:29,074 INFO L82 PathProgramCache]: Analyzing trace with hash -665125774, now seen corresponding path program 7 times [2019-08-05 10:05:29,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:29,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:05:29,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 10:05:29,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:29,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:05:29,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:05:29,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:05:29,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:05:29,237 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand 5 states. [2019-08-05 10:05:29,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:29,448 INFO L93 Difference]: Finished difference Result 106 states and 149 transitions. [2019-08-05 10:05:29,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:05:29,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-08-05 10:05:29,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:29,449 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:05:29,449 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:05:29,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:05:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:05:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:05:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:05:29,450 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-08-05 10:05:29,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:29,450 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:05:29,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:05:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:05:29,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:05:29,455 INFO L202 PluginConnector]: Adding new model RanFile092.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:05:29 BoogieIcfgContainer [2019-08-05 10:05:29,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:05:29,457 INFO L168 Benchmark]: Toolchain (without parser) took 195370.45 ms. Allocated memory was 137.9 MB in the beginning and 148.4 MB in the end (delta: 10.5 MB). Free memory was 106.6 MB in the beginning and 56.8 MB in the end (delta: 49.7 MB). Peak memory consumption was 60.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:05:29,457 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory is still 108.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:05:29,458 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.73 ms. Allocated memory is still 137.9 MB. Free memory was 106.1 MB in the beginning and 104.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:05:29,460 INFO L168 Benchmark]: Boogie Preprocessor took 76.10 ms. Allocated memory is still 137.9 MB. Free memory was 104.5 MB in the beginning and 102.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:05:29,460 INFO L168 Benchmark]: RCFGBuilder took 2095.96 ms. Allocated memory was 137.9 MB in the beginning and 179.8 MB in the end (delta: 41.9 MB). Free memory was 102.3 MB in the beginning and 133.7 MB in the end (delta: -31.4 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:05:29,461 INFO L168 Benchmark]: TraceAbstraction took 193136.09 ms. Allocated memory was 179.8 MB in the beginning and 148.4 MB in the end (delta: -31.5 MB). Free memory was 132.5 MB in the beginning and 56.8 MB in the end (delta: 75.6 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:05:29,464 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.23 ms. Allocated memory is still 137.9 MB. Free memory is still 108.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.73 ms. Allocated memory is still 137.9 MB. Free memory was 106.1 MB in the beginning and 104.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.10 ms. Allocated memory is still 137.9 MB. Free memory was 104.5 MB in the beginning and 102.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2095.96 ms. Allocated memory was 137.9 MB in the beginning and 179.8 MB in the end (delta: 41.9 MB). Free memory was 102.3 MB in the beginning and 133.7 MB in the end (delta: -31.4 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 193136.09 ms. Allocated memory was 179.8 MB in the beginning and 148.4 MB in the end (delta: -31.5 MB). Free memory was 132.5 MB in the beginning and 56.8 MB in the end (delta: 75.6 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 246]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 245]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 244]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 3 error locations. SAFE Result, 193.0s OverallTime, 69 OverallIterations, 9 TraceHistogramMax, 159.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5103 SDtfs, 3586 SDslu, 5215 SDs, 0 SdLazy, 43294 SolverSat, 786 SolverUnsat, 82 SolverUnknown, 0 SolverNotchecked, 130.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2289 GetRequests, 1419 SyntacticMatches, 36 SemanticMatches, 834 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 51.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=456occurred in iteration=40, 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.3s AutomataMinimizationTime, 69 MinimizatonAttempts, 2741 StatesRemovedByMinimization, 66 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 31.8s InterpolantComputationTime, 2059 NumberOfCodeBlocks, 2059 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 1990 ConstructedInterpolants, 360 QuantifiedInterpolants, 809262 SizeOfPredicates, 356 NumberOfNonLiveVariables, 4734 ConjunctsInSsa, 994 ConjunctsInUnsatCore, 69 InterpolantComputations, 29 PerfectInterpolantSequences, 292/1235 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...