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/abstractInterpretation/unclassified/SAS09doubleLoop_incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:14:14,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:14:14,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:14:14,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:14:14,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:14:14,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:14:14,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:14:14,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:14:14,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:14:14,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:14:14,343 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:14:14,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:14:14,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:14:14,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:14:14,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:14:14,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:14:14,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:14:14,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:14:14,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:14:14,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:14:14,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:14:14,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:14:14,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:14:14,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:14:14,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:14:14,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:14:14,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:14:14,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:14:14,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:14:14,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:14:14,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:14:14,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:14:14,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:14:14,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:14:14,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:14:14,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:14:14,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:14:14,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:14:14,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:14:14,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:14:14,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:14:14,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:14:14,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:14:14,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:14:14,413 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:14:14,414 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:14:14,414 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/SAS09doubleLoop_incorrect.bpl [2019-08-05 11:14:14,415 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/SAS09doubleLoop_incorrect.bpl' [2019-08-05 11:14:14,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:14:14,448 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:14:14,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:14,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:14:14,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:14:14,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SAS09doubleLoop_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:14" (1/1) ... [2019-08-05 11:14:14,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SAS09doubleLoop_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:14" (1/1) ... [2019-08-05 11:14:14,479 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:14:14,479 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:14:14,480 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:14:14,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:14,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:14:14,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:14:14,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:14:14,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SAS09doubleLoop_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:14" (1/1) ... [2019-08-05 11:14:14,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SAS09doubleLoop_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:14" (1/1) ... [2019-08-05 11:14:14,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SAS09doubleLoop_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:14" (1/1) ... [2019-08-05 11:14:14,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SAS09doubleLoop_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:14" (1/1) ... [2019-08-05 11:14:14,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SAS09doubleLoop_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:14" (1/1) ... [2019-08-05 11:14:14,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SAS09doubleLoop_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:14" (1/1) ... [2019-08-05 11:14:14,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SAS09doubleLoop_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:14" (1/1) ... [2019-08-05 11:14:14,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:14:14,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:14:14,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:14:14,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:14:14,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SAS09doubleLoop_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:14" (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 11:14:14,570 INFO L124 BoogieDeclarations]: Specification and implementation of procedure SAS09paper given in one single declaration [2019-08-05 11:14:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure SAS09paper [2019-08-05 11:14:14,570 INFO L138 BoogieDeclarations]: Found implementation of procedure SAS09paper [2019-08-05 11:14:14,832 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:14:14,832 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-05 11:14:14,834 INFO L202 PluginConnector]: Adding new model SAS09doubleLoop_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:14 BoogieIcfgContainer [2019-08-05 11:14:14,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:14:14,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:14:14,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:14:14,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:14:14,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SAS09doubleLoop_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:14" (1/2) ... [2019-08-05 11:14:14,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8936e59 and model type SAS09doubleLoop_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:14:14, skipping insertion in model container [2019-08-05 11:14:14,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SAS09doubleLoop_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:14" (2/2) ... [2019-08-05 11:14:14,842 INFO L109 eAbstractionObserver]: Analyzing ICFG SAS09doubleLoop_incorrect.bpl [2019-08-05 11:14:14,851 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:14:14,858 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-08-05 11:14:14,874 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-08-05 11:14:14,903 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:14:14,905 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:14:14,905 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:14:14,905 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:14:14,906 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:14:14,906 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:14:14,906 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:14:14,906 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:14:14,906 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:14:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-08-05 11:14:14,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:14:14,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:14,934 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:14:14,937 INFO L418 AbstractCegarLoop]: === Iteration 1 === [SAS09paperErr1ASSERT_VIOLATIONASSERT, SAS09paperErr2ASSERT_VIOLATIONASSERT, SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:14,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:14,943 INFO L82 PathProgramCache]: Analyzing trace with hash 29892, now seen corresponding path program 1 times [2019-08-05 11:14:14,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:15,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:14:15,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:15,061 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 11:14:15,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:15,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:14:15,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:14:15,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:14:15,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:15,083 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2019-08-05 11:14:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:15,150 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 11:14:15,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:14:15,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:14:15,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:15,168 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:14:15,169 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:14:15,171 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 11:14:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:14:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:14:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:14:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 11:14:15,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 3 [2019-08-05 11:14:15,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:15,209 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 11:14:15,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:14:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 11:14:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:14:15,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:15,211 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:14:15,211 INFO L418 AbstractCegarLoop]: === Iteration 2 === [SAS09paperErr1ASSERT_VIOLATIONASSERT, SAS09paperErr2ASSERT_VIOLATIONASSERT, SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:15,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:15,212 INFO L82 PathProgramCache]: Analyzing trace with hash 926693, now seen corresponding path program 1 times [2019-08-05 11:14:15,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:15,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:14:15,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:15,291 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 11:14:15,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:15,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:14:15,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:14:15,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:14:15,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:15,297 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 3 states. [2019-08-05 11:14:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:15,315 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2019-08-05 11:14:15,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:14:15,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:14:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:15,317 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:14:15,317 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:14:15,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 11:14:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:14:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:14:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:14:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 11:14:15,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-08-05 11:14:15,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:15,322 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 11:14:15,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:14:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 11:14:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:14:15,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:15,323 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:14:15,324 INFO L418 AbstractCegarLoop]: === Iteration 3 === [SAS09paperErr1ASSERT_VIOLATIONASSERT, SAS09paperErr2ASSERT_VIOLATIONASSERT, SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:15,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:15,324 INFO L82 PathProgramCache]: Analyzing trace with hash 926853, now seen corresponding path program 1 times [2019-08-05 11:14:15,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:15,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:14:15,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:15,374 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 11:14:15,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:15,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:14:15,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:14:15,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:14:15,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:15,377 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2019-08-05 11:14:15,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:15,414 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 11:14:15,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:14:15,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:14:15,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:15,415 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:14:15,415 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:14:15,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 11:14:15,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:14:15,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 11:14:15,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:14:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 11:14:15,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-08-05 11:14:15,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:15,419 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 11:14:15,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:14:15,419 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 11:14:15,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:14:15,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:15,420 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:14:15,421 INFO L418 AbstractCegarLoop]: === Iteration 4 === [SAS09paperErr1ASSERT_VIOLATIONASSERT, SAS09paperErr2ASSERT_VIOLATIONASSERT, SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:15,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:15,421 INFO L82 PathProgramCache]: Analyzing trace with hash 890553383, now seen corresponding path program 1 times [2019-08-05 11:14:15,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:15,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:15,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:15,479 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 11:14:15,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:15,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 11:14:15,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:14:15,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:14:15,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:15,483 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 11:14:15,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:15,521 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 11:14:15,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:14:15,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 11:14:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:15,522 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:14:15,523 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:14:15,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 11:14:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:14:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 11:14:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:14:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:14:15,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 11:14:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:15,526 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:14:15,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:14:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:14:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:14:15,527 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:15,527 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 11:14:15,529 INFO L418 AbstractCegarLoop]: === Iteration 5 === [SAS09paperErr1ASSERT_VIOLATIONASSERT, SAS09paperErr2ASSERT_VIOLATIONASSERT, SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:15,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:15,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1123156809, now seen corresponding path program 2 times [2019-08-05 11:14:15,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:15,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:14:15,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:15,622 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-05 11:14:15,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:15,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:14:15,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:14:15,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:14:15,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:15,625 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-05 11:14:15,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:15,644 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 11:14:15,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:15,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 11:14:15,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:15,646 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:14:15,646 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:14:15,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 11:14:15,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:14:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 11:14:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:14:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:14:15,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 11:14:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:15,650 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:14:15,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:14:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:14:15,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:14:15,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:15,651 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-08-05 11:14:15,651 INFO L418 AbstractCegarLoop]: === Iteration 6 === [SAS09paperErr1ASSERT_VIOLATIONASSERT, SAS09paperErr2ASSERT_VIOLATIONASSERT, SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:15,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:15,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1316749803, now seen corresponding path program 3 times [2019-08-05 11:14:15,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:15,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:14:15,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:15,771 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-05 11:14:15,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:15,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:14:15,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:15,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:15,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:15,773 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-08-05 11:14:15,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:15,816 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 11:14:15,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:14:15,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:14:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:15,818 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:14:15,818 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:14:15,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 11:14:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:14:15,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 11:14:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:14:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 11:14:15,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 11:14:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:15,823 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 11:14:15,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 11:14:15,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:14:15,824 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:15,824 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-08-05 11:14:15,825 INFO L418 AbstractCegarLoop]: === Iteration 7 === [SAS09paperErr1ASSERT_VIOLATIONASSERT, SAS09paperErr2ASSERT_VIOLATIONASSERT, SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:15,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:15,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1618943987, now seen corresponding path program 4 times [2019-08-05 11:14:15,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:15,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:14:15,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:16,059 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-05 11:14:16,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:16,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:16,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:16,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:16,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:16,064 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-08-05 11:14:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:16,110 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-08-05 11:14:16,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:14:16,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 11:14:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:16,112 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:14:16,112 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:14:16,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:14:16,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 11:14:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:14:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 11:14:16,116 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-05 11:14:16,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:16,116 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 11:14:16,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:16,116 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 11:14:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:14:16,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:16,117 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-08-05 11:14:16,117 INFO L418 AbstractCegarLoop]: === Iteration 8 === [SAS09paperErr1ASSERT_VIOLATIONASSERT, SAS09paperErr2ASSERT_VIOLATIONASSERT, SAS09paperErr0ASSERT_VIOLATIONASSERT, SAS09paperErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:16,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1027162705, now seen corresponding path program 5 times [2019-08-05 11:14:16,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:14:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:14:16,150 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:14:16,167 INFO L202 PluginConnector]: Adding new model SAS09doubleLoop_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:14:16 BoogieIcfgContainer [2019-08-05 11:14:16,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:14:16,170 INFO L168 Benchmark]: Toolchain (without parser) took 1721.06 ms. Allocated memory was 133.7 MB in the beginning and 170.4 MB in the end (delta: 36.7 MB). Free memory was 110.0 MB in the beginning and 129.9 MB in the end (delta: -19.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:16,171 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory is still 110.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:14:16,172 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.89 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 107.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:16,172 INFO L168 Benchmark]: Boogie Preprocessor took 20.01 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 106.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:16,173 INFO L168 Benchmark]: RCFGBuilder took 330.99 ms. Allocated memory is still 133.7 MB. Free memory was 106.6 MB in the beginning and 97.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:16,175 INFO L168 Benchmark]: TraceAbstraction took 1331.70 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.0 MB in the beginning and 129.9 MB in the end (delta: -32.8 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:16,179 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory is still 110.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.89 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 107.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.01 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 106.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 330.99 ms. Allocated memory is still 133.7 MB. Free memory was 106.6 MB in the beginning and 97.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1331.70 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.0 MB in the beginning and 129.9 MB in the end (delta: -32.8 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 26]: assertion can be violated assertion can be violated We found a FailurePath: [L13] x := 0; [L14] y := 0; VAL [x=0, y=0] [L21] assert x != -1; VAL [x=0, y=0] [L22] assert y != -1; [L23] y := y + 1; VAL [x=0, y=1] [L21] assert x != -1; VAL [x=0, y=1] [L22] assert y != -1; [L23] y := y + 1; VAL [x=0, y=2] [L21] assert x != -1; VAL [x=0, y=2] [L22] assert y != -1; [L23] y := y + 1; VAL [x=0, y=3] [L21] assert x != -1; VAL [x=0, y=3] [L22] assert y != -1; [L23] y := y + 1; VAL [x=0, y=4] [L21] assert x != -1; VAL [x=0, y=4] [L22] assert y != -1; [L23] y := y + 1; VAL [x=0, y=5] [L25] assert x != -1; VAL [x=0, y=5] [L26] assert y != 5; VAL [x=0, y=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 4 error locations. UNSAFE Result, 1.2s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 41 SDtfs, 39 SDslu, 28 SDs, 0 SdLazy, 33 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=7, 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, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 40 ConstructedInterpolants, 0 QuantifiedInterpolants, 894 SizeOfPredicates, 0 NumberOfNonLiveVariables, 109 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 0/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...