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_srvr_1.cil.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:24:18,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:24:18,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:24:18,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:24:18,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:24:18,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:24:18,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:24:18,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:24:18,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:24:18,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:24:18,335 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:24:18,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:24:18,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:24:18,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:24:18,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:24:18,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:24:18,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:24:18,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:24:18,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:24:18,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:24:18,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:24:18,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:24:18,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:24:18,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:24:18,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:24:18,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:24:18,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:24:18,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:24:18,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:24:18,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:24:18,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:24:18,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:24:18,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:24:18,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:24:18,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:24:18,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:24:18,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:24:18,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:24:18,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:24:18,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:24:18,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:24:18,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:24:18,418 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:24:18,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:24:18,424 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:24:18,424 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:24:18,425 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl [2019-08-05 10:24:18,426 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.cil.c_23.bpl' [2019-08-05 10:24:18,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:24:18,490 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:24:18,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:24:18,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:24:18,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:24:18,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:18" (1/1) ... [2019-08-05 10:24:18,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:18" (1/1) ... [2019-08-05 10:24:18,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:24:18,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:24:18,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:24:18,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:24:18,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:18" (1/1) ... [2019-08-05 10:24:18,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:18" (1/1) ... [2019-08-05 10:24:18,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:18" (1/1) ... [2019-08-05 10:24:18,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:18" (1/1) ... [2019-08-05 10:24:18,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:18" (1/1) ... [2019-08-05 10:24:18,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:18" (1/1) ... [2019-08-05 10:24:18,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:18" (1/1) ... [2019-08-05 10:24:18,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:24:18,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:24:18,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:24:18,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:24:18,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:18" (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:24:18,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:24:18,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:24:19,334 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:24:19,334 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:24:19,335 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:24:19 BoogieIcfgContainer [2019-08-05 10:24:19,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:24:19,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:24:19,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:24:19,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:24:19,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:24:18" (1/2) ... [2019-08-05 10:24:19,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38bca85 and model type s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:24:19, skipping insertion in model container [2019-08-05 10:24:19,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:24:19" (2/2) ... [2019-08-05 10:24:19,345 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil.c_23.bpl [2019-08-05 10:24:19,355 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:24:19,362 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:24:19,377 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:24:19,404 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:24:19,405 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:24:19,405 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:24:19,406 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:24:19,406 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:24:19,406 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:24:19,406 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:24:19,406 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:24:19,407 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:24:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-08-05 10:24:19,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:24:19,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:19,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:19,431 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:19,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:19,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1511424245, now seen corresponding path program 1 times [2019-08-05 10:24:19,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:19,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:24:19,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:19,617 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:24:19,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:19,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:24:19,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:19,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:19,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:19,646 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-08-05 10:24:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:19,825 INFO L93 Difference]: Finished difference Result 35 states and 57 transitions. [2019-08-05 10:24:19,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:19,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-08-05 10:24:19,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:19,838 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:24:19,838 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:24:19,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:24:19,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:24:19,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:24:19,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:24:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 57 transitions. [2019-08-05 10:24:19,873 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 57 transitions. Word has length 16 [2019-08-05 10:24:19,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:19,874 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 57 transitions. [2019-08-05 10:24:19,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:19,874 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 57 transitions. [2019-08-05 10:24:19,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:24:19,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:19,875 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:19,876 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:19,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:19,876 INFO L82 PathProgramCache]: Analyzing trace with hash 769662029, now seen corresponding path program 1 times [2019-08-05 10:24:19,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:19,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:24:19,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:19,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:19,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:24:19,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:19,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:19,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:19,985 INFO L87 Difference]: Start difference. First operand 35 states and 57 transitions. Second operand 3 states. [2019-08-05 10:24:20,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:20,206 INFO L93 Difference]: Finished difference Result 39 states and 61 transitions. [2019-08-05 10:24:20,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:20,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-08-05 10:24:20,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:20,208 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:24:20,209 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:24:20,210 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:24:20,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:24:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:24:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:24:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2019-08-05 10:24:20,217 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 61 transitions. Word has length 19 [2019-08-05 10:24:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:20,218 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 61 transitions. [2019-08-05 10:24:20,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 61 transitions. [2019-08-05 10:24:20,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:24:20,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:20,219 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:20,219 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:20,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:20,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1665297163, now seen corresponding path program 1 times [2019-08-05 10:24:20,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:20,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:24:20,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:24:20,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:20,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:24:20,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:20,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:20,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:20,294 INFO L87 Difference]: Start difference. First operand 39 states and 61 transitions. Second operand 3 states. [2019-08-05 10:24:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:20,451 INFO L93 Difference]: Finished difference Result 44 states and 66 transitions. [2019-08-05 10:24:20,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:20,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-08-05 10:24:20,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:20,453 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:24:20,454 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:24:20,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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:24:20,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:24:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:24:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:24:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2019-08-05 10:24:20,461 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 23 [2019-08-05 10:24:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:20,461 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2019-08-05 10:24:20,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2019-08-05 10:24:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:24:20,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:20,463 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:20,463 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:20,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:20,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1612697411, now seen corresponding path program 1 times [2019-08-05 10:24:20,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:20,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:24:20,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 10:24:20,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:20,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:24:20,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:20,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:20,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:20,569 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand 3 states. [2019-08-05 10:24:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:20,698 INFO L93 Difference]: Finished difference Result 56 states and 78 transitions. [2019-08-05 10:24:20,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:20,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-08-05 10:24:20,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:20,700 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:24:20,701 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:24:20,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:24:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:24:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:24:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:24:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2019-08-05 10:24:20,708 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 28 [2019-08-05 10:24:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:20,709 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2019-08-05 10:24:20,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:20,709 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2019-08-05 10:24:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:24:20,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:20,711 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:20,711 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:20,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:20,711 INFO L82 PathProgramCache]: Analyzing trace with hash 728388993, now seen corresponding path program 1 times [2019-08-05 10:24:20,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:20,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:24:20,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 10:24:20,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:20,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:24:20,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:20,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:20,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:20,816 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand 3 states. [2019-08-05 10:24:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:20,923 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:24:20,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:20,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-08-05 10:24:20,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:20,925 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:24:20,925 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:24:20,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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:24:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:24:20,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:24:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:24:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2019-08-05 10:24:20,932 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 34 [2019-08-05 10:24:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:20,933 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2019-08-05 10:24:20,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:20,933 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2019-08-05 10:24:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:24:20,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:20,935 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:20,935 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:20,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:20,935 INFO L82 PathProgramCache]: Analyzing trace with hash -427787315, now seen corresponding path program 1 times [2019-08-05 10:24:20,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:20,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:24:20,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 10:24:21,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:21,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:24:21,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:21,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:21,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:21,043 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 3 states. [2019-08-05 10:24:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:21,230 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2019-08-05 10:24:21,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:21,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-08-05 10:24:21,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:21,236 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:24:21,236 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:24:21,236 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:24:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:24:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:24:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:24:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2019-08-05 10:24:21,245 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 41 [2019-08-05 10:24:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:21,246 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2019-08-05 10:24:21,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2019-08-05 10:24:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:24:21,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:21,248 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:21,249 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:21,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:21,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1814017687, now seen corresponding path program 1 times [2019-08-05 10:24:21,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:21,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:24:21,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 10:24:21,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:21,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:24:21,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:24:21,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:24:21,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:24:21,448 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand 4 states. [2019-08-05 10:24:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:21,984 INFO L93 Difference]: Finished difference Result 175 states and 223 transitions. [2019-08-05 10:24:21,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:24:21,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-08-05 10:24:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:21,987 INFO L225 Difference]: With dead ends: 175 [2019-08-05 10:24:21,987 INFO L226 Difference]: Without dead ends: 163 [2019-08-05 10:24:21,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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:24:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-08-05 10:24:21,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2019-08-05 10:24:21,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:24:22,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 173 transitions. [2019-08-05 10:24:22,000 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 173 transitions. Word has length 49 [2019-08-05 10:24:22,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:22,001 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 173 transitions. [2019-08-05 10:24:22,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:24:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2019-08-05 10:24:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:24:22,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:22,004 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:22,005 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:22,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:22,005 INFO L82 PathProgramCache]: Analyzing trace with hash -816367811, now seen corresponding path program 1 times [2019-08-05 10:24:22,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:22,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:24:22,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-05 10:24:22,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:22,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:24:22,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:22,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:22,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:22,114 INFO L87 Difference]: Start difference. First operand 125 states and 173 transitions. Second operand 3 states. [2019-08-05 10:24:22,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:22,244 INFO L93 Difference]: Finished difference Result 155 states and 203 transitions. [2019-08-05 10:24:22,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:22,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-08-05 10:24:22,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:22,247 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:24:22,247 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:24:22,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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:24:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:24:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-08-05 10:24:22,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-08-05 10:24:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 203 transitions. [2019-08-05 10:24:22,257 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 203 transitions. Word has length 58 [2019-08-05 10:24:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:22,257 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 203 transitions. [2019-08-05 10:24:22,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2019-08-05 10:24:22,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:24:22,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:22,259 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:22,260 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:22,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:22,260 INFO L82 PathProgramCache]: Analyzing trace with hash -463921139, now seen corresponding path program 1 times [2019-08-05 10:24:22,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:22,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:24:22,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-08-05 10:24:22,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:22,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:24:22,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:22,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:22,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:22,321 INFO L87 Difference]: Start difference. First operand 155 states and 203 transitions. Second operand 3 states. [2019-08-05 10:24:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:22,438 INFO L93 Difference]: Finished difference Result 188 states and 236 transitions. [2019-08-05 10:24:22,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:22,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-08-05 10:24:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:22,442 INFO L225 Difference]: With dead ends: 188 [2019-08-05 10:24:22,442 INFO L226 Difference]: Without dead ends: 188 [2019-08-05 10:24:22,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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:24:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-08-05 10:24:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-08-05 10:24:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 10:24:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 236 transitions. [2019-08-05 10:24:22,452 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 236 transitions. Word has length 68 [2019-08-05 10:24:22,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:22,453 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 236 transitions. [2019-08-05 10:24:22,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 236 transitions. [2019-08-05 10:24:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:24:22,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:22,455 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:22,455 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:22,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:22,456 INFO L82 PathProgramCache]: Analyzing trace with hash 301961549, now seen corresponding path program 1 times [2019-08-05 10:24:22,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:22,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:24:22,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-08-05 10:24:22,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:22,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:24:22,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:22,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:22,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:22,562 INFO L87 Difference]: Start difference. First operand 188 states and 236 transitions. Second operand 3 states. [2019-08-05 10:24:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:22,808 INFO L93 Difference]: Finished difference Result 224 states and 272 transitions. [2019-08-05 10:24:22,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:22,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-08-05 10:24:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:22,810 INFO L225 Difference]: With dead ends: 224 [2019-08-05 10:24:22,810 INFO L226 Difference]: Without dead ends: 224 [2019-08-05 10:24:22,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 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:24:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-08-05 10:24:22,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-08-05 10:24:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-08-05 10:24:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 272 transitions. [2019-08-05 10:24:22,823 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 272 transitions. Word has length 79 [2019-08-05 10:24:22,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:22,823 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 272 transitions. [2019-08-05 10:24:22,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:22,824 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 272 transitions. [2019-08-05 10:24:22,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:24:22,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:22,826 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:22,826 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:22,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:22,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1705437612, now seen corresponding path program 1 times [2019-08-05 10:24:22,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:22,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:24:22,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-08-05 10:24:22,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:22,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:24:22,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:22,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:22,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:22,931 INFO L87 Difference]: Start difference. First operand 224 states and 272 transitions. Second operand 3 states. [2019-08-05 10:24:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:23,101 INFO L93 Difference]: Finished difference Result 263 states and 339 transitions. [2019-08-05 10:24:23,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:23,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-08-05 10:24:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:23,105 INFO L225 Difference]: With dead ends: 263 [2019-08-05 10:24:23,105 INFO L226 Difference]: Without dead ends: 263 [2019-08-05 10:24:23,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 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:24:23,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-08-05 10:24:23,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2019-08-05 10:24:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-08-05 10:24:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 339 transitions. [2019-08-05 10:24:23,113 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 339 transitions. Word has length 91 [2019-08-05 10:24:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:23,114 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 339 transitions. [2019-08-05 10:24:23,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 339 transitions. [2019-08-05 10:24:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:24:23,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:23,116 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:23,116 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:23,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:23,117 INFO L82 PathProgramCache]: Analyzing trace with hash 655809876, now seen corresponding path program 1 times [2019-08-05 10:24:23,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:23,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:24:23,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:23,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:23,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:24:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 60 proven. 81 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2019-08-05 10:24:23,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:23,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:24:23,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:24:23,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:24:23,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:24:23,344 INFO L87 Difference]: Start difference. First operand 263 states and 339 transitions. Second operand 4 states. [2019-08-05 10:24:23,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:23,499 INFO L93 Difference]: Finished difference Result 418 states and 527 transitions. [2019-08-05 10:24:23,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:24:23,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-08-05 10:24:23,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:23,503 INFO L225 Difference]: With dead ends: 418 [2019-08-05 10:24:23,503 INFO L226 Difference]: Without dead ends: 418 [2019-08-05 10:24:23,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 1 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:24:23,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-08-05 10:24:23,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 354. [2019-08-05 10:24:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-08-05 10:24:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 457 transitions. [2019-08-05 10:24:23,512 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 457 transitions. Word has length 104 [2019-08-05 10:24:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:23,513 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 457 transitions. [2019-08-05 10:24:23,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:24:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 457 transitions. [2019-08-05 10:24:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 10:24:23,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:23,515 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 10, 9, 8, 7, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:23,515 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:23,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:23,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1149348051, now seen corresponding path program 2 times [2019-08-05 10:24:23,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:23,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:24:23,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-08-05 10:24:23,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:24:23,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:24:23,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:24:23,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:24:23,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:24:23,635 INFO L87 Difference]: Start difference. First operand 354 states and 457 transitions. Second operand 3 states. [2019-08-05 10:24:24,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:24,093 INFO L93 Difference]: Finished difference Result 367 states and 438 transitions. [2019-08-05 10:24:24,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:24:24,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-08-05 10:24:24,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:24,098 INFO L225 Difference]: With dead ends: 367 [2019-08-05 10:24:24,098 INFO L226 Difference]: Without dead ends: 367 [2019-08-05 10:24:24,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 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:24:24,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-08-05 10:24:24,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 353. [2019-08-05 10:24:24,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-08-05 10:24:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 424 transitions. [2019-08-05 10:24:24,106 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 424 transitions. Word has length 129 [2019-08-05 10:24:24,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:24,106 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 424 transitions. [2019-08-05 10:24:24,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:24:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 424 transitions. [2019-08-05 10:24:24,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-08-05 10:24:24,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:24,108 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:24:24,109 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:24,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:24,109 INFO L82 PathProgramCache]: Analyzing trace with hash 619884813, now seen corresponding path program 1 times [2019-08-05 10:24:24,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:24,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:24:24,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1262 backedges. 737 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2019-08-05 10:24:24,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:24,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:24:24,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:24:24,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:24:24,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:24:24,295 INFO L87 Difference]: Start difference. First operand 353 states and 424 transitions. Second operand 4 states. [2019-08-05 10:24:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:24,615 INFO L93 Difference]: Finished difference Result 294 states and 346 transitions. [2019-08-05 10:24:24,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:24:24,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-08-05 10:24:24,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:24,616 INFO L225 Difference]: With dead ends: 294 [2019-08-05 10:24:24,616 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:24:24,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 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:24:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:24:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:24:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:24:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:24:24,618 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 183 [2019-08-05 10:24:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:24,619 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:24:24,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:24:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:24:24,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:24:24,624 INFO L202 PluginConnector]: Adding new model s3_srvr_1.cil.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:24:24 BoogieIcfgContainer [2019-08-05 10:24:24,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:24:24,627 INFO L168 Benchmark]: Toolchain (without parser) took 6136.38 ms. Allocated memory was 132.6 MB in the beginning and 240.6 MB in the end (delta: 108.0 MB). Free memory was 108.0 MB in the beginning and 72.2 MB in the end (delta: 35.9 MB). Peak memory consumption was 143.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:24:24,627 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory was 110.3 MB in the beginning and 110.1 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:24:24,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.98 ms. Allocated memory is still 132.6 MB. Free memory was 107.8 MB in the beginning and 106.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:24:24,629 INFO L168 Benchmark]: Boogie Preprocessor took 64.92 ms. Allocated memory is still 132.6 MB. Free memory was 106.1 MB in the beginning and 104.5 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:24:24,630 INFO L168 Benchmark]: RCFGBuilder took 724.02 ms. Allocated memory is still 132.6 MB. Free memory was 104.5 MB in the beginning and 78.1 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:24:24,631 INFO L168 Benchmark]: TraceAbstraction took 5287.24 ms. Allocated memory was 132.6 MB in the beginning and 240.6 MB in the end (delta: 108.0 MB). Free memory was 77.6 MB in the beginning and 72.2 MB in the end (delta: 5.5 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:24:24,635 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.20 ms. Allocated memory is still 132.6 MB. Free memory was 110.3 MB in the beginning and 110.1 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 51.98 ms. Allocated memory is still 132.6 MB. Free memory was 107.8 MB in the beginning and 106.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.92 ms. Allocated memory is still 132.6 MB. Free memory was 106.1 MB in the beginning and 104.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 724.02 ms. Allocated memory is still 132.6 MB. Free memory was 104.5 MB in the beginning and 78.1 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5287.24 ms. Allocated memory was 132.6 MB in the beginning and 240.6 MB in the end (delta: 108.0 MB). Free memory was 77.6 MB in the beginning and 72.2 MB in the end (delta: 5.5 MB). Peak memory consumption was 113.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 516]: 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, 20 locations, 1 error locations. SAFE Result, 5.2s OverallTime, 14 OverallIterations, 19 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 413 SDtfs, 66 SDslu, 166 SDs, 0 SdLazy, 490 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 913 GetRequests, 892 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 116 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 922 NumberOfCodeBlocks, 922 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 908 ConstructedInterpolants, 0 QuantifiedInterpolants, 142787 SizeOfPredicates, 6 NumberOfNonLiveVariables, 5355 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 3289/3386 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...