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/MarkovChains/Klaus.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:07:12,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:07:12,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:07:12,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:07:12,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:07:12,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:07:12,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:07:12,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:07:12,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:07:12,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:07:12,245 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:07:12,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:07:12,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:07:12,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:07:12,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:07:12,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:07:12,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:07:12,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:07:12,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:07:12,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:07:12,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:07:12,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:07:12,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:07:12,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:07:12,268 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:07:12,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:07:12,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:07:12,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:07:12,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:07:12,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:07:12,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:07:12,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:07:12,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:07:12,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:07:12,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:07:12,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:07:12,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:07:12,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:07:12,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:07:12,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:07:12,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:07:12,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:07:12,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:07:12,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:07:12,336 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:07:12,337 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:07:12,338 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/MarkovChains/Klaus.bpl [2019-08-05 10:07:12,338 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/MarkovChains/Klaus.bpl' [2019-08-05 10:07:12,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:07:12,377 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:07:12,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:07:12,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:07:12,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:07:12,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Klaus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:12" (1/1) ... [2019-08-05 10:07:12,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Klaus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:12" (1/1) ... [2019-08-05 10:07:12,410 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:07:12,410 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:07:12,411 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:07:12,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:07:12,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:07:12,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:07:12,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:07:12,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Klaus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:12" (1/1) ... [2019-08-05 10:07:12,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Klaus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:12" (1/1) ... [2019-08-05 10:07:12,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Klaus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:12" (1/1) ... [2019-08-05 10:07:12,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Klaus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:12" (1/1) ... [2019-08-05 10:07:12,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Klaus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:12" (1/1) ... [2019-08-05 10:07:12,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Klaus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:12" (1/1) ... [2019-08-05 10:07:12,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Klaus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:12" (1/1) ... [2019-08-05 10:07:12,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:07:12,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:07:12,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:07:12,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:07:12,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Klaus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:12" (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:07:12,516 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:07:12,516 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:07:12,516 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:07:12,947 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:07:12,947 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:07:12,949 INFO L202 PluginConnector]: Adding new model Klaus.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:07:12 BoogieIcfgContainer [2019-08-05 10:07:12,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:07:12,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:07:12,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:07:12,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:07:12,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Klaus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:07:12" (1/2) ... [2019-08-05 10:07:12,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb5477b and model type Klaus.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:07:12, skipping insertion in model container [2019-08-05 10:07:12,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Klaus.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:07:12" (2/2) ... [2019-08-05 10:07:12,958 INFO L109 eAbstractionObserver]: Analyzing ICFG Klaus.bpl [2019-08-05 10:07:12,968 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:07:12,976 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:07:12,993 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:07:13,033 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:07:13,034 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:07:13,034 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:07:13,035 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:07:13,035 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:07:13,035 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:07:13,035 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:07:13,035 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:07:13,035 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:07:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 10:07:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:07:13,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:13,058 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:07:13,061 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:13,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:13,068 INFO L82 PathProgramCache]: Analyzing trace with hash 965, now seen corresponding path program 1 times [2019-08-05 10:07:13,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:13,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:07:13,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:13,223 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:07:13,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:13,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:07:13,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:13,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:13,243 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-08-05 10:07:13,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:13,291 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:07:13,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:13,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:07:13,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:13,302 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:07:13,303 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:07:13,305 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:07:13,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:07:13,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-08-05 10:07:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:07:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:07:13,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 2 [2019-08-05 10:07:13,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:13,341 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:07:13,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:07:13,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:07:13,342 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:13,342 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:07:13,343 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:13,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:13,343 INFO L82 PathProgramCache]: Analyzing trace with hash 29952, now seen corresponding path program 1 times [2019-08-05 10:07:13,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:13,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:07:13,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:13,424 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:07:13,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:13,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:07:13,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:13,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:13,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:13,427 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 3 states. [2019-08-05 10:07:13,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:13,449 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:07:13,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:13,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:07:13,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:13,451 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:07:13,451 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:07:13,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:07:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-08-05 10:07:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:07:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:07:13,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 3 [2019-08-05 10:07:13,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:13,455 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:07:13,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:07:13,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:07:13,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:13,456 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:07:13,457 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:13,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:13,457 INFO L82 PathProgramCache]: Analyzing trace with hash 928551, now seen corresponding path program 1 times [2019-08-05 10:07:13,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:13,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:07:13,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:13,523 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:07:13,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:13,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:07:13,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:13,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:13,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:13,525 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 3 states. [2019-08-05 10:07:13,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:13,565 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:07:13,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:13,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 10:07:13,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:13,567 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:07:13,567 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:07:13,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:07:13,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:07:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:07:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:07:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:07:13,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 4 [2019-08-05 10:07:13,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:13,571 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:07:13,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:13,571 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:07:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:07:13,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:13,572 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:07:13,572 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:13,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:13,573 INFO L82 PathProgramCache]: Analyzing trace with hash 28785612, now seen corresponding path program 1 times [2019-08-05 10:07:13,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:13,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:07:13,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:13,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:13,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:07:13,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:13,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:13,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:13,655 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 3 states. [2019-08-05 10:07:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:13,689 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:07:13,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:13,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 10:07:13,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:13,690 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:07:13,690 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:07:13,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:07:13,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:07:13,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:07:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:07:13,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:07:13,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2019-08-05 10:07:13,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:13,694 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:07:13,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:07:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:07:13,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:13,706 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:07:13,706 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:13,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:13,707 INFO L82 PathProgramCache]: Analyzing trace with hash 892354009, now seen corresponding path program 1 times [2019-08-05 10:07:13,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:13,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:07:13,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:13,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:13,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:07:13,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:07:13,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:07:13,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:13,871 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 4 states. [2019-08-05 10:07:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:14,061 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:07:14,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:07:14,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 10:07:14,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:14,063 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:07:14,063 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:07:14,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:07:14,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:07:14,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-08-05 10:07:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:07:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:07:14,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 6 [2019-08-05 10:07:14,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:14,066 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:07:14,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:07:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:07:14,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:07:14,067 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:14,067 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 10:07:14,068 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:14,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1893170542, now seen corresponding path program 1 times [2019-08-05 10:07:14,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:14,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:07:14,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:14,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:14,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:07:14,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:07:14,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:07:14,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:14,266 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 4 states. [2019-08-05 10:07:14,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:14,311 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:07:14,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:07:14,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 10:07:14,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:14,313 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:07:14,313 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:07:14,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:07:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:07:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:07:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:07:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:07:14,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2019-08-05 10:07:14,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:14,317 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:07:14,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:07:14,317 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:07:14,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:07:14,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:14,318 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1] [2019-08-05 10:07:14,318 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:14,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:14,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1729226144, now seen corresponding path program 2 times [2019-08-05 10:07:14,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:14,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:07:14,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:14,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:07:14,673 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-08-05 10:07:14,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:07:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:14,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:14,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:07:14,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:07:14,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:07:14,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:07:14,852 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2019-08-05 10:07:15,364 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-08-05 10:07:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:15,439 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:07:15,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:07:15,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 10:07:15,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:15,441 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:07:15,441 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:07:15,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:07:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:07:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:07:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:07:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:07:15,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:07:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:15,446 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:07:15,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:07:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:07:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:07:15,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:15,447 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1] [2019-08-05 10:07:15,447 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:15,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:15,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2066402873, now seen corresponding path program 2 times [2019-08-05 10:07:15,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:15,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:07:15,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:15,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:15,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:15,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:07:15,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:07:15,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:07:15,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:07:15,685 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 5 states. [2019-08-05 10:07:15,896 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-08-05 10:07:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:15,906 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:07:15,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:07:15,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-08-05 10:07:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:15,907 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:07:15,907 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:07:15,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:07:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:07:15,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:07:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:07:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:07:15,909 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-08-05 10:07:15,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:15,909 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:07:15,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:07:15,909 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:07:15,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:07:15,915 INFO L202 PluginConnector]: Adding new model Klaus.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:07:15 BoogieIcfgContainer [2019-08-05 10:07:15,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:07:15,919 INFO L168 Benchmark]: Toolchain (without parser) took 3540.86 ms. Allocated memory was 141.6 MB in the beginning and 204.5 MB in the end (delta: 62.9 MB). Free memory was 111.1 MB in the beginning and 167.0 MB in the end (delta: -55.9 MB). Peak memory consumption was 7.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:15,920 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.6 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:07:15,921 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.65 ms. Allocated memory is still 141.6 MB. Free memory was 111.1 MB in the beginning and 109.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:15,922 INFO L168 Benchmark]: Boogie Preprocessor took 28.89 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 107.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:15,922 INFO L168 Benchmark]: RCFGBuilder took 506.10 ms. Allocated memory is still 141.6 MB. Free memory was 107.8 MB in the beginning and 95.5 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:15,923 INFO L168 Benchmark]: TraceAbstraction took 2965.75 ms. Allocated memory was 141.6 MB in the beginning and 204.5 MB in the end (delta: 62.9 MB). Free memory was 95.1 MB in the beginning and 167.0 MB in the end (delta: -71.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:07:15,928 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.6 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.65 ms. Allocated memory is still 141.6 MB. Free memory was 111.1 MB in the beginning and 109.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.89 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 107.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 506.10 ms. Allocated memory is still 141.6 MB. Free memory was 107.8 MB in the beginning and 95.5 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2965.75 ms. Allocated memory was 141.6 MB in the beginning and 204.5 MB in the end (delta: 62.9 MB). Free memory was 95.1 MB in the beginning and 167.0 MB in the end (delta: -71.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 36]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 32]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 34]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 3 error locations. SAFE Result, 2.8s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 34 SDtfs, 20 SDslu, 21 SDs, 0 SdLazy, 81 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=6, 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.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 3354 SizeOfPredicates, 39 NumberOfNonLiveVariables, 235 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 1/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...