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/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:21:31,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:21:31,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:21:31,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:21:31,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:21:31,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:21:31,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:21:31,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:21:31,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:21:31,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:21:31,203 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:21:31,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:21:31,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:21:31,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:21:31,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:21:31,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:21:31,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:21:31,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:21:31,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:21:31,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:21:31,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:21:31,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:21:31,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:21:31,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:21:31,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:21:31,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:21:31,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:21:31,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:21:31,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:21:31,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:21:31,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:21:31,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:21:31,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:21:31,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:21:31,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:21:31,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:21:31,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:21:31,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:21:31,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:21:31,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:21:31,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:21:31,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:21:31,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:21:31,273 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:21:31,274 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:21:31,275 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:21:31,276 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl [2019-08-05 10:21:31,276 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl' [2019-08-05 10:21:31,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:21:31,351 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:21:31,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:31,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:21:31,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:21:31,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:31" (1/1) ... [2019-08-05 10:21:31,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:31" (1/1) ... [2019-08-05 10:21:31,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:31,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:21:31,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:21:31,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:21:31,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:31" (1/1) ... [2019-08-05 10:21:31,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:31" (1/1) ... [2019-08-05 10:21:31,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:31" (1/1) ... [2019-08-05 10:21:31,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:31" (1/1) ... [2019-08-05 10:21:31,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:31" (1/1) ... [2019-08-05 10:21:31,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:31" (1/1) ... [2019-08-05 10:21:31,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:31" (1/1) ... [2019-08-05 10:21:31,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:21:31,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:21:31,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:21:31,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:21:31,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:31" (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:21:31,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:21:31,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:21:32,083 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:21:32,290 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:21:32,290 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:21:32,291 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:32 BoogieIcfgContainer [2019-08-05 10:21:32,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:21:32,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:21:32,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:21:32,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:21:32,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:31" (1/2) ... [2019-08-05 10:21:32,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab8899f and model type s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:21:32, skipping insertion in model container [2019-08-05 10:21:32,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:32" (2/2) ... [2019-08-05 10:21:32,300 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil.c_16.bpl [2019-08-05 10:21:32,310 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:21:32,318 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:21:32,334 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:21:32,360 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:21:32,361 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:21:32,361 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:21:32,361 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:21:32,362 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:21:32,362 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:21:32,362 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:21:32,362 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:21:32,362 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:21:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-08-05 10:21:32,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:21:32,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:32,386 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:32,388 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:32,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:32,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1912595551, now seen corresponding path program 1 times [2019-08-05 10:21:32,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:32,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:21:32,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:32,594 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:21:32,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:32,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:21:32,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:32,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:32,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:32,620 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-08-05 10:21:32,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:32,724 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2019-08-05 10:21:32,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:32,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-08-05 10:21:32,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:32,739 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:21:32,739 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:21:32,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:21:32,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:21:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:21:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:21:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2019-08-05 10:21:32,781 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2019-08-05 10:21:32,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:32,781 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-08-05 10:21:32,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:32,782 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2019-08-05 10:21:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:21:32,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:32,784 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:32,785 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:32,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:32,785 INFO L82 PathProgramCache]: Analyzing trace with hash 15336861, now seen corresponding path program 1 times [2019-08-05 10:21:32,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:32,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:32,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:32,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:32,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:32,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:32,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:32,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:32,919 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 3 states. [2019-08-05 10:21:33,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:33,048 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2019-08-05 10:21:33,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:33,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-08-05 10:21:33,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:33,051 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:21:33,051 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:21:33,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:21:33,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:21:33,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:21:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:21:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2019-08-05 10:21:33,058 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 14 [2019-08-05 10:21:33,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:33,058 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-08-05 10:21:33,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:33,058 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2019-08-05 10:21:33,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:21:33,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:33,059 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:33,060 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:33,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:33,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1956215681, now seen corresponding path program 1 times [2019-08-05 10:21:33,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:33,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:33,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:21:33,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:33,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:33,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:33,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:33,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:33,145 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 3 states. [2019-08-05 10:21:33,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:33,332 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2019-08-05 10:21:33,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:33,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-08-05 10:21:33,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:33,334 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:21:33,334 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:21:33,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:33,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:21:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:21:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:21:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2019-08-05 10:21:33,340 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 19 [2019-08-05 10:21:33,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:33,341 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-08-05 10:21:33,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:33,341 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2019-08-05 10:21:33,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:21:33,342 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:33,342 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:33,345 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:33,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:33,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1565693373, now seen corresponding path program 1 times [2019-08-05 10:21:33,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:33,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:33,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 10:21:33,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:33,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:33,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:33,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:33,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:33,435 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand 3 states. [2019-08-05 10:21:33,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:33,552 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2019-08-05 10:21:33,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:33,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-08-05 10:21:33,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:33,555 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:21:33,556 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:21:33,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:21:33,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:21:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:21:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-08-05 10:21:33,568 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 25 [2019-08-05 10:21:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:33,568 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-08-05 10:21:33,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-08-05 10:21:33,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:21:33,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:33,571 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:33,571 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:33,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:33,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1933374943, now seen corresponding path program 1 times [2019-08-05 10:21:33,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:33,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:21:33,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-08-05 10:21:33,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:33,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:33,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:33,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:33,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:33,697 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 3 states. [2019-08-05 10:21:33,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:33,782 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-08-05 10:21:33,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:33,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-08-05 10:21:33,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:33,785 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:21:33,785 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:21:33,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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:21:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:21:33,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:21:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:21:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2019-08-05 10:21:33,793 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 32 [2019-08-05 10:21:33,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:33,793 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 71 transitions. [2019-08-05 10:21:33,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2019-08-05 10:21:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:21:33,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:33,795 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:33,795 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:33,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:33,796 INFO L82 PathProgramCache]: Analyzing trace with hash -222596977, now seen corresponding path program 1 times [2019-08-05 10:21:33,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:33,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:33,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-08-05 10:21:33,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:33,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:33,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:33,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:33,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:33,884 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. Second operand 3 states. [2019-08-05 10:21:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:34,186 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2019-08-05 10:21:34,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:34,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-08-05 10:21:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:34,188 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:21:34,188 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:21:34,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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:21:34,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:21:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:21:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:21:34,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2019-08-05 10:21:34,195 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 41 [2019-08-05 10:21:34,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:34,195 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2019-08-05 10:21:34,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:34,195 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2019-08-05 10:21:34,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:21:34,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:34,197 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:34,197 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:34,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:34,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1001043809, now seen corresponding path program 1 times [2019-08-05 10:21:34,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:34,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:21:34,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-08-05 10:21:34,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:34,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:34,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:34,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:34,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:34,333 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 3 states. [2019-08-05 10:21:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:34,468 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2019-08-05 10:21:34,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:34,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-08-05 10:21:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:34,470 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:21:34,471 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:21:34,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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:21:34,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:21:34,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2019-08-05 10:21:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:21:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2019-08-05 10:21:34,478 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 50 [2019-08-05 10:21:34,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:34,479 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2019-08-05 10:21:34,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2019-08-05 10:21:34,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:21:34,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:34,481 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 6, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:34,481 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:34,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:34,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1817627875, now seen corresponding path program 1 times [2019-08-05 10:21:34,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:34,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:21:34,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-05 10:21:34,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:34,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:34,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:34,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:34,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:34,577 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand 3 states. [2019-08-05 10:21:34,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:34,765 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2019-08-05 10:21:34,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:34,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-08-05 10:21:34,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:34,768 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:21:34,768 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:21:34,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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:21:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:21:34,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 87. [2019-08-05 10:21:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:21:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2019-08-05 10:21:34,777 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 56 [2019-08-05 10:21:34,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:34,777 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2019-08-05 10:21:34,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2019-08-05 10:21:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:21:34,779 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:34,779 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:34,779 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:34,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:34,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1051764193, now seen corresponding path program 1 times [2019-08-05 10:21:34,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:34,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:21:34,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 82 proven. 8 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-05 10:21:34,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:34,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:21:34,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:21:34,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:21:34,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:34,942 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand 4 states. [2019-08-05 10:21:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:35,396 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2019-08-05 10:21:35,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:21:35,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-08-05 10:21:35,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:35,399 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:21:35,399 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:21:35,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 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:21:35,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:21:35,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 10:21:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:21:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2019-08-05 10:21:35,407 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 63 [2019-08-05 10:21:35,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:35,407 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2019-08-05 10:21:35,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:21:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2019-08-05 10:21:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:21:35,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:35,409 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:35,410 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:35,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:35,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2001830647, now seen corresponding path program 2 times [2019-08-05 10:21:35,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:35,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:21:35,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:35,951 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-08-05 10:21:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 123 proven. 26 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-05 10:21:36,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:36,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:21:36,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:21:36,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:21:36,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:36,069 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand 5 states. [2019-08-05 10:21:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:36,375 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2019-08-05 10:21:36,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:21:36,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-08-05 10:21:36,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:36,380 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:21:36,381 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:21:36,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:21:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-08-05 10:21:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:21:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2019-08-05 10:21:36,387 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 73 [2019-08-05 10:21:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:36,388 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2019-08-05 10:21:36,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:21:36,388 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2019-08-05 10:21:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:21:36,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:36,390 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:36,390 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:36,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:36,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1874361807, now seen corresponding path program 3 times [2019-08-05 10:21:36,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:36,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:21:36,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:36,752 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-08-05 10:21:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 164 proven. 54 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-05 10:21:36,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:36,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:21:36,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:21:36,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:21:36,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:21:36,895 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand 6 states. [2019-08-05 10:21:37,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:37,406 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2019-08-05 10:21:37,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:21:37,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-08-05 10:21:37,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:37,408 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:21:37,408 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:21:37,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:21:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:21:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-08-05 10:21:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:21:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2019-08-05 10:21:37,415 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 83 [2019-08-05 10:21:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:37,416 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2019-08-05 10:21:37,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:21:37,416 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2019-08-05 10:21:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:21:37,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:37,417 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:21:37,418 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:37,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:37,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1742353753, now seen corresponding path program 4 times [2019-08-05 10:21:37,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:37,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:21:37,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:37,855 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-08-05 10:21:37,988 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-08-05 10:21:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 205 proven. 92 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-05 10:21:38,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:38,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:21:38,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:21:38,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:21:38,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:21:38,141 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 7 states. [2019-08-05 10:21:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:38,537 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2019-08-05 10:21:38,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:21:38,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-08-05 10:21:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:38,539 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:21:38,539 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:21:38,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:21:38,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:21:38,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:21:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:21:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:21:38,541 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2019-08-05 10:21:38,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:38,541 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:21:38,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:21:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:21:38,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:21:38,548 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:21:38 BoogieIcfgContainer [2019-08-05 10:21:38,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:21:38,550 INFO L168 Benchmark]: Toolchain (without parser) took 7200.29 ms. Allocated memory was 140.0 MB in the beginning and 245.4 MB in the end (delta: 105.4 MB). Free memory was 108.6 MB in the beginning and 61.1 MB in the end (delta: 47.5 MB). Peak memory consumption was 152.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:38,551 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory was 110.9 MB in the beginning and 110.7 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:21:38,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.59 ms. Allocated memory is still 140.0 MB. Free memory was 108.4 MB in the beginning and 106.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:38,553 INFO L168 Benchmark]: Boogie Preprocessor took 46.20 ms. Allocated memory is still 140.0 MB. Free memory was 106.8 MB in the beginning and 105.1 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:21:38,554 INFO L168 Benchmark]: RCFGBuilder took 843.79 ms. Allocated memory is still 140.0 MB. Free memory was 105.1 MB in the beginning and 72.8 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:38,555 INFO L168 Benchmark]: TraceAbstraction took 6254.79 ms. Allocated memory was 140.0 MB in the beginning and 245.4 MB in the end (delta: 105.4 MB). Free memory was 72.6 MB in the beginning and 61.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 116.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:38,560 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory was 110.9 MB in the beginning and 110.7 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 49.59 ms. Allocated memory is still 140.0 MB. Free memory was 108.4 MB in the beginning and 106.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.20 ms. Allocated memory is still 140.0 MB. Free memory was 106.8 MB in the beginning and 105.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 843.79 ms. Allocated memory is still 140.0 MB. Free memory was 105.1 MB in the beginning and 72.8 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6254.79 ms. Allocated memory was 140.0 MB in the beginning and 245.4 MB in the end (delta: 105.4 MB). Free memory was 72.6 MB in the beginning and 61.1 MB in the end (delta: 11.5 MB). Peak memory consumption was 116.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 419]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 6.1s OverallTime, 12 OverallIterations, 12 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 242 SDtfs, 33 SDslu, 112 SDs, 0 SdLazy, 891 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=11, 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, 12 MinimizatonAttempts, 27 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 559 NumberOfCodeBlocks, 559 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 547 ConstructedInterpolants, 0 QuantifiedInterpolants, 238559 SizeOfPredicates, 61 NumberOfNonLiveVariables, 3252 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 1371/1551 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...