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/sum04.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:21:50,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:21:50,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:21:50,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:21:50,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:21:50,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:21:50,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:21:50,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:21:50,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:21:50,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:21:50,206 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:21:50,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:21:50,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:21:50,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:21:50,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:21:50,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:21:50,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:21:50,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:21:50,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:21:50,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:21:50,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:21:50,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:21:50,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:21:50,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:21:50,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:21:50,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:21:50,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:21:50,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:21:50,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:21:50,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:21:50,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:21:50,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:21:50,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:21:50,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:21:50,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:21:50,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:21:50,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:21:50,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:21:50,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:21:50,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:21:50,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:21:50,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:21:50,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:21:50,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:21:50,313 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:21:50,314 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:21:50,315 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_3.bpl [2019-08-05 10:21:50,315 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_3.bpl' [2019-08-05 10:21:50,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:21:50,357 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:21:50,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:50,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:21:50,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:21:50,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:50" (1/1) ... [2019-08-05 10:21:50,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:50" (1/1) ... [2019-08-05 10:21:50,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:50,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:21:50,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:21:50,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:21:50,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:50" (1/1) ... [2019-08-05 10:21:50,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:50" (1/1) ... [2019-08-05 10:21:50,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:50" (1/1) ... [2019-08-05 10:21:50,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:50" (1/1) ... [2019-08-05 10:21:50,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:50" (1/1) ... [2019-08-05 10:21:50,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:50" (1/1) ... [2019-08-05 10:21:50,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:50" (1/1) ... [2019-08-05 10:21:50,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:21:50,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:21:50,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:21:50,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:21:50,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:21:50,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:21:50,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:21:50,661 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:21:50,661 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:21:50,662 INFO L202 PluginConnector]: Adding new model sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:50 BoogieIcfgContainer [2019-08-05 10:21:50,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:21:50,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:21:50,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:21:50,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:21:50,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:50" (1/2) ... [2019-08-05 10:21:50,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6208ffc and model type sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:21:50, skipping insertion in model container [2019-08-05 10:21:50,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:50" (2/2) ... [2019-08-05 10:21:50,676 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04.i_3.bpl [2019-08-05 10:21:50,686 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:21:50,693 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:21:50,711 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:21:50,737 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:21:50,737 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:21:50,737 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:21:50,738 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:21:50,738 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:21:50,738 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:21:50,738 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:21:50,738 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:21:50,739 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:21:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:21:50,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:21:50,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:50,761 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:21:50,764 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:50,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:50,769 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:21:50,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:50,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:21:50,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:50,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:50,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:21:50,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:50,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:50,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:50,927 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:21:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:50,960 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:21:50,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:50,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:21:50,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:50,972 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:21:50,973 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:21:50,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:50,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:21:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:21:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:21:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:21:51,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:21:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:51,010 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:21:51,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:21:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:21:51,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:51,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:21:51,012 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:51,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:51,013 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:21:51,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:51,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:51,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:51,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:51,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:21:51,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:21:51,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:21:51,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:51,164 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:21:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:51,210 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:21:51,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:21:51,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:21:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:51,213 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:21:51,213 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:21:51,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:51,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:21:51,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:21:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:21:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:21:51,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:21:51,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:51,217 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:21:51,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:21:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:21:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:21:51,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:51,218 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:21:51,218 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:51,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:51,219 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:21:51,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:51,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:21:51,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:51,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:51,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:21:51,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:21:51,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:21:51,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:51,322 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:21:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:51,364 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:21:51,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:21:51,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:21:51,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:51,365 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:21:51,366 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:21:51,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:21:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:21:51,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:21:51,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:21:51,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:21:51,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:51,369 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:21:51,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:21:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:21:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:21:51,370 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:51,370 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:21:51,371 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:51,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:51,371 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:21:51,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:51,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:21:51,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:51,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:51,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:21:51,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:21:51,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:21:51,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:21:51,458 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:21:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:51,492 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:21:51,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:21:51,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:21:51,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:51,494 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:21:51,495 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:21:51,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:21:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:21:51,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:21:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:21:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:21:51,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:21:51,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:51,498 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:21:51,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:21:51,499 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:21:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:21:51,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:51,500 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:21:51,500 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:51,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:21:51,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:51,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:21:51,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:51,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:51,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:21:51,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:21:51,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:21:51,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:21:51,779 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:21:51,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:51,824 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:21:51,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:21:51,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:21:51,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:51,826 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:21:51,826 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:21:51,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:21:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:21:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:21:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:21:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:21:51,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:21:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:51,830 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:21:51,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:21:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:21:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:21:51,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:51,832 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:21:51,832 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:51,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:51,833 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:21:51,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:51,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:21:51,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:52,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:52,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:21:52,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:21:52,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:21:52,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:21:52,109 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:21:52,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:52,149 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:21:52,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:21:52,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:21:52,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:52,151 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:21:52,151 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:21:52,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:21:52,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:21:52,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:21:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:21:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:21:52,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:21:52,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:52,155 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:21:52,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:21:52,155 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:21:52,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:21:52,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:52,156 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:21:52,156 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:52,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:52,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:21:52,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:52,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:21:52,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:52,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:52,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:21:52,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:21:52,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:21:52,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:21:52,418 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:21:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:52,449 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:21:52,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:21:52,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:21:52,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:52,451 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:21:52,451 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:21:52,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:21:52,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:21:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:21:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:21:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:21:52,456 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:21:52,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:52,457 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:21:52,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:21:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:21:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:21:52,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:52,458 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:21:52,458 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:52,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:52,459 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:21:52,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:52,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:21:52,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:52,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:52,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:21:52,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:21:52,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:21:52,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:21:52,677 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:21:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:52,713 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:21:52,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:21:52,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:21:52,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:52,714 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:21:52,715 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:21:52,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:21:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:21:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:21:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:21:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:21:52,719 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:21:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:52,720 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:21:52,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:21:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:21:52,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:21:52,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:52,721 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:21:52,721 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:52,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:52,721 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:21:52,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:52,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:21:52,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:53,181 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:53,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:53,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:21:53,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:21:53,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:21:53,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:53,183 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:21:53,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:53,290 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:21:53,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:21:53,292 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:21:53,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:53,292 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:21:53,293 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:21:53,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:21:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:21:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:21:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:21:53,295 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:21:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:53,296 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:21:53,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:21:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:21:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:21:53,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:53,296 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:21:53,297 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:53,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:53,297 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:21:53,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:53,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:21:53,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:53,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:53,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-08-05 10:21:53,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:21:53,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:21:53,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:53,481 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2019-08-05 10:21:53,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:53,507 INFO L93 Difference]: Finished difference Result 10 states and 9 transitions. [2019-08-05 10:21:53,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:21:53,508 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-08-05 10:21:53,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:53,509 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:21:53,509 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:21:53,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:53,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:21:53,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:21:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:21:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:21:53,511 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-08-05 10:21:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:53,511 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:21:53,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:21:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:21:53,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:21:53,516 INFO L202 PluginConnector]: Adding new model sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:21:53 BoogieIcfgContainer [2019-08-05 10:21:53,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:21:53,519 INFO L168 Benchmark]: Toolchain (without parser) took 3161.69 ms. Allocated memory was 134.7 MB in the beginning and 169.9 MB in the end (delta: 35.1 MB). Free memory was 112.3 MB in the beginning and 66.5 MB in the end (delta: 45.8 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:53,520 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 134.7 MB. Free memory was 113.5 MB in the beginning and 113.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:21:53,521 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.45 ms. Allocated memory is still 134.7 MB. Free memory was 112.1 MB in the beginning and 110.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:21:53,522 INFO L168 Benchmark]: Boogie Preprocessor took 22.70 ms. Allocated memory is still 134.7 MB. Free memory was 110.5 MB in the beginning and 109.5 MB in the end (delta: 970.8 kB). Peak memory consumption was 970.8 kB. Max. memory is 7.1 GB. [2019-08-05 10:21:53,523 INFO L168 Benchmark]: RCFGBuilder took 244.40 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 100.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:53,524 INFO L168 Benchmark]: TraceAbstraction took 2852.98 ms. Allocated memory was 134.7 MB in the beginning and 169.9 MB in the end (delta: 35.1 MB). Free memory was 99.8 MB in the beginning and 66.5 MB in the end (delta: 33.3 MB). Peak memory consumption was 68.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:21:53,528 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.25 ms. Allocated memory is still 134.7 MB. Free memory was 113.5 MB in the beginning and 113.3 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 37.45 ms. Allocated memory is still 134.7 MB. Free memory was 112.1 MB in the beginning and 110.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.70 ms. Allocated memory is still 134.7 MB. Free memory was 110.5 MB in the beginning and 109.5 MB in the end (delta: 970.8 kB). Peak memory consumption was 970.8 kB. Max. memory is 7.1 GB. * RCFGBuilder took 244.40 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 100.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2852.98 ms. Allocated memory was 134.7 MB in the beginning and 169.9 MB in the end (delta: 35.1 MB). Free memory was 99.8 MB in the beginning and 66.5 MB in the end (delta: 33.3 MB). Peak memory consumption was 68.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: 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, 5 locations, 1 error locations. SAFE Result, 2.7s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 28 SDtfs, 0 SDslu, 30 SDs, 0 SdLazy, 186 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 1363 SizeOfPredicates, 10 NumberOfNonLiveVariables, 365 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 45/165 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...