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/real-life/PricedTimedAutomata/u2b04_multiple_broadcast_SAFE.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:13:03,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:13:03,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:13:03,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:13:03,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:13:03,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:13:03,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:13:03,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:13:03,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:13:03,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:13:03,184 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:13:03,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:13:03,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:13:03,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:13:03,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:13:03,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:13:03,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:13:03,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:13:03,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:13:03,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:13:03,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:13:03,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:13:03,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:13:03,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:13:03,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:13:03,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:13:03,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:13:03,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:13:03,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:13:03,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:13:03,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:13:03,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:13:03,205 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:13:03,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:13:03,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:13:03,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:13:03,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:13:03,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:13:03,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:13:03,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:13:03,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:13:03,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:13:03,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:13:03,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:13:03,254 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:13:03,255 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:13:03,256 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b04_multiple_broadcast_SAFE.bpl [2019-08-05 10:13:03,256 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b04_multiple_broadcast_SAFE.bpl' [2019-08-05 10:13:03,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:13:03,309 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:13:03,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:13:03,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:13:03,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:13:03,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "u2b04_multiple_broadcast_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "u2b04_multiple_broadcast_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,346 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:13:03,346 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:13:03,346 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:13:03,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:13:03,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:13:03,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:13:03,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:13:03,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "u2b04_multiple_broadcast_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "u2b04_multiple_broadcast_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "u2b04_multiple_broadcast_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "u2b04_multiple_broadcast_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "u2b04_multiple_broadcast_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "u2b04_multiple_broadcast_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "u2b04_multiple_broadcast_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/1) ... [2019-08-05 10:13:03,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:13:03,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:13:03,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:13:03,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:13:03,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "u2b04_multiple_broadcast_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (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:13:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure perform_resets [2019-08-05 10:13:03,469 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:13:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:13:03,469 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:13:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_v [2019-08-05 10:13:03,604 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:13:04,729 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:13:04,729 INFO L283 CfgBuilder]: Removed 20 assume(true) statements. [2019-08-05 10:13:04,731 INFO L202 PluginConnector]: Adding new model u2b04_multiple_broadcast_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:13:04 BoogieIcfgContainer [2019-08-05 10:13:04,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:13:04,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:13:04,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:13:04,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:13:04,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b04_multiple_broadcast_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:03" (1/2) ... [2019-08-05 10:13:04,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7cc149 and model type u2b04_multiple_broadcast_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:13:04, skipping insertion in model container [2019-08-05 10:13:04,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b04_multiple_broadcast_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:13:04" (2/2) ... [2019-08-05 10:13:04,744 INFO L109 eAbstractionObserver]: Analyzing ICFG u2b04_multiple_broadcast_SAFE.bpl [2019-08-05 10:13:04,751 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:13:04,759 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:13:04,774 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:13:04,799 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:13:04,800 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:13:04,800 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:13:04,800 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:13:04,801 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:13:04,801 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:13:04,801 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:13:04,801 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:13:04,801 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:13:04,815 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-08-05 10:13:04,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:13:04,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:04,824 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:13:04,827 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:04,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:04,844 INFO L82 PathProgramCache]: Analyzing trace with hash 7722, now seen corresponding path program 1 times [2019-08-05 10:13:04,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:04,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:04,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:04,978 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:13:04,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:04,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:13:04,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:04,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:04,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:04,996 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-08-05 10:13:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:05,094 INFO L93 Difference]: Finished difference Result 55 states and 101 transitions. [2019-08-05 10:13:05,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:05,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:13:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:05,109 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:13:05,110 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:13:05,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:05,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:13:05,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2019-08-05 10:13:05,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:13:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 61 transitions. [2019-08-05 10:13:05,152 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 61 transitions. Word has length 2 [2019-08-05 10:13:05,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:05,153 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 61 transitions. [2019-08-05 10:13:05,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:05,153 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2019-08-05 10:13:05,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:13:05,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:05,154 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:05,154 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:05,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:05,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1915356777, now seen corresponding path program 1 times [2019-08-05 10:13:05,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:05,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:05,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:05,213 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:13:05,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:05,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:13:05,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:05,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:05,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:05,216 INFO L87 Difference]: Start difference. First operand 40 states and 61 transitions. Second operand 3 states. [2019-08-05 10:13:05,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:05,291 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2019-08-05 10:13:05,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:05,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-08-05 10:13:05,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:05,294 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:13:05,294 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:13:05,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 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:13:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:13:05,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2019-08-05 10:13:05,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:13:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2019-08-05 10:13:05,305 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 9 [2019-08-05 10:13:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:05,305 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2019-08-05 10:13:05,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2019-08-05 10:13:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:13:05,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:05,307 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:05,307 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:05,308 INFO L82 PathProgramCache]: Analyzing trace with hash 895723758, now seen corresponding path program 1 times [2019-08-05 10:13:05,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:05,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:05,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:05,386 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:13:05,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:05,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:13:05,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:05,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:05,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:05,388 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand 3 states. [2019-08-05 10:13:05,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:05,450 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2019-08-05 10:13:05,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:05,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-08-05 10:13:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:05,452 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:13:05,453 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:13:05,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 1 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:13:05,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:13:05,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2019-08-05 10:13:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:13:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2019-08-05 10:13:05,467 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 11 [2019-08-05 10:13:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:05,468 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2019-08-05 10:13:05,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2019-08-05 10:13:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:13:05,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:05,469 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:05,469 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:05,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:05,470 INFO L82 PathProgramCache]: Analyzing trace with hash 861204539, now seen corresponding path program 1 times [2019-08-05 10:13:05,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:05,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:05,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:05,532 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:13:05,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:05,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:13:05,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:05,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:05,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:05,533 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand 3 states. [2019-08-05 10:13:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:05,742 INFO L93 Difference]: Finished difference Result 160 states and 219 transitions. [2019-08-05 10:13:05,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:05,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-08-05 10:13:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:05,747 INFO L225 Difference]: With dead ends: 160 [2019-08-05 10:13:05,747 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:13:05,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 1 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:13:05,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:13:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2019-08-05 10:13:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 10:13:05,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 203 transitions. [2019-08-05 10:13:05,761 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 203 transitions. Word has length 14 [2019-08-05 10:13:05,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:05,761 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 203 transitions. [2019-08-05 10:13:05,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 203 transitions. [2019-08-05 10:13:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:13:05,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:05,762 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:05,762 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:05,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:05,763 INFO L82 PathProgramCache]: Analyzing trace with hash 970606724, now seen corresponding path program 1 times [2019-08-05 10:13:05,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:05,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:13:05,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:05,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,882 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:13:05,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:05,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:13:05,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:13:05,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:13:05,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:13:05,884 INFO L87 Difference]: Start difference. First operand 144 states and 203 transitions. Second operand 4 states. [2019-08-05 10:13:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:06,151 INFO L93 Difference]: Finished difference Result 232 states and 325 transitions. [2019-08-05 10:13:06,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:13:06,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-08-05 10:13:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:06,154 INFO L225 Difference]: With dead ends: 232 [2019-08-05 10:13:06,154 INFO L226 Difference]: Without dead ends: 232 [2019-08-05 10:13:06,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:13:06,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-08-05 10:13:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 180. [2019-08-05 10:13:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 10:13:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 259 transitions. [2019-08-05 10:13:06,169 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 259 transitions. Word has length 15 [2019-08-05 10:13:06,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:06,170 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 259 transitions. [2019-08-05 10:13:06,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:13:06,170 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 259 transitions. [2019-08-05 10:13:06,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:13:06,171 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:06,171 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:06,172 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:06,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:06,172 INFO L82 PathProgramCache]: Analyzing trace with hash -980000049, now seen corresponding path program 1 times [2019-08-05 10:13:06,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:06,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:06,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:06,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:06,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:06,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:06,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:06,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:06,241 INFO L87 Difference]: Start difference. First operand 180 states and 259 transitions. Second operand 3 states. [2019-08-05 10:13:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:06,387 INFO L93 Difference]: Finished difference Result 226 states and 314 transitions. [2019-08-05 10:13:06,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:06,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-08-05 10:13:06,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:06,389 INFO L225 Difference]: With dead ends: 226 [2019-08-05 10:13:06,389 INFO L226 Difference]: Without dead ends: 222 [2019-08-05 10:13:06,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 1 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:13:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-08-05 10:13:06,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-08-05 10:13:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 10:13:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 309 transitions. [2019-08-05 10:13:06,402 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 309 transitions. Word has length 22 [2019-08-05 10:13:06,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:06,403 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 309 transitions. [2019-08-05 10:13:06,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:06,403 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 309 transitions. [2019-08-05 10:13:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:13:06,404 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:06,404 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] [2019-08-05 10:13:06,405 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:06,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:06,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1175627116, now seen corresponding path program 1 times [2019-08-05 10:13:06,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:06,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:13:06,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:06,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:06,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:13:06,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:13:06,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:13:06,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:13:06,501 INFO L87 Difference]: Start difference. First operand 220 states and 309 transitions. Second operand 4 states. [2019-08-05 10:13:06,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:06,584 INFO L93 Difference]: Finished difference Result 339 states and 462 transitions. [2019-08-05 10:13:06,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:13:06,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-08-05 10:13:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:06,588 INFO L225 Difference]: With dead ends: 339 [2019-08-05 10:13:06,588 INFO L226 Difference]: Without dead ends: 339 [2019-08-05 10:13:06,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:13:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-08-05 10:13:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 303. [2019-08-05 10:13:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-08-05 10:13:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 428 transitions. [2019-08-05 10:13:06,603 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 428 transitions. Word has length 25 [2019-08-05 10:13:06,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:06,603 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 428 transitions. [2019-08-05 10:13:06,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:13:06,604 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 428 transitions. [2019-08-05 10:13:06,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:13:06,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:06,605 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:06,605 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:06,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:06,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1854667335, now seen corresponding path program 1 times [2019-08-05 10:13:06,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:06,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:06,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:06,664 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:06,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:06,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:06,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:06,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:06,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:06,666 INFO L87 Difference]: Start difference. First operand 303 states and 428 transitions. Second operand 3 states. [2019-08-05 10:13:06,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:06,707 INFO L93 Difference]: Finished difference Result 282 states and 390 transitions. [2019-08-05 10:13:06,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:06,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:13:06,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:06,709 INFO L225 Difference]: With dead ends: 282 [2019-08-05 10:13:06,710 INFO L226 Difference]: Without dead ends: 267 [2019-08-05 10:13:06,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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:13:06,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-08-05 10:13:06,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 257. [2019-08-05 10:13:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-08-05 10:13:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 355 transitions. [2019-08-05 10:13:06,718 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 355 transitions. Word has length 27 [2019-08-05 10:13:06,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:06,719 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 355 transitions. [2019-08-05 10:13:06,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:06,719 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 355 transitions. [2019-08-05 10:13:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:13:06,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:06,721 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:06,721 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:06,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:06,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1031479941, now seen corresponding path program 1 times [2019-08-05 10:13:06,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:06,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:06,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:06,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:06,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:06,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:13:06,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:13:06,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:13:06,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:06,917 INFO L87 Difference]: Start difference. First operand 257 states and 355 transitions. Second operand 5 states. [2019-08-05 10:13:07,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:07,300 INFO L93 Difference]: Finished difference Result 467 states and 625 transitions. [2019-08-05 10:13:07,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:13:07,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-08-05 10:13:07,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:07,303 INFO L225 Difference]: With dead ends: 467 [2019-08-05 10:13:07,304 INFO L226 Difference]: Without dead ends: 463 [2019-08-05 10:13:07,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-08-05 10:13:07,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 419. [2019-08-05 10:13:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-08-05 10:13:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 567 transitions. [2019-08-05 10:13:07,318 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 567 transitions. Word has length 30 [2019-08-05 10:13:07,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:07,318 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 567 transitions. [2019-08-05 10:13:07,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:13:07,318 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 567 transitions. [2019-08-05 10:13:07,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:13:07,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:07,321 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:07,321 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:07,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:07,322 INFO L82 PathProgramCache]: Analyzing trace with hash 133292730, now seen corresponding path program 1 times [2019-08-05 10:13:07,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:07,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:07,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:13:07,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:07,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:07,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:07,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:07,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:07,440 INFO L87 Difference]: Start difference. First operand 419 states and 567 transitions. Second operand 3 states. [2019-08-05 10:13:07,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:07,581 INFO L93 Difference]: Finished difference Result 530 states and 701 transitions. [2019-08-05 10:13:07,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:07,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-08-05 10:13:07,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:07,585 INFO L225 Difference]: With dead ends: 530 [2019-08-05 10:13:07,586 INFO L226 Difference]: Without dead ends: 505 [2019-08-05 10:13:07,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 1 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:13:07,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-08-05 10:13:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 498. [2019-08-05 10:13:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-08-05 10:13:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 668 transitions. [2019-08-05 10:13:07,597 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 668 transitions. Word has length 37 [2019-08-05 10:13:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:07,598 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 668 transitions. [2019-08-05 10:13:07,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 668 transitions. [2019-08-05 10:13:07,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:13:07,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:07,600 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:07,601 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:07,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:07,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1135242164, now seen corresponding path program 1 times [2019-08-05 10:13:07,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:07,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:07,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:13:07,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:07,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:07,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:07,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:07,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:07,653 INFO L87 Difference]: Start difference. First operand 498 states and 668 transitions. Second operand 3 states. [2019-08-05 10:13:07,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:07,778 INFO L93 Difference]: Finished difference Result 468 states and 589 transitions. [2019-08-05 10:13:07,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:07,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-08-05 10:13:07,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:07,782 INFO L225 Difference]: With dead ends: 468 [2019-08-05 10:13:07,782 INFO L226 Difference]: Without dead ends: 468 [2019-08-05 10:13:07,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 1 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:13:07,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-08-05 10:13:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 442. [2019-08-05 10:13:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-08-05 10:13:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 557 transitions. [2019-08-05 10:13:07,792 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 557 transitions. Word has length 38 [2019-08-05 10:13:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:07,793 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 557 transitions. [2019-08-05 10:13:07,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 557 transitions. [2019-08-05 10:13:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:13:07,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:07,795 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:07,795 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:07,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:07,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2026461761, now seen corresponding path program 1 times [2019-08-05 10:13:07,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:07,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:07,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:07,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,884 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,892 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,011 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-08-05 10:13:08,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:08,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:13:08,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:13:08,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:13:08,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:08,013 INFO L87 Difference]: Start difference. First operand 442 states and 557 transitions. Second operand 5 states. [2019-08-05 10:13:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:08,417 INFO L93 Difference]: Finished difference Result 485 states and 578 transitions. [2019-08-05 10:13:08,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:13:08,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-08-05 10:13:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:08,420 INFO L225 Difference]: With dead ends: 485 [2019-08-05 10:13:08,420 INFO L226 Difference]: Without dead ends: 455 [2019-08-05 10:13:08,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-08-05 10:13:08,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 427. [2019-08-05 10:13:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-08-05 10:13:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 523 transitions. [2019-08-05 10:13:08,430 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 523 transitions. Word has length 49 [2019-08-05 10:13:08,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:08,431 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 523 transitions. [2019-08-05 10:13:08,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:13:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 523 transitions. [2019-08-05 10:13:08,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:13:08,433 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:08,433 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:08,433 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:08,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:08,434 INFO L82 PathProgramCache]: Analyzing trace with hash -306060019, now seen corresponding path program 1 times [2019-08-05 10:13:08,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:08,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:13:08,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:13:08,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:08,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:13:08,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:13:08,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:13:08,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:13:08,565 INFO L87 Difference]: Start difference. First operand 427 states and 523 transitions. Second operand 4 states. [2019-08-05 10:13:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:08,745 INFO L93 Difference]: Finished difference Result 366 states and 431 transitions. [2019-08-05 10:13:08,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:13:08,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-08-05 10:13:08,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:08,749 INFO L225 Difference]: With dead ends: 366 [2019-08-05 10:13:08,749 INFO L226 Difference]: Without dead ends: 366 [2019-08-05 10:13:08,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:13:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-08-05 10:13:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 316. [2019-08-05 10:13:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-08-05 10:13:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 377 transitions. [2019-08-05 10:13:08,759 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 377 transitions. Word has length 50 [2019-08-05 10:13:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:08,759 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 377 transitions. [2019-08-05 10:13:08,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:13:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 377 transitions. [2019-08-05 10:13:08,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:13:08,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:08,762 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:08,762 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:08,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:08,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1102549146, now seen corresponding path program 1 times [2019-08-05 10:13:08,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:08,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:08,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:09,066 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 3 [2019-08-05 10:13:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-08-05 10:13:09,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:09,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:13:09,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:13:09,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:13:09,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:13:09,110 INFO L87 Difference]: Start difference. First operand 316 states and 377 transitions. Second operand 4 states. [2019-08-05 10:13:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:09,283 INFO L93 Difference]: Finished difference Result 383 states and 444 transitions. [2019-08-05 10:13:09,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:13:09,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-08-05 10:13:09,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:09,289 INFO L225 Difference]: With dead ends: 383 [2019-08-05 10:13:09,289 INFO L226 Difference]: Without dead ends: 383 [2019-08-05 10:13:09,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:13:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-08-05 10:13:09,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 345. [2019-08-05 10:13:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-08-05 10:13:09,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 406 transitions. [2019-08-05 10:13:09,299 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 406 transitions. Word has length 51 [2019-08-05 10:13:09,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:09,299 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 406 transitions. [2019-08-05 10:13:09,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:13:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 406 transitions. [2019-08-05 10:13:09,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:13:09,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:09,301 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:09,301 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:09,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:09,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1803007971, now seen corresponding path program 1 times [2019-08-05 10:13:09,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:09,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:13:09,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-08-05 10:13:09,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:09,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:13:09,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:13:09,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:13:09,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:13:09,382 INFO L87 Difference]: Start difference. First operand 345 states and 406 transitions. Second operand 3 states. [2019-08-05 10:13:09,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:09,419 INFO L93 Difference]: Finished difference Result 335 states and 388 transitions. [2019-08-05 10:13:09,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:13:09,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-08-05 10:13:09,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:09,423 INFO L225 Difference]: With dead ends: 335 [2019-08-05 10:13:09,423 INFO L226 Difference]: Without dead ends: 325 [2019-08-05 10:13:09,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 1 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:13:09,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-08-05 10:13:09,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 317. [2019-08-05 10:13:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-08-05 10:13:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 371 transitions. [2019-08-05 10:13:09,445 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 371 transitions. Word has length 52 [2019-08-05 10:13:09,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:09,445 INFO L475 AbstractCegarLoop]: Abstraction has 317 states and 371 transitions. [2019-08-05 10:13:09,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:13:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 371 transitions. [2019-08-05 10:13:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:13:09,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:09,448 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:09,449 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:09,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:09,449 INFO L82 PathProgramCache]: Analyzing trace with hash -141720680, now seen corresponding path program 1 times [2019-08-05 10:13:09,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:09,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:13:09,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:09,730 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 3 [2019-08-05 10:13:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:13:09,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:09,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:13:09,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:13:09,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:13:09,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:13:09,744 INFO L87 Difference]: Start difference. First operand 317 states and 371 transitions. Second operand 4 states. [2019-08-05 10:13:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:09,977 INFO L93 Difference]: Finished difference Result 168 states and 174 transitions. [2019-08-05 10:13:09,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:13:09,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-08-05 10:13:09,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:09,979 INFO L225 Difference]: With dead ends: 168 [2019-08-05 10:13:09,979 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 10:13:09,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:13:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 10:13:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2019-08-05 10:13:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 10:13:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2019-08-05 10:13:09,983 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 54 [2019-08-05 10:13:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:09,983 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2019-08-05 10:13:09,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:13:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2019-08-05 10:13:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:13:09,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:09,984 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:09,984 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:09,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:09,985 INFO L82 PathProgramCache]: Analyzing trace with hash -76915444, now seen corresponding path program 1 times [2019-08-05 10:13:09,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:10,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:10,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:10,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-08-05 10:13:10,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:10,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:13:10,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:13:10,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:13:10,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:10,216 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand 5 states. [2019-08-05 10:13:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:10,447 INFO L93 Difference]: Finished difference Result 151 states and 156 transitions. [2019-08-05 10:13:10,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:13:10,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-08-05 10:13:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:10,449 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:13:10,449 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:13:10,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:10,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:13:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-08-05 10:13:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 10:13:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 156 transitions. [2019-08-05 10:13:10,453 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 156 transitions. Word has length 57 [2019-08-05 10:13:10,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:10,454 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 156 transitions. [2019-08-05 10:13:10,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:13:10,454 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 156 transitions. [2019-08-05 10:13:10,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:13:10,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:10,455 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:10,455 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:10,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:10,455 INFO L82 PathProgramCache]: Analyzing trace with hash -73560679, now seen corresponding path program 1 times [2019-08-05 10:13:10,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:10,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:13:10,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:10,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-08-05 10:13:10,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:10,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:13:10,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:13:10,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:13:10,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:10,750 INFO L87 Difference]: Start difference. First operand 151 states and 156 transitions. Second operand 6 states. [2019-08-05 10:13:11,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:11,094 INFO L93 Difference]: Finished difference Result 170 states and 172 transitions. [2019-08-05 10:13:11,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:13:11,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-08-05 10:13:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:11,096 INFO L225 Difference]: With dead ends: 170 [2019-08-05 10:13:11,096 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 10:13:11,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 10:13:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2019-08-05 10:13:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 10:13:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 170 transitions. [2019-08-05 10:13:11,100 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 170 transitions. Word has length 62 [2019-08-05 10:13:11,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:11,101 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 170 transitions. [2019-08-05 10:13:11,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:13:11,101 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2019-08-05 10:13:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:13:11,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:11,102 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:11,102 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:11,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:11,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2109984067, now seen corresponding path program 1 times [2019-08-05 10:13:11,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:11,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:13:11,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:11,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,878 WARN L188 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 6 [2019-08-05 10:13:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-08-05 10:13:11,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:11,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:13:11,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:13:11,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:13:11,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:11,936 INFO L87 Difference]: Start difference. First operand 166 states and 170 transitions. Second operand 6 states. [2019-08-05 10:13:12,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:12,133 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2019-08-05 10:13:12,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:13:12,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-08-05 10:13:12,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:12,135 INFO L225 Difference]: With dead ends: 168 [2019-08-05 10:13:12,135 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 10:13:12,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 10:13:12,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-08-05 10:13:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 10:13:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-08-05 10:13:12,139 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 75 [2019-08-05 10:13:12,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:12,139 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-08-05 10:13:12,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:13:12,140 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-08-05 10:13:12,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:13:12,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:12,141 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:12,141 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:12,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:12,141 INFO L82 PathProgramCache]: Analyzing trace with hash -750371378, now seen corresponding path program 1 times [2019-08-05 10:13:12,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:12,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:12,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:12,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,520 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 3 [2019-08-05 10:13:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-08-05 10:13:12,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:12,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:13:12,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:13:12,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:13:12,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:13:12,531 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 5 states. [2019-08-05 10:13:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:12,652 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-08-05 10:13:12,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:13:12,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-08-05 10:13:12,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:12,653 INFO L225 Difference]: With dead ends: 161 [2019-08-05 10:13:12,654 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:13:12,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:12,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:13:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:13:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:13:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:13:12,655 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2019-08-05 10:13:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:12,655 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:13:12,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:13:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:13:12,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:13:12,661 INFO L202 PluginConnector]: Adding new model u2b04_multiple_broadcast_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:13:12 BoogieIcfgContainer [2019-08-05 10:13:12,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:13:12,662 INFO L168 Benchmark]: Toolchain (without parser) took 9353.23 ms. Allocated memory was 133.2 MB in the beginning and 235.4 MB in the end (delta: 102.2 MB). Free memory was 109.0 MB in the beginning and 208.4 MB in the end (delta: -99.4 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:12,663 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 110.7 MB in the beginning and 110.5 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:13:12,664 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.23 ms. Allocated memory is still 133.2 MB. Free memory was 108.8 MB in the beginning and 107.0 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:13:12,665 INFO L168 Benchmark]: Boogie Preprocessor took 44.89 ms. Allocated memory is still 133.2 MB. Free memory was 107.0 MB in the beginning and 105.3 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:13:12,666 INFO L168 Benchmark]: RCFGBuilder took 1336.98 ms. Allocated memory is still 133.2 MB. Free memory was 105.3 MB in the beginning and 67.1 MB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:13:12,667 INFO L168 Benchmark]: TraceAbstraction took 7925.32 ms. Allocated memory was 133.2 MB in the beginning and 235.4 MB in the end (delta: 102.2 MB). Free memory was 66.8 MB in the beginning and 208.4 MB in the end (delta: -141.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:13:12,671 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 133.2 MB. Free memory was 110.7 MB in the beginning and 110.5 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.23 ms. Allocated memory is still 133.2 MB. Free memory was 108.8 MB in the beginning and 107.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.89 ms. Allocated memory is still 133.2 MB. Free memory was 107.0 MB in the beginning and 105.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1336.98 ms. Allocated memory is still 133.2 MB. Free memory was 105.3 MB in the beginning and 67.1 MB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7925.32 ms. Allocated memory was 133.2 MB in the beginning and 235.4 MB in the end (delta: 102.2 MB). Free memory was 66.8 MB in the beginning and 208.4 MB in the end (delta: -141.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 187]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 2 error locations. SAFE Result, 7.8s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1088 SDtfs, 856 SDslu, 1064 SDs, 0 SdLazy, 595 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 759 GetRequests, 702 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=498occurred in iteration=10, 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.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 351 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 765 NumberOfCodeBlocks, 765 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 74509 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1574 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 790/853 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...