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/toy/SAS09-incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:42:29,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:42:29,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:42:29,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:42:29,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:42:29,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:42:29,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:42:29,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:42:29,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:42:29,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:42:29,092 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:42:29,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:42:29,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:42:29,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:42:29,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:42:29,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:42:29,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:42:29,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:42:29,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:42:29,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:42:29,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:42:29,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:42:29,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:42:29,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:42:29,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:42:29,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:42:29,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:42:29,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:42:29,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:42:29,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:42:29,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:42:29,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:42:29,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:42:29,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:42:29,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:42:29,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:42:29,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:42:29,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:42:29,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:42:29,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:42:29,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:42:29,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:42:29,206 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:42:29,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:42:29,211 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:42:29,212 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:42:29,212 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/SAS09-incorrect.bpl [2019-08-05 10:42:29,212 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/SAS09-incorrect.bpl' [2019-08-05 10:42:29,237 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:42:29,238 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:42:29,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:42:29,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:42:29,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:42:29,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SAS09-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:29" (1/1) ... [2019-08-05 10:42:29,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SAS09-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:29" (1/1) ... [2019-08-05 10:42:29,270 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:42:29,270 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:42:29,271 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:42:29,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:42:29,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:42:29,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:42:29,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:42:29,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SAS09-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:29" (1/1) ... [2019-08-05 10:42:29,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SAS09-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:29" (1/1) ... [2019-08-05 10:42:29,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SAS09-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:29" (1/1) ... [2019-08-05 10:42:29,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SAS09-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:29" (1/1) ... [2019-08-05 10:42:29,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SAS09-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:29" (1/1) ... [2019-08-05 10:42:29,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SAS09-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:29" (1/1) ... [2019-08-05 10:42:29,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SAS09-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:29" (1/1) ... [2019-08-05 10:42:29,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:42:29,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:42:29,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:42:29,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:42:29,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SAS09-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:29" (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:42:29,360 INFO L124 BoogieDeclarations]: Specification and implementation of procedure SAS09paper given in one single declaration [2019-08-05 10:42:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure SAS09paper [2019-08-05 10:42:29,360 INFO L138 BoogieDeclarations]: Found implementation of procedure SAS09paper [2019-08-05 10:42:29,599 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:42:29,600 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:42:29,601 INFO L202 PluginConnector]: Adding new model SAS09-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:42:29 BoogieIcfgContainer [2019-08-05 10:42:29,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:42:29,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:42:29,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:42:29,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:42:29,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SAS09-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:29" (1/2) ... [2019-08-05 10:42:29,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e94fc7d and model type SAS09-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:42:29, skipping insertion in model container [2019-08-05 10:42:29,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SAS09-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:42:29" (2/2) ... [2019-08-05 10:42:29,610 INFO L109 eAbstractionObserver]: Analyzing ICFG SAS09-incorrect.bpl [2019-08-05 10:42:29,620 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:42:29,628 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:42:29,645 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:42:29,668 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:42:29,669 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:42:29,670 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:42:29,670 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:42:29,670 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:42:29,670 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:42:29,670 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:42:29,671 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:42:29,671 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:42:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:42:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:42:29,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:29,694 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:42:29,697 INFO L418 AbstractCegarLoop]: === Iteration 1 === [SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:29,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:29,703 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2019-08-05 10:42:29,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:29,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:42:29,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:29,818 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:42:29,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:29,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:42:29,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:29,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:29,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:29,840 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 10:42:29,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:29,903 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:42:29,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:29,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:42:29,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:29,918 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:42:29,918 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:42:29,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:42:29,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:42:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-08-05 10:42:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:42:30,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 10:42:30,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 2 [2019-08-05 10:42:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:30,005 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 10:42:30,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 10:42:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:42:30,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:30,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:42:30,007 INFO L418 AbstractCegarLoop]: === Iteration 2 === [SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:30,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:30,008 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2019-08-05 10:42:30,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:30,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:42:30,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:30,103 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:42:30,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:30,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:42:30,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:42:30,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:42:30,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:42:30,106 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-08-05 10:42:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:30,218 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:42:30,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:42:30,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 10:42:30,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:30,220 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:42:30,220 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:42:30,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-05 10:42:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:42:30,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 7. [2019-08-05 10:42:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:42:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-08-05 10:42:30,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 3 [2019-08-05 10:42:30,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:30,224 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-08-05 10:42:30,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:42:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-08-05 10:42:30,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:42:30,225 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:30,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:42:30,225 INFO L418 AbstractCegarLoop]: === Iteration 3 === [SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:30,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:30,226 INFO L82 PathProgramCache]: Analyzing trace with hash 30016, now seen corresponding path program 1 times [2019-08-05 10:42:30,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:30,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:42:30,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:30,271 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:42:30,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:30,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:42:30,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:30,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:30,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:30,273 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 3 states. [2019-08-05 10:42:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:30,274 INFO L93 Difference]: Finished difference Result 6 states and 8 transitions. [2019-08-05 10:42:30,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:30,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:42:30,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:30,276 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:42:30,276 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:42:30,277 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:42:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:42:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:42:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:42:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:42:30,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:42:30,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:30,282 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:42:30,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:30,282 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:42:30,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:42:30,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:30,284 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-08-05 10:42:30,284 INFO L418 AbstractCegarLoop]: === Iteration 4 === [SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:30,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:30,285 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2019-08-05 10:42:30,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:30,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:42:30,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:30,393 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:42:30,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:30,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:42:30,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:42:30,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:42:30,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:42:30,395 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-05 10:42:30,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:30,420 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:42:30,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:42:30,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:42:30,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:30,421 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:42:30,421 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:42:30,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:42:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:42:30,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:42:30,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:42:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:42:30,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:42:30,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:30,424 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:42:30,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:42:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:42:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:42:30,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:30,425 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-08-05 10:42:30,426 INFO L418 AbstractCegarLoop]: === Iteration 5 === [SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:30,426 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2019-08-05 10:42:30,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:30,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:42:30,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:30,503 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:42:30,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:30,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:42:30,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:42:30,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:42:30,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:42:30,505 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 10:42:30,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:30,569 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:42:30,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:42:30,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:42:30,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:30,570 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:42:30,570 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:42:30,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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:42:30,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:42:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:42:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:42:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:42:30,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:42:30,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:30,574 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:42:30,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:42:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:42:30,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:42:30,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:30,574 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-08-05 10:42:30,575 INFO L418 AbstractCegarLoop]: === Iteration 6 === [SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:30,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:30,575 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2019-08-05 10:42:30,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:30,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:42:30,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:30,704 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:42:30,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:30,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:42:30,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:42:30,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:42:30,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:42:30,706 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 10:42:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:30,830 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:42:30,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:42:30,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:42:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:30,831 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:42:30,831 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:42:30,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:42:30,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:42:30,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:42:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:42:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:42:30,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:42:30,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:30,834 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:42:30,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:42:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:42:30,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:42:30,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:30,835 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-08-05 10:42:30,836 INFO L418 AbstractCegarLoop]: === Iteration 7 === [SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:30,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:30,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2019-08-05 10:42:30,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:42:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:42:30,865 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:42:30,883 INFO L202 PluginConnector]: Adding new model SAS09-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:42:30 BoogieIcfgContainer [2019-08-05 10:42:30,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:42:30,886 INFO L168 Benchmark]: Toolchain (without parser) took 1646.76 ms. Allocated memory was 141.6 MB in the beginning and 176.7 MB in the end (delta: 35.1 MB). Free memory was 111.4 MB in the beginning and 135.8 MB in the end (delta: -24.4 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:30,887 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 141.6 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-05 10:42:30,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.13 ms. Allocated memory is still 141.6 MB. Free memory was 111.2 MB in the beginning and 109.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:30,889 INFO L168 Benchmark]: Boogie Preprocessor took 19.80 ms. Allocated memory is still 141.6 MB. Free memory was 109.4 MB in the beginning and 108.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:30,890 INFO L168 Benchmark]: RCFGBuilder took 307.68 ms. Allocated memory is still 141.6 MB. Free memory was 108.1 MB in the beginning and 99.2 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:30,890 INFO L168 Benchmark]: TraceAbstraction took 1279.97 ms. Allocated memory was 141.6 MB in the beginning and 176.7 MB in the end (delta: 35.1 MB). Free memory was 99.0 MB in the beginning and 135.8 MB in the end (delta: -36.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:42:30,895 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.18 ms. Allocated memory is still 141.6 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 34.13 ms. Allocated memory is still 141.6 MB. Free memory was 111.2 MB in the beginning and 109.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.80 ms. Allocated memory is still 141.6 MB. Free memory was 109.4 MB in the beginning and 108.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 307.68 ms. Allocated memory is still 141.6 MB. Free memory was 108.1 MB in the beginning and 99.2 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1279.97 ms. Allocated memory was 141.6 MB in the beginning and 176.7 MB in the end (delta: 35.1 MB). Free memory was 99.0 MB in the beginning and 135.8 MB in the end (delta: -36.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 24]: assertion can be violated assertion can be violated We found a FailurePath: [L17] x := 0; [L18] y := 0; VAL [x=0, y=0] [L21] x := x + 1; VAL [x=1, y=0] [L21] x := x + 1; VAL [x=2, y=0] [L21] x := x + 1; VAL [x=3, y=0] [L21] x := x + 1; VAL [x=4, y=0] [L21] x := x + 1; VAL [x=5, y=0] [L24] assert x != 5; VAL [x=5, y=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 2 error locations. UNSAFE Result, 1.2s OverallTime, 7 OverallIterations, 5 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17 SDtfs, 9 SDslu, 4 SDs, 0 SdLazy, 38 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=6, 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, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 177 SizeOfPredicates, 0 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...