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/RanFile074.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:04:14,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:04:14,943 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:04:14,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:04:14,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:04:14,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:04:14,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:04:14,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:04:14,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:04:14,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:04:14,963 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:04:14,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:04:14,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:04:14,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:04:14,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:04:14,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:04:14,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:04:14,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:04:14,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:04:14,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:04:14,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:04:14,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:04:14,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:04:14,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:04:14,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:04:14,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:04:14,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:04:14,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:04:14,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:04:14,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:04:14,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:04:14,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:04:14,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:04:14,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:04:14,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:04:14,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:04:14,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:04:14,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:04:14,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:04:14,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:04:14,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:04:15,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:04:15,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:04:15,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:04:15,035 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:04:15,035 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:04:15,036 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile074.bpl [2019-08-05 10:04:15,037 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile074.bpl' [2019-08-05 10:04:15,086 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:04:15,088 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:04:15,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:04:15,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:04:15,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:04:15,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RanFile074.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:15" (1/1) ... [2019-08-05 10:04:15,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RanFile074.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:15" (1/1) ... [2019-08-05 10:04:15,125 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:04:15,125 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:04:15,125 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:04:15,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:04:15,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:04:15,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:04:15,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:04:15,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RanFile074.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:15" (1/1) ... [2019-08-05 10:04:15,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RanFile074.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:15" (1/1) ... [2019-08-05 10:04:15,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RanFile074.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:15" (1/1) ... [2019-08-05 10:04:15,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RanFile074.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:15" (1/1) ... [2019-08-05 10:04:15,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RanFile074.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:15" (1/1) ... [2019-08-05 10:04:15,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RanFile074.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:15" (1/1) ... [2019-08-05 10:04:15,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RanFile074.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:15" (1/1) ... [2019-08-05 10:04:15,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:04:15,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:04:15,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:04:15,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:04:15,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RanFile074.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:15" (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:04:15,286 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:04:15,286 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:04:15,286 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:04:16,849 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:04:16,849 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:04:16,850 INFO L202 PluginConnector]: Adding new model RanFile074.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:04:16 BoogieIcfgContainer [2019-08-05 10:04:16,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:04:16,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:04:16,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:04:16,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:04:16,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile074.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:04:15" (1/2) ... [2019-08-05 10:04:16,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c62c895 and model type RanFile074.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:04:16, skipping insertion in model container [2019-08-05 10:04:16,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile074.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:04:16" (2/2) ... [2019-08-05 10:04:16,859 INFO L109 eAbstractionObserver]: Analyzing ICFG RanFile074.bpl [2019-08-05 10:04:16,868 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:04:16,877 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:04:16,893 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:04:16,920 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:04:16,921 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:04:16,921 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:04:16,921 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:04:16,921 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:04:16,921 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:04:16,921 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:04:16,922 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:04:16,922 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:04:16,938 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-08-05 10:04:16,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:04:16,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:16,948 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:04:16,951 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:16,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:16,958 INFO L82 PathProgramCache]: Analyzing trace with hash 564412908, now seen corresponding path program 1 times [2019-08-05 10:04:17,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:17,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjunts are in the unsatisfiable core [2019-08-05 10:04:17,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:17,088 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:04:17,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:17,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:04:17,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-08-05 10:04:17,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-08-05 10:04:17,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-08-05 10:04:17,113 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2019-08-05 10:04:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:17,131 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-08-05 10:04:17,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-08-05 10:04:17,133 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-08-05 10:04:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:17,144 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:04:17,145 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:04:17,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-08-05 10:04:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:04:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:04:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:04:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2019-08-05 10:04:17,184 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 19 [2019-08-05 10:04:17,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:17,184 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2019-08-05 10:04:17,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-08-05 10:04:17,185 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2019-08-05 10:04:17,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:04:17,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:17,186 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:04:17,187 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:17,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:17,187 INFO L82 PathProgramCache]: Analyzing trace with hash 256420476, now seen corresponding path program 1 times [2019-08-05 10:04:17,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:17,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:04:17,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:17,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:17,858 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-08-05 10:04:17,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:18,029 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:04:18,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:18,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:04:18,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:04:18,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:04:18,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:18,036 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand 7 states. [2019-08-05 10:04:18,897 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2019-08-05 10:04:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:19,051 INFO L93 Difference]: Finished difference Result 59 states and 103 transitions. [2019-08-05 10:04:19,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:19,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-08-05 10:04:19,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:19,056 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:04:19,056 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:04:19,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:04:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2019-08-05 10:04:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:04:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 76 transitions. [2019-08-05 10:04:19,067 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 76 transitions. Word has length 20 [2019-08-05 10:04:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:19,067 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 76 transitions. [2019-08-05 10:04:19,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:04:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 76 transitions. [2019-08-05 10:04:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:04:19,069 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:19,069 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:04:19,070 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:19,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:19,070 INFO L82 PathProgramCache]: Analyzing trace with hash 972551686, now seen corresponding path program 1 times [2019-08-05 10:04:19,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:19,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:04:19,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:19,320 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:04:19,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:19,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:04:19,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:19,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:19,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:19,322 INFO L87 Difference]: Start difference. First operand 44 states and 76 transitions. Second operand 5 states. [2019-08-05 10:04:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:19,697 INFO L93 Difference]: Finished difference Result 71 states and 119 transitions. [2019-08-05 10:04:19,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:19,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-08-05 10:04:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:19,699 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:04:19,699 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:04:19,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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:04:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:04:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2019-08-05 10:04:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:04:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 105 transitions. [2019-08-05 10:04:19,709 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 105 transitions. Word has length 21 [2019-08-05 10:04:19,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:19,709 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 105 transitions. [2019-08-05 10:04:19,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2019-08-05 10:04:19,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:04:19,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:19,711 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:04:19,711 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:19,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:19,711 INFO L82 PathProgramCache]: Analyzing trace with hash 957426083, now seen corresponding path program 1 times [2019-08-05 10:04:19,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:19,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:19,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:19,781 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:19,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:19,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:04:19,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:04:19,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:04:19,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:19,830 INFO L87 Difference]: Start difference. First operand 61 states and 105 transitions. Second operand 4 states. [2019-08-05 10:04:20,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:20,190 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2019-08-05 10:04:20,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:20,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-08-05 10:04:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:20,193 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:04:20,193 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:04:20,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:04:20,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:04:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 70. [2019-08-05 10:04:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:04:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 119 transitions. [2019-08-05 10:04:20,203 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 119 transitions. Word has length 21 [2019-08-05 10:04:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:20,203 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 119 transitions. [2019-08-05 10:04:20,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:04:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 119 transitions. [2019-08-05 10:04:20,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:04:20,205 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:20,205 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:04:20,205 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:20,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:20,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1963483633, now seen corresponding path program 1 times [2019-08-05 10:04:20,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:20,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:04:20,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:20,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:20,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:04:20,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:20,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:20,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:20,363 INFO L87 Difference]: Start difference. First operand 70 states and 119 transitions. Second operand 5 states. [2019-08-05 10:04:20,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:20,716 INFO L93 Difference]: Finished difference Result 78 states and 128 transitions. [2019-08-05 10:04:20,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:20,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-08-05 10:04:20,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:20,718 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:04:20,718 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:04:20,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:04:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2019-08-05 10:04:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:04:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 115 transitions. [2019-08-05 10:04:20,726 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 115 transitions. Word has length 22 [2019-08-05 10:04:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:20,727 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 115 transitions. [2019-08-05 10:04:20,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 115 transitions. [2019-08-05 10:04:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:04:20,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:20,728 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:04:20,728 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:20,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:20,729 INFO L82 PathProgramCache]: Analyzing trace with hash 313655323, now seen corresponding path program 1 times [2019-08-05 10:04:20,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:20,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:20,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:20,801 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:04:20,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:20,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:20,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:20,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:20,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:20,802 INFO L87 Difference]: Start difference. First operand 68 states and 115 transitions. Second operand 3 states. [2019-08-05 10:04:21,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:21,034 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2019-08-05 10:04:21,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:21,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-08-05 10:04:21,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:21,037 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:04:21,037 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:04:21,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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:21,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:04:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2019-08-05 10:04:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:04:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 113 transitions. [2019-08-05 10:04:21,045 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 113 transitions. Word has length 22 [2019-08-05 10:04:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:21,046 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 113 transitions. [2019-08-05 10:04:21,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 113 transitions. [2019-08-05 10:04:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:04:21,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:21,047 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:04:21,048 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:21,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:21,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1394521147, now seen corresponding path program 1 times [2019-08-05 10:04:21,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:21,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:21,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:21,161 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:04:21,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:21,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:21,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:21,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:21,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:21,163 INFO L87 Difference]: Start difference. First operand 68 states and 113 transitions. Second operand 3 states. [2019-08-05 10:04:21,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:21,311 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions. [2019-08-05 10:04:21,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:21,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-08-05 10:04:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:21,313 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:04:21,313 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:04:21,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:04:21,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2019-08-05 10:04:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:04:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 81 transitions. [2019-08-05 10:04:21,320 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 81 transitions. Word has length 22 [2019-08-05 10:04:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:21,320 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 81 transitions. [2019-08-05 10:04:21,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 81 transitions. [2019-08-05 10:04:21,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:04:21,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:21,322 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:04:21,322 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:21,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:21,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1293678603, now seen corresponding path program 1 times [2019-08-05 10:04:21,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:21,401 WARN L254 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:04:21,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:21,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:21,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:21,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:21,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:21,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:23,862 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 46 [2019-08-05 10:04:27,401 WARN L188 SmtUtils]: Spent 1.83 s on a formula simplification that was a NOOP. DAG size: 57 [2019-08-05 10:04:33,300 WARN L188 SmtUtils]: Spent 5.69 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-08-05 10:04:33,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:33,305 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:33,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:53,811 WARN L188 SmtUtils]: Spent 20.17 s on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-08-05 10:04:53,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:04:54,085 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-08-05 10:04:54,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:54,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:54,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:04:54,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:04:54,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:04:54,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=128, Unknown=1, NotChecked=0, Total=156 [2019-08-05 10:04:54,110 INFO L87 Difference]: Start difference. First operand 50 states and 81 transitions. Second operand 13 states. [2019-08-05 10:04:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:55,907 INFO L93 Difference]: Finished difference Result 77 states and 122 transitions. [2019-08-05 10:04:55,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:04:55,909 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-08-05 10:04:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:55,910 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:04:55,910 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:04:55,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=27, Invalid=128, Unknown=1, NotChecked=0, Total=156 [2019-08-05 10:04:55,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:04:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2019-08-05 10:04:55,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:04:55,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 104 transitions. [2019-08-05 10:04:55,916 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 104 transitions. Word has length 23 [2019-08-05 10:04:55,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:55,916 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 104 transitions. [2019-08-05 10:04:55,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:04:55,916 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2019-08-05 10:04:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:04:55,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:55,917 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:55,918 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:55,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:55,918 INFO L82 PathProgramCache]: Analyzing trace with hash -190766018, now seen corresponding path program 1 times [2019-08-05 10:04:55,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:55,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:04:55,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:56,750 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:05:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:09,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:09,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:05:09,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:05:09,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:05:09,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=93, Unknown=10, NotChecked=0, Total=132 [2019-08-05 10:05:09,178 INFO L87 Difference]: Start difference. First operand 65 states and 104 transitions. Second operand 12 states. [2019-08-05 10:05:17,135 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 10:05:31,522 WARN L188 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 30 [2019-08-05 10:05:35,100 WARN L188 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-08-05 10:05:48,223 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-08-05 10:06:17,302 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 28 [2019-08-05 10:06:26,208 WARN L188 SmtUtils]: Spent 1.96 s on a formula simplification that was a NOOP. DAG size: 37 [2019-08-05 10:06:28,221 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 10:06:30,376 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-08-05 10:06:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:30,541 INFO L93 Difference]: Finished difference Result 113 states and 177 transitions. [2019-08-05 10:06:30,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:06:30,542 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-08-05 10:06:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:30,543 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:06:30,544 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:06:30,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 51.3s TimeCoverageRelationStatistics Valid=107, Invalid=359, Unknown=40, NotChecked=0, Total=506 [2019-08-05 10:06:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:06:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 93. [2019-08-05 10:06:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:06:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 152 transitions. [2019-08-05 10:06:30,565 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 152 transitions. Word has length 24 [2019-08-05 10:06:30,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:30,566 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 152 transitions. [2019-08-05 10:06:30,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:06:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 152 transitions. [2019-08-05 10:06:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:06:30,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:30,571 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:06:30,571 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:30,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:30,572 INFO L82 PathProgramCache]: Analyzing trace with hash -131360725, now seen corresponding path program 1 times [2019-08-05 10:06:30,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:30,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:06:30,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:30,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:30,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:06:30,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:06:30,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:06:30,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:06:30,724 INFO L87 Difference]: Start difference. First operand 93 states and 152 transitions. Second operand 4 states. [2019-08-05 10:06:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:31,095 INFO L93 Difference]: Finished difference Result 92 states and 148 transitions. [2019-08-05 10:06:31,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:06:31,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-08-05 10:06:31,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:31,096 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:06:31,096 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:06:31,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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:06:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:06:31,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2019-08-05 10:06:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:06:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 124 transitions. [2019-08-05 10:06:31,101 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 124 transitions. Word has length 24 [2019-08-05 10:06:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:31,102 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 124 transitions. [2019-08-05 10:06:31,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:06:31,102 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 124 transitions. [2019-08-05 10:06:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:06:31,107 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:31,107 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:06:31,107 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:31,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:31,108 INFO L82 PathProgramCache]: Analyzing trace with hash 365264900, now seen corresponding path program 1 times [2019-08-05 10:06:31,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:31,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:06:31,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:31,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:31,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:06:31,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:06:31,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:06:31,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:06:31,161 INFO L87 Difference]: Start difference. First operand 78 states and 124 transitions. Second operand 3 states. [2019-08-05 10:06:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:31,228 INFO L93 Difference]: Finished difference Result 85 states and 131 transitions. [2019-08-05 10:06:31,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:06:31,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-08-05 10:06:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:31,230 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:06:31,230 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:06:31,231 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:06:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:06:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2019-08-05 10:06:31,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:06:31,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2019-08-05 10:06:31,236 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 24 [2019-08-05 10:06:31,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:31,237 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2019-08-05 10:06:31,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:06:31,237 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2019-08-05 10:06:31,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:06:31,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:31,238 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:06:31,238 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:31,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:31,239 INFO L82 PathProgramCache]: Analyzing trace with hash 280275458, now seen corresponding path program 1 times [2019-08-05 10:06:31,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:31,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:06:31,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:31,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:31,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:31,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:06:31,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:06:31,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:06:31,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:06:31,264 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand 3 states. [2019-08-05 10:06:31,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:31,396 INFO L93 Difference]: Finished difference Result 80 states and 122 transitions. [2019-08-05 10:06:31,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:06:31,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-08-05 10:06:31,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:31,398 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:06:31,398 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:06:31,399 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:06:31,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:06:31,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-08-05 10:06:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:06:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2019-08-05 10:06:31,403 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 24 [2019-08-05 10:06:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:31,403 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2019-08-05 10:06:31,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:06:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2019-08-05 10:06:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:06:31,404 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:31,404 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:06:31,405 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:31,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:31,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1521420112, now seen corresponding path program 1 times [2019-08-05 10:06:31,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:31,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:06:31,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:31,443 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:06:31,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:31,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:06:31,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:06:31,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:06:31,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:06:31,445 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand 3 states. [2019-08-05 10:06:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:31,557 INFO L93 Difference]: Finished difference Result 74 states and 112 transitions. [2019-08-05 10:06:31,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:06:31,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-08-05 10:06:31,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:31,558 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:06:31,559 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:06:31,559 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:06:31,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:06:31,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:06:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:06:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 104 transitions. [2019-08-05 10:06:31,563 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 104 transitions. Word has length 24 [2019-08-05 10:06:31,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:31,563 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 104 transitions. [2019-08-05 10:06:31,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:06:31,563 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 104 transitions. [2019-08-05 10:06:31,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:06:31,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:31,564 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:06:31,565 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:31,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:31,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2142850189, now seen corresponding path program 1 times [2019-08-05 10:06:31,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:31,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:06:31,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:31,629 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:31,672 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:31,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:32,072 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-08-05 10:06:32,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:06:32,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:06:32,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:06:32,481 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:06:32,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:32,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-08-05 10:06:32,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:06:32,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:06:32,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:06:32,483 INFO L87 Difference]: Start difference. First operand 70 states and 104 transitions. Second operand 12 states. [2019-08-05 10:06:33,701 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-08-05 10:06:38,052 WARN L188 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-08-05 10:06:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:41,024 INFO L93 Difference]: Finished difference Result 101 states and 148 transitions. [2019-08-05 10:06:41,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:06:41,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-08-05 10:06:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:41,027 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:06:41,027 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:06:41,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:06:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:06:41,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2019-08-05 10:06:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:06:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions. [2019-08-05 10:06:41,031 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 24 [2019-08-05 10:06:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:41,032 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 137 transitions. [2019-08-05 10:06:41,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:06:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2019-08-05 10:06:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:06:41,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:41,033 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:06:41,033 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:41,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:41,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2080554267, now seen corresponding path program 1 times [2019-08-05 10:06:41,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:41,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:06:41,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:41,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:41,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:41,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:41,396 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:41,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:41,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:41,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:41,651 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 29 [2019-08-05 10:06:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:41,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:41,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:06:41,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:06:41,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:06:41,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:06:41,840 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand 15 states. [2019-08-05 10:06:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:43,303 INFO L93 Difference]: Finished difference Result 133 states and 194 transitions. [2019-08-05 10:06:43,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:06:43,305 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-08-05 10:06:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:43,306 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:06:43,307 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:06:43,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:06:43,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:06:43,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 108. [2019-08-05 10:06:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:06:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2019-08-05 10:06:43,311 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 25 [2019-08-05 10:06:43,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:43,312 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2019-08-05 10:06:43,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:06:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2019-08-05 10:06:43,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:06:43,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:43,313 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:06:43,313 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:43,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:43,314 INFO L82 PathProgramCache]: Analyzing trace with hash 808804621, now seen corresponding path program 1 times [2019-08-05 10:06:43,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:43,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:06:43,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:43,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,544 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,585 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,595 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,601 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:43,631 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:44,463 WARN L188 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 407 DAG size of output: 179 [2019-08-05 10:06:44,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 10:06:44,999 WARN L188 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-08-05 10:06:45,504 WARN L188 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-08-05 10:06:51,120 WARN L188 SmtUtils]: Spent 5.40 s on a formula simplification that was a NOOP. DAG size: 177 [2019-08-05 10:06:51,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 10:06:51,251 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-08-05 10:07:38,550 WARN L188 SmtUtils]: Spent 46.96 s on a formula simplification. DAG size of input: 179 DAG size of output: 149 [2019-08-05 10:07:38,558 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:07:38,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:38,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-08-05 10:07:38,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:07:38,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:07:38,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:07:38,559 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand 11 states. Received shutdown request... [2019-08-05 10:09:04,614 WARN L188 SmtUtils]: Spent 1.21 m on a formula simplification that was a NOOP. DAG size: 242 [2019-08-05 10:09:04,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:09:04,616 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:09:04,622 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:09:04,623 INFO L202 PluginConnector]: Adding new model RanFile074.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:09:04 BoogieIcfgContainer [2019-08-05 10:09:04,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:09:04,625 INFO L168 Benchmark]: Toolchain (without parser) took 289536.96 ms. Allocated memory was 132.1 MB in the beginning and 339.2 MB in the end (delta: 207.1 MB). Free memory was 106.6 MB in the beginning and 197.9 MB in the end (delta: -91.3 MB). Peak memory consumption was 115.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:04,626 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 132.1 MB. Free memory was 108.5 MB in the beginning and 108.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:09:04,627 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.28 ms. Allocated memory is still 132.1 MB. Free memory was 106.4 MB in the beginning and 104.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:04,627 INFO L168 Benchmark]: Boogie Preprocessor took 78.35 ms. Allocated memory is still 132.1 MB. Free memory was 104.6 MB in the beginning and 102.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:04,628 INFO L168 Benchmark]: RCFGBuilder took 1643.47 ms. Allocated memory was 132.1 MB in the beginning and 172.5 MB in the end (delta: 40.4 MB). Free memory was 102.8 MB in the beginning and 144.0 MB in the end (delta: -41.2 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:04,629 INFO L168 Benchmark]: TraceAbstraction took 287771.02 ms. Allocated memory was 172.5 MB in the beginning and 339.2 MB in the end (delta: 166.7 MB). Free memory was 143.2 MB in the beginning and 197.9 MB in the end (delta: -54.7 MB). Peak memory consumption was 112.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:04,632 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.21 ms. Allocated memory is still 132.1 MB. Free memory was 108.5 MB in the beginning and 108.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.28 ms. Allocated memory is still 132.1 MB. Free memory was 106.4 MB in the beginning and 104.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.35 ms. Allocated memory is still 132.1 MB. Free memory was 104.6 MB in the beginning and 102.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1643.47 ms. Allocated memory was 132.1 MB in the beginning and 172.5 MB in the end (delta: 40.4 MB). Free memory was 102.8 MB in the beginning and 144.0 MB in the end (delta: -41.2 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 287771.02 ms. Allocated memory was 172.5 MB in the beginning and 339.2 MB in the end (delta: 166.7 MB). Free memory was 143.2 MB in the beginning and 197.9 MB in the end (delta: -54.7 MB). Peak memory consumption was 112.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 197]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 197). Cancelled while BasicCegarLoop was constructing difference of abstraction (108states) and FLOYD_HOARE automaton (currently 13 states, 11 states before enhancement),while ReachableStatesComputation was computing reachable states (111 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 198]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 198). Cancelled while BasicCegarLoop was constructing difference of abstraction (108states) and FLOYD_HOARE automaton (currently 13 states, 11 states before enhancement),while ReachableStatesComputation was computing reachable states (111 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 199). Cancelled while BasicCegarLoop was constructing difference of abstraction (108states) and FLOYD_HOARE automaton (currently 13 states, 11 states before enhancement),while ReachableStatesComputation was computing reachable states (111 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 3 error locations. TIMEOUT Result, 287.7s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 182.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 791 SDtfs, 385 SDslu, 323 SDs, 0 SdLazy, 3756 SolverSat, 138 SolverUnsat, 40 SolverUnknown, 0 SolverNotchecked, 65.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 267 SyntacticMatches, 9 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 218.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 147 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 104.4s InterpolantComputationTime, 364 NumberOfCodeBlocks, 364 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 348 ConstructedInterpolants, 78 QuantifiedInterpolants, 135489 SizeOfPredicates, 26 NumberOfNonLiveVariables, 884 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 17/21 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown