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_3.cil.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:16:33,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:16:33,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:16:33,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:16:33,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:16:33,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:16:33,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:16:33,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:16:33,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:16:33,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:16:33,137 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:16:33,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:16:33,138 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:16:33,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:16:33,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:16:33,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:16:33,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:16:33,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:16:33,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:16:33,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:16:33,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:16:33,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:16:33,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:16:33,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:16:33,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:16:33,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:16:33,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:16:33,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:16:33,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:16:33,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:16:33,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:16:33,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:16:33,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:16:33,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:16:33,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:16:33,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:16:33,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:16:33,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:16:33,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:16:33,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:16:33,172 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:16:33,207 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:16:33,220 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:16:33,223 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:16:33,224 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:16:33,225 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:16:33,226 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl [2019-08-05 10:16:33,226 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl' [2019-08-05 10:16:33,289 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:16:33,291 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:16:33,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:16:33,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:16:33,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:16:33,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:33" (1/1) ... [2019-08-05 10:16:33,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:33" (1/1) ... [2019-08-05 10:16:33,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:16:33,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:16:33,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:16:33,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:16:33,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:33" (1/1) ... [2019-08-05 10:16:33,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:33" (1/1) ... [2019-08-05 10:16:33,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:33" (1/1) ... [2019-08-05 10:16:33,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:33" (1/1) ... [2019-08-05 10:16:33,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:33" (1/1) ... [2019-08-05 10:16:33,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:33" (1/1) ... [2019-08-05 10:16:33,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:33" (1/1) ... [2019-08-05 10:16:33,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:16:33,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:16:33,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:16:33,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:16:33,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:33" (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:16:33,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:16:33,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:16:34,256 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:16:34,256 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:16:34,257 INFO L202 PluginConnector]: Adding new model s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:16:34 BoogieIcfgContainer [2019-08-05 10:16:34,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:16:34,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:16:34,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:16:34,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:16:34,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:33" (1/2) ... [2019-08-05 10:16:34,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296c836e and model type s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:16:34, skipping insertion in model container [2019-08-05 10:16:34,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:16:34" (2/2) ... [2019-08-05 10:16:34,266 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c_20.bpl [2019-08-05 10:16:34,276 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:16:34,284 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:16:34,302 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:16:34,329 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:16:34,330 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:16:34,330 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:16:34,330 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:16:34,330 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:16:34,330 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:16:34,331 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:16:34,331 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:16:34,331 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:16:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-08-05 10:16:34,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:16:34,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:34,353 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:34,356 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:34,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:34,362 INFO L82 PathProgramCache]: Analyzing trace with hash -505433777, now seen corresponding path program 1 times [2019-08-05 10:16:34,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:34,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:34,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:34,550 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:16:34,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:34,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:16:34,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:34,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:34,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:34,577 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-08-05 10:16:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:34,718 INFO L93 Difference]: Finished difference Result 31 states and 52 transitions. [2019-08-05 10:16:34,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:34,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-08-05 10:16:34,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:34,752 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:16:34,752 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:16:34,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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:16:34,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:16:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:16:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:16:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 52 transitions. [2019-08-05 10:16:34,802 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 52 transitions. Word has length 15 [2019-08-05 10:16:34,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:34,803 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 52 transitions. [2019-08-05 10:16:34,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 52 transitions. [2019-08-05 10:16:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:16:34,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:34,806 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:34,807 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:34,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:34,809 INFO L82 PathProgramCache]: Analyzing trace with hash 994659063, now seen corresponding path program 1 times [2019-08-05 10:16:34,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:34,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:34,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:34,902 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:16:34,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:34,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:34,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:34,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:34,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:34,906 INFO L87 Difference]: Start difference. First operand 31 states and 52 transitions. Second operand 3 states. [2019-08-05 10:16:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:35,073 INFO L93 Difference]: Finished difference Result 35 states and 56 transitions. [2019-08-05 10:16:35,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:35,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-08-05 10:16:35,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:35,077 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:16:35,077 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:16:35,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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:16:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:16:35,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:16:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:16:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2019-08-05 10:16:35,085 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 18 [2019-08-05 10:16:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:35,085 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2019-08-05 10:16:35,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:35,086 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2019-08-05 10:16:35,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:16:35,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:35,086 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:35,087 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:35,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:35,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1054659463, now seen corresponding path program 1 times [2019-08-05 10:16:35,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:35,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:35,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:35,194 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:16:35,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:35,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:35,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:35,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:35,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:35,196 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 3 states. [2019-08-05 10:16:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:35,407 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. [2019-08-05 10:16:35,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:35,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-08-05 10:16:35,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:35,410 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:16:35,410 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:16:35,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:35,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:16:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:16:35,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:16:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 61 transitions. [2019-08-05 10:16:35,417 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 61 transitions. Word has length 22 [2019-08-05 10:16:35,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:35,417 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 61 transitions. [2019-08-05 10:16:35,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2019-08-05 10:16:35,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:16:35,419 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:35,419 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:35,420 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:35,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:35,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1471998087, now seen corresponding path program 1 times [2019-08-05 10:16:35,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:35,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:35,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:35,515 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:16:35,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:35,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:35,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:35,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:35,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:35,517 INFO L87 Difference]: Start difference. First operand 40 states and 61 transitions. Second operand 3 states. [2019-08-05 10:16:35,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:35,635 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2019-08-05 10:16:35,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:35,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:16:35,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:35,636 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:16:35,638 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:16:35,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:16:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:16:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:16:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2019-08-05 10:16:35,647 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 73 transitions. Word has length 27 [2019-08-05 10:16:35,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:35,648 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 73 transitions. [2019-08-05 10:16:35,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:35,648 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 73 transitions. [2019-08-05 10:16:35,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:16:35,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:35,649 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] [2019-08-05 10:16:35,650 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:35,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:35,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1270422339, now seen corresponding path program 1 times [2019-08-05 10:16:35,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:35,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:35,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:35,741 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:16:35,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:35,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:35,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:35,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:35,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:35,743 INFO L87 Difference]: Start difference. First operand 52 states and 73 transitions. Second operand 3 states. [2019-08-05 10:16:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:36,023 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2019-08-05 10:16:36,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:36,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-08-05 10:16:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:36,027 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:16:36,027 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:16:36,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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:16:36,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:16:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:16:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:16:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2019-08-05 10:16:36,045 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 33 [2019-08-05 10:16:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:36,046 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2019-08-05 10:16:36,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2019-08-05 10:16:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:16:36,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:36,048 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] [2019-08-05 10:16:36,048 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:36,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:36,049 INFO L82 PathProgramCache]: Analyzing trace with hash -983630985, now seen corresponding path program 1 times [2019-08-05 10:16:36,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:36,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:36,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:36,186 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:16:36,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:36,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:36,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:36,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:36,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:36,190 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand 3 states. [2019-08-05 10:16:36,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:36,318 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2019-08-05 10:16:36,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:36,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-08-05 10:16:36,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:36,322 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:16:36,322 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:16:36,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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:16:36,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:16:36,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:16:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:16:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2019-08-05 10:16:36,331 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 40 [2019-08-05 10:16:36,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:36,331 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2019-08-05 10:16:36,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:36,332 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2019-08-05 10:16:36,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:16:36,333 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:36,333 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] [2019-08-05 10:16:36,334 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:36,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:36,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956691, now seen corresponding path program 1 times [2019-08-05 10:16:36,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:36,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:36,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:36,512 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:16:36,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:36,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:16:36,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:16:36,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:16:36,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:36,514 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand 4 states. [2019-08-05 10:16:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:37,073 INFO L93 Difference]: Finished difference Result 169 states and 216 transitions. [2019-08-05 10:16:37,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:16:37,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-08-05 10:16:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:37,077 INFO L225 Difference]: With dead ends: 169 [2019-08-05 10:16:37,077 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:16:37,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:16:37,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:16:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 121. [2019-08-05 10:16:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:16:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 168 transitions. [2019-08-05 10:16:37,087 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 168 transitions. Word has length 48 [2019-08-05 10:16:37,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:37,088 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 168 transitions. [2019-08-05 10:16:37,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:16:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 168 transitions. [2019-08-05 10:16:37,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:16:37,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:37,090 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] [2019-08-05 10:16:37,090 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:37,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:37,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1913328135, now seen corresponding path program 1 times [2019-08-05 10:16:37,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:37,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:37,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:37,179 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:16:37,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:37,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:37,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:37,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:37,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:37,181 INFO L87 Difference]: Start difference. First operand 121 states and 168 transitions. Second operand 3 states. [2019-08-05 10:16:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:37,288 INFO L93 Difference]: Finished difference Result 151 states and 198 transitions. [2019-08-05 10:16:37,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:37,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-08-05 10:16:37,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:37,291 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:16:37,292 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:16:37,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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:16:37,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:16:37,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-08-05 10:16:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 10:16:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 198 transitions. [2019-08-05 10:16:37,302 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 198 transitions. Word has length 57 [2019-08-05 10:16:37,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:37,302 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 198 transitions. [2019-08-05 10:16:37,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 198 transitions. [2019-08-05 10:16:37,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:16:37,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:37,305 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] [2019-08-05 10:16:37,305 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:37,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:37,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1816080585, now seen corresponding path program 1 times [2019-08-05 10:16:37,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:37,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:37,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:37,390 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:16:37,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:37,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:37,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:37,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:37,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:37,392 INFO L87 Difference]: Start difference. First operand 151 states and 198 transitions. Second operand 3 states. [2019-08-05 10:16:37,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:37,555 INFO L93 Difference]: Finished difference Result 184 states and 231 transitions. [2019-08-05 10:16:37,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:37,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-08-05 10:16:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:37,558 INFO L225 Difference]: With dead ends: 184 [2019-08-05 10:16:37,559 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 10:16:37,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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:16:37,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 10:16:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-08-05 10:16:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:16:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 231 transitions. [2019-08-05 10:16:37,568 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 231 transitions. Word has length 67 [2019-08-05 10:16:37,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:37,568 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 231 transitions. [2019-08-05 10:16:37,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 231 transitions. [2019-08-05 10:16:37,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:16:37,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:37,571 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] [2019-08-05 10:16:37,571 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:37,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:37,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1256666615, now seen corresponding path program 1 times [2019-08-05 10:16:37,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:37,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:37,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:37,649 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:16:37,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:37,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:37,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:37,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:37,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:37,651 INFO L87 Difference]: Start difference. First operand 184 states and 231 transitions. Second operand 3 states. [2019-08-05 10:16:37,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:37,759 INFO L93 Difference]: Finished difference Result 220 states and 267 transitions. [2019-08-05 10:16:37,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:37,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-08-05 10:16:37,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:37,761 INFO L225 Difference]: With dead ends: 220 [2019-08-05 10:16:37,761 INFO L226 Difference]: Without dead ends: 220 [2019-08-05 10:16:37,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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:16:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-08-05 10:16:37,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-08-05 10:16:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-08-05 10:16:37,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 267 transitions. [2019-08-05 10:16:37,770 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 267 transitions. Word has length 78 [2019-08-05 10:16:37,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:37,770 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 267 transitions. [2019-08-05 10:16:37,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 267 transitions. [2019-08-05 10:16:37,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:16:37,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:37,773 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] [2019-08-05 10:16:37,773 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:37,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:37,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1673954584, now seen corresponding path program 1 times [2019-08-05 10:16:37,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:37,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:37,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:37,877 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:16:37,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:37,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:37,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:37,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:37,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:37,879 INFO L87 Difference]: Start difference. First operand 220 states and 267 transitions. Second operand 3 states. [2019-08-05 10:16:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:38,102 INFO L93 Difference]: Finished difference Result 259 states and 334 transitions. [2019-08-05 10:16:38,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:38,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-08-05 10:16:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:38,108 INFO L225 Difference]: With dead ends: 259 [2019-08-05 10:16:38,109 INFO L226 Difference]: Without dead ends: 259 [2019-08-05 10:16:38,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 88 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:16:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-08-05 10:16:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-08-05 10:16:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-08-05 10:16:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 334 transitions. [2019-08-05 10:16:38,117 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 334 transitions. Word has length 90 [2019-08-05 10:16:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:38,118 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 334 transitions. [2019-08-05 10:16:38,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 334 transitions. [2019-08-05 10:16:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:16:38,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:38,122 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] [2019-08-05 10:16:38,122 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:38,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1439385072, now seen corresponding path program 1 times [2019-08-05 10:16:38,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:38,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:16:38,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:38,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:38,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:38,315 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:16:38,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:38,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:16:38,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:16:38,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:16:38,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:38,317 INFO L87 Difference]: Start difference. First operand 259 states and 334 transitions. Second operand 4 states. [2019-08-05 10:16:38,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:38,498 INFO L93 Difference]: Finished difference Result 412 states and 520 transitions. [2019-08-05 10:16:38,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:16:38,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-08-05 10:16:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:38,501 INFO L225 Difference]: With dead ends: 412 [2019-08-05 10:16:38,501 INFO L226 Difference]: Without dead ends: 412 [2019-08-05 10:16:38,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 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:16:38,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-08-05 10:16:38,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 349. [2019-08-05 10:16:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-08-05 10:16:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 451 transitions. [2019-08-05 10:16:38,510 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 451 transitions. Word has length 103 [2019-08-05 10:16:38,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:38,510 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 451 transitions. [2019-08-05 10:16:38,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:16:38,511 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 451 transitions. [2019-08-05 10:16:38,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:16:38,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:38,513 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] [2019-08-05 10:16:38,513 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:38,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:38,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1755108375, now seen corresponding path program 2 times [2019-08-05 10:16:38,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:38,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:38,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:38,628 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:16:38,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:38,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:38,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:38,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:38,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:38,629 INFO L87 Difference]: Start difference. First operand 349 states and 451 transitions. Second operand 3 states. [2019-08-05 10:16:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:39,101 INFO L93 Difference]: Finished difference Result 362 states and 432 transitions. [2019-08-05 10:16:39,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:39,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-08-05 10:16:39,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:39,104 INFO L225 Difference]: With dead ends: 362 [2019-08-05 10:16:39,104 INFO L226 Difference]: Without dead ends: 362 [2019-08-05 10:16:39,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 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:16:39,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-08-05 10:16:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 348. [2019-08-05 10:16:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-08-05 10:16:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 418 transitions. [2019-08-05 10:16:39,112 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 418 transitions. Word has length 128 [2019-08-05 10:16:39,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:39,113 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 418 transitions. [2019-08-05 10:16:39,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 418 transitions. [2019-08-05 10:16:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-08-05 10:16:39,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:39,115 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:39,115 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:39,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:39,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1179294915, now seen corresponding path program 1 times [2019-08-05 10:16:39,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:39,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:39,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 736 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2019-08-05 10:16:39,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:39,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:16:39,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:16:39,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:16:39,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:39,321 INFO L87 Difference]: Start difference. First operand 348 states and 418 transitions. Second operand 4 states. [2019-08-05 10:16:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:39,810 INFO L93 Difference]: Finished difference Result 290 states and 342 transitions. [2019-08-05 10:16:39,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:16:39,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-08-05 10:16:39,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:39,812 INFO L225 Difference]: With dead ends: 290 [2019-08-05 10:16:39,812 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:16:39,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 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:16:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:16:39,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:16:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:16:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:16:39,815 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 180 [2019-08-05 10:16:39,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:39,815 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:16:39,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:16:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:16:39,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:16:39,820 INFO L202 PluginConnector]: Adding new model s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:16:39 BoogieIcfgContainer [2019-08-05 10:16:39,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:16:39,824 INFO L168 Benchmark]: Toolchain (without parser) took 6531.45 ms. Allocated memory was 132.6 MB in the beginning and 240.1 MB in the end (delta: 107.5 MB). Free memory was 108.9 MB in the beginning and 76.9 MB in the end (delta: 32.0 MB). Peak memory consumption was 139.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:39,824 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:16:39,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.99 ms. Allocated memory is still 132.6 MB. Free memory was 108.9 MB in the beginning and 107.2 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:16:39,826 INFO L168 Benchmark]: Boogie Preprocessor took 45.46 ms. Allocated memory is still 132.6 MB. Free memory was 107.2 MB in the beginning and 105.5 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:16:39,827 INFO L168 Benchmark]: RCFGBuilder took 876.10 ms. Allocated memory is still 132.6 MB. Free memory was 105.5 MB in the beginning and 79.0 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:39,828 INFO L168 Benchmark]: TraceAbstraction took 5562.04 ms. Allocated memory was 132.6 MB in the beginning and 240.1 MB in the end (delta: 107.5 MB). Free memory was 78.5 MB in the beginning and 76.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 109.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:39,832 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.99 ms. Allocated memory is still 132.6 MB. Free memory was 108.9 MB in the beginning and 107.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.46 ms. Allocated memory is still 132.6 MB. Free memory was 107.2 MB in the beginning and 105.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 876.10 ms. Allocated memory is still 132.6 MB. Free memory was 105.5 MB in the beginning and 79.0 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5562.04 ms. Allocated memory was 132.6 MB in the beginning and 240.1 MB in the end (delta: 107.5 MB). Free memory was 78.5 MB in the beginning and 76.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 109.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 506]: 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, 18 locations, 1 error locations. SAFE Result, 5.4s OverallTime, 14 OverallIterations, 19 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 372 SDtfs, 55 SDslu, 125 SDs, 0 SdLazy, 482 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 897 GetRequests, 876 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred 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, 113 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 892 ConstructedInterpolants, 0 QuantifiedInterpolants, 138440 SizeOfPredicates, 6 NumberOfNonLiveVariables, 5404 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 3288/3385 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...