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_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:38:40,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:38:40,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:38:40,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:38:40,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:38:40,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:38:40,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:38:40,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:38:40,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:38:40,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:38:40,396 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:38:40,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:38:40,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:38:40,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:38:40,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:38:40,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:38:40,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:38:40,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:38:40,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:38:40,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:38:40,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:38:40,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:38:40,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:38:40,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:38:40,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:38:40,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:38:40,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:38:40,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:38:40,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:38:40,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:38:40,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:38:40,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:38:40,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:38:40,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:38:40,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:38:40,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:38:40,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:38:40,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:38:40,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:38:40,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:38:40,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:38:40,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:38:40,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:38:40,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:38:40,510 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:38:40,511 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:38:40,512 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_4.bpl [2019-08-04 21:38:40,512 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_4.bpl' [2019-08-04 21:38:40,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:38:40,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:38:40,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:40,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:38:40,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:38:40,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:40" (1/1) ... [2019-08-04 21:38:40,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:40" (1/1) ... [2019-08-04 21:38:40,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:40,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:38:40,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:38:40,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:38:40,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:40" (1/1) ... [2019-08-04 21:38:40,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:40" (1/1) ... [2019-08-04 21:38:40,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:40" (1/1) ... [2019-08-04 21:38:40,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:40" (1/1) ... [2019-08-04 21:38:40,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:40" (1/1) ... [2019-08-04 21:38:40,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:40" (1/1) ... [2019-08-04 21:38:40,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:40" (1/1) ... [2019-08-04 21:38:40,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:38:40,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:38:40,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:38:40,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:38:40,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:40" (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-04 21:38:40,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:38:40,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:38:40,866 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-04 21:38:40,902 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:38:40,902 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:38:40,903 INFO L202 PluginConnector]: Adding new model sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:40 BoogieIcfgContainer [2019-08-04 21:38:40,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:38:40,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:38:40,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:38:40,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:38:40,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:40" (1/2) ... [2019-08-04 21:38:40,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db056c8 and model type sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:38:40, skipping insertion in model container [2019-08-04 21:38:40,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:40" (2/2) ... [2019-08-04 21:38:40,912 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04.i_4.bpl [2019-08-04 21:38:40,922 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:38:40,930 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:38:40,945 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:38:40,972 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:38:40,973 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:38:40,973 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:38:40,973 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:38:40,974 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:38:40,974 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:38:40,974 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:38:40,974 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:38:40,974 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:38:40,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:38:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:38:40,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:40,997 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:38:41,000 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:41,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:41,006 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-04 21:38:41,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:41,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:38:41,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:41,166 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-04 21:38:41,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:41,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:38:41,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:41,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:41,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:41,233 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:38:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:41,292 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:38:41,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:41,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:38:41,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:41,313 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:38:41,313 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:38:41,316 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-04 21:38:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:38:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-04 21:38:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:38:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:38:41,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-04 21:38:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:41,347 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:38:41,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:38:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:38:41,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:41,348 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-04 21:38:41,348 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:41,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:41,348 INFO L82 PathProgramCache]: Analyzing trace with hash 28858994, now seen corresponding path program 1 times [2019-08-04 21:38:41,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:41,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:41,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:41,437 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-04 21:38:41,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:41,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:38:41,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:41,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:41,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:41,440 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2019-08-04 21:38:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:41,481 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:38:41,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:38:41,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-04 21:38:41,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:41,483 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:38:41,483 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:38:41,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:38:41,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-08-04 21:38:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:38:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:38:41,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-04 21:38:41,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:41,487 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:38:41,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:41,487 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:38:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:38:41,488 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:41,488 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-04 21:38:41,488 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:41,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:41,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1963761697, now seen corresponding path program 2 times [2019-08-04 21:38:41,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:41,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:38:41,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:41,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:41,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:38:41,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:38:41,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:38:41,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:41,583 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2019-08-04 21:38:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:41,666 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:38:41,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:38:41,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-04 21:38:41,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:41,667 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:38:41,667 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:38:41,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-04 21:38:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:38:41,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-04 21:38:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:38:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:38:41,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-04 21:38:41,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:41,670 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:38:41,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:38:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:38:41,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:38:41,671 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:41,671 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2019-08-04 21:38:41,672 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:41,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:41,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1684420112, now seen corresponding path program 3 times [2019-08-04 21:38:41,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:41,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:38:41,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:41,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:41,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:41,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:38:41,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:38:41,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:38:41,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:41,793 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 6 states. [2019-08-04 21:38:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:41,918 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:38:41,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:38:41,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-04 21:38:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:41,919 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:38:41,919 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:38:41,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-04 21:38:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:38:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-08-04 21:38:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:38:41,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:38:41,923 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-04 21:38:41,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:41,923 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:38:41,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:38:41,923 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:38:41,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:38:41,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:41,924 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2019-08-04 21:38:41,924 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:41,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:41,925 INFO L82 PathProgramCache]: Analyzing trace with hash -474870721, now seen corresponding path program 4 times [2019-08-04 21:38:41,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:41,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:38:41,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:42,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:42,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:38:42,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:38:42,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:38:42,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:42,188 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 7 states. [2019-08-04 21:38:42,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:42,274 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:38:42,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:38:42,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-04 21:38:42,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:42,276 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:38:42,276 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:38:42,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-04 21:38:42,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:38:42,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-08-04 21:38:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:38:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:38:42,281 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-04 21:38:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:42,281 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:38:42,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:38:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:38:42,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:38:42,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:42,282 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1] [2019-08-04 21:38:42,282 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:42,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:42,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1084157266, now seen corresponding path program 5 times [2019-08-04 21:38:42,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:42,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:38:42,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:42,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:42,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:38:42,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:38:42,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:38:42,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:42,445 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2019-08-04 21:38:42,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:42,613 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:38:42,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:38:42,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-04 21:38:42,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:42,615 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:38:42,615 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:38:42,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:42,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:38:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-08-04 21:38:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:38:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:38:42,620 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-04 21:38:42,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:42,620 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:38:42,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:38:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:38:42,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:38:42,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:42,621 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1] [2019-08-04 21:38:42,622 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:42,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:42,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1801992541, now seen corresponding path program 6 times [2019-08-04 21:38:42,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:42,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:38:42,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:42,736 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-04 21:38:42,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:42,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:38:42,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:38:42,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:38:42,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:38:42,738 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-08-04 21:38:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:42,787 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:38:42,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:38:42,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-04 21:38:42,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:42,789 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:38:42,789 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:38:42,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:38:42,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:38:42,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-08-04 21:38:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:38:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:38:42,792 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-04 21:38:42,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:42,793 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:38:42,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:38:42,793 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:38:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:38:42,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:42,794 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1] [2019-08-04 21:38:42,794 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:42,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:42,794 INFO L82 PathProgramCache]: Analyzing trace with hash 843083852, now seen corresponding path program 7 times [2019-08-04 21:38:42,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:42,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:38:42,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:43,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:43,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:38:43,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:38:43,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:38:43,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:38:43,154 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2019-08-04 21:38:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:43,314 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:38:43,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:38:43,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-08-04 21:38:43,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:43,316 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:38:43,316 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:38:43,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:38:43,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:38:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:38:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:38:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:38:43,321 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-04 21:38:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:43,321 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:38:43,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:38:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:38:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:38:43,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:43,322 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1] [2019-08-04 21:38:43,323 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:43,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:43,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1545164933, now seen corresponding path program 8 times [2019-08-04 21:38:43,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-04 21:38:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-04 21:38:43,389 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-04 21:38:43,408 INFO L202 PluginConnector]: Adding new model sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:38:43 BoogieIcfgContainer [2019-08-04 21:38:43,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:38:43,411 INFO L168 Benchmark]: Toolchain (without parser) took 2853.26 ms. Allocated memory was 133.7 MB in the beginning and 170.4 MB in the end (delta: 36.7 MB). Free memory was 111.1 MB in the beginning and 87.4 MB in the end (delta: 23.7 MB). Peak memory consumption was 60.4 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:43,413 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.30 ms. Allocated memory is still 133.7 MB. Free memory was 112.4 MB in the beginning and 112.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-04 21:38:43,413 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.03 ms. Allocated memory is still 133.7 MB. Free memory was 110.9 MB in the beginning and 109.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:43,414 INFO L168 Benchmark]: Boogie Preprocessor took 22.89 ms. Allocated memory is still 133.7 MB. Free memory was 109.4 MB in the beginning and 108.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:43,415 INFO L168 Benchmark]: RCFGBuilder took 281.22 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 97.9 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:43,417 INFO L168 Benchmark]: TraceAbstraction took 2503.38 ms. Allocated memory was 133.7 MB in the beginning and 170.4 MB in the end (delta: 36.7 MB). Free memory was 97.4 MB in the beginning and 87.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:43,421 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.30 ms. Allocated memory is still 133.7 MB. Free memory was 112.4 MB in the beginning and 112.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.03 ms. Allocated memory is still 133.7 MB. Free memory was 110.9 MB in the beginning and 109.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.89 ms. Allocated memory is still 133.7 MB. Free memory was 109.4 MB in the beginning and 108.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 281.22 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 97.9 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2503.38 ms. Allocated memory was 133.7 MB in the beginning and 170.4 MB in the end (delta: 36.7 MB). Free memory was 97.4 MB in the beginning and 87.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: assertion can be violated assertion can be violated We found a FailurePath: [L10] havoc main_#res; [L11] havoc main_#t~post0, main_~i~4, main_~sn~4; [L12] havoc main_~i~4; [L13] main_~sn~4 := 0; [L14] main_~i~4 := 1; VAL [main_~i~4=1, main_~sn~4=0] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=1, main_~sn~4=0] [L37] assume main_~i~4 < 4; [L38] main_~sn~4 := main_~sn~4 + 2; [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=2, main_~sn~4=2] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=2, main_~sn~4=2] [L37] assume main_~i~4 < 4; [L38] main_~sn~4 := main_~sn~4 + 2; [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=3, main_~sn~4=4] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=3, main_~sn~4=4] [L37] assume main_~i~4 < 4; [L38] main_~sn~4 := main_~sn~4 + 2; [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=4, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=4, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=5, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=5, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=6, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=6, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=7, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=7, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=8, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=8, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=9, main_~sn~4=6] [L22] assume !(main_~i~4 <= 8); [L23] __VERIFIER_assert_#in~cond := (if main_~sn~4 == 16 || main_~sn~4 == 0 then 1 else 0); [L24] havoc __VERIFIER_assert_~cond; [L25] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L26] assume __VERIFIER_assert_~cond == 0; [L27] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~4=9, main_~sn~4=6] [L33] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~4=9, main_~sn~4=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 2.4s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 36 SDslu, 14 SDs, 0 SdLazy, 101 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 2304 SizeOfPredicates, 7 NumberOfNonLiveVariables, 224 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 0/140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...