java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:29:28,325 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:29:28,328 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:29:28,341 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:29:28,342 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:29:28,343 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:29:28,344 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:29:28,346 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:29:28,347 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:29:28,348 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:29:28,350 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:29:28,350 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:29:28,351 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:29:28,352 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:29:28,353 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:29:28,354 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:29:28,355 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:29:28,356 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:29:28,359 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:29:28,360 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:29:28,361 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:29:28,363 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:29:28,365 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:29:28,366 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:29:28,366 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:29:28,367 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:29:28,368 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:29:28,368 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:29:28,369 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:29:28,370 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:29:28,371 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:29:28,371 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:29:28,372 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:29:28,372 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:29:28,373 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:29:28,374 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:29:28,374 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:29:28,382 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:29:28,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:29:28,384 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:29:28,384 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:29:28,385 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:29:28,385 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:29:28,385 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:29:28,385 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:29:28,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:29:28,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:29:28,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:29:28,468 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:29:28,469 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:29:28,470 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl [2018-07-25 13:29:28,470 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2018-07-25 13:29:28,558 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:29:28,560 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:29:28,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:29:28,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:29:28,561 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:29:28,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:28" (1/1) ... [2018-07-25 13:29:28,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:28" (1/1) ... [2018-07-25 13:29:28,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:29:28,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:29:28,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:29:28,611 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:29:28,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:28" (1/1) ... [2018-07-25 13:29:28,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:28" (1/1) ... [2018-07-25 13:29:28,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:28" (1/1) ... [2018-07-25 13:29:28,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:28" (1/1) ... [2018-07-25 13:29:28,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:28" (1/1) ... [2018-07-25 13:29:28,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:28" (1/1) ... [2018-07-25 13:29:28,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:28" (1/1) ... [2018-07-25 13:29:28,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:29:28,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:29:28,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:29:28,674 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:29:28,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:28" (1/1) ... [2018-07-25 13:29:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:29:28,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:29:29,510 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:29:29,511 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:29:29 BoogieIcfgContainer [2018-07-25 13:29:29,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:29:29,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:29:29,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:29:29,520 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:29:29,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:28" (1/2) ... [2018-07-25 13:29:29,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41000475 and model type toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:29:29, skipping insertion in model container [2018-07-25 13:29:29,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:29:29" (2/2) ... [2018-07-25 13:29:29,528 INFO L112 eAbstractionObserver]: Analyzing ICFG toy.cil.c_34.bpl [2018-07-25 13:29:29,539 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:29:29,549 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:29:29,596 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:29:29,597 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:29:29,597 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:29:29,598 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:29:29,598 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:29:29,598 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:29:29,598 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:29:29,599 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:29:29,599 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:29:29,613 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2018-07-25 13:29:29,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:29:29,622 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:29,623 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:29,624 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:29,630 INFO L82 PathProgramCache]: Analyzing trace with hash 89968813, now seen corresponding path program 1 times [2018-07-25 13:29:29,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:29,729 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:29,730 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:29:29,734 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:29,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:29,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:29,750 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2018-07-25 13:29:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:29,815 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2018-07-25 13:29:29,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:29,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-07-25 13:29:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:29,833 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:29:29,834 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:29:29,837 INFO L574 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 [2018-07-25 13:29:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:29:29,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:29:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:29:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-07-25 13:29:29,879 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 8 [2018-07-25 13:29:29,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:29,880 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-07-25 13:29:29,880 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:29,880 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-07-25 13:29:29,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:29:29,881 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:29,881 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:29,882 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:29,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1182290145, now seen corresponding path program 1 times [2018-07-25 13:29:29,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:29,950 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:29,950 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 13:29:29,954 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:29:29,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:29:29,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:29,957 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 4 states. [2018-07-25 13:29:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:30,077 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2018-07-25 13:29:30,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:29:30,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-07-25 13:29:30,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:30,079 INFO L225 Difference]: With dead ends: 39 [2018-07-25 13:29:30,079 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 13:29:30,081 INFO L574 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 [2018-07-25 13:29:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 13:29:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-25 13:29:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 13:29:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-07-25 13:29:30,095 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 13 [2018-07-25 13:29:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:30,096 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-07-25 13:29:30,096 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:29:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-07-25 13:29:30,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:29:30,098 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:30,098 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:30,099 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:30,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1341253337, now seen corresponding path program 1 times [2018-07-25 13:29:30,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-25 13:29:30,186 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:30,187 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 13:29:30,187 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:29:30,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:29:30,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:30,188 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 4 states. [2018-07-25 13:29:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:30,269 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2018-07-25 13:29:30,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:29:30,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-07-25 13:29:30,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:30,275 INFO L225 Difference]: With dead ends: 58 [2018-07-25 13:29:30,275 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:29:30,277 INFO L574 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 [2018-07-25 13:29:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:29:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-07-25 13:29:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 13:29:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2018-07-25 13:29:30,302 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 19 [2018-07-25 13:29:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:30,303 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2018-07-25 13:29:30,303 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:29:30,304 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2018-07-25 13:29:30,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:29:30,305 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:30,305 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:30,306 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:30,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1614133373, now seen corresponding path program 1 times [2018-07-25 13:29:30,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:30,500 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:30,500 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:29:30,505 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:29:30,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:29:30,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:29:30,510 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand 8 states. [2018-07-25 13:29:30,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:30,737 INFO L93 Difference]: Finished difference Result 116 states and 153 transitions. [2018-07-25 13:29:30,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:29:30,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-07-25 13:29:30,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:30,740 INFO L225 Difference]: With dead ends: 116 [2018-07-25 13:29:30,740 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:29:30,741 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:29:30,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:29:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2018-07-25 13:29:30,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 13:29:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2018-07-25 13:29:30,755 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 24 [2018-07-25 13:29:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:30,756 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2018-07-25 13:29:30,756 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:29:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2018-07-25 13:29:30,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 13:29:30,759 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:30,759 INFO L354 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:29:30,760 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:30,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1098429095, now seen corresponding path program 2 times [2018-07-25 13:29:30,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-25 13:29:30,811 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:30,811 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 13:29:30,812 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:29:30,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:29:30,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:30,813 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand 4 states. [2018-07-25 13:29:30,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:30,864 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2018-07-25 13:29:30,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:29:30,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-07-25 13:29:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:30,866 INFO L225 Difference]: With dead ends: 116 [2018-07-25 13:29:30,867 INFO L226 Difference]: Without dead ends: 60 [2018-07-25 13:29:30,869 INFO L574 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 [2018-07-25 13:29:30,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-25 13:29:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-25 13:29:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 13:29:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-07-25 13:29:30,884 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 29 [2018-07-25 13:29:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:30,884 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-07-25 13:29:30,885 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:29:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-07-25 13:29:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:29:30,886 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:30,886 INFO L354 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:29:30,886 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:30,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1948286985, now seen corresponding path program 1 times [2018-07-25 13:29:30,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 41 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-25 13:29:31,098 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:31,099 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:29:31,099 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:29:31,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:29:31,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:29:31,102 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 11 states. [2018-07-25 13:29:31,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:31,211 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-07-25 13:29:31,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:29:31,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-07-25 13:29:31,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:31,213 INFO L225 Difference]: With dead ends: 84 [2018-07-25 13:29:31,213 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 13:29:31,214 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:29:31,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 13:29:31,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-07-25 13:29:31,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-25 13:29:31,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-07-25 13:29:31,238 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 34 [2018-07-25 13:29:31,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:31,238 INFO L472 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2018-07-25 13:29:31,239 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:29:31,239 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-07-25 13:29:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:29:31,241 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:31,241 INFO L354 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:29:31,241 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:31,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1146863327, now seen corresponding path program 2 times [2018-07-25 13:29:31,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 97 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-07-25 13:29:31,313 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:31,313 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:29:31,314 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:29:31,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:29:31,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:31,315 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 5 states. [2018-07-25 13:29:31,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:31,356 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-07-25 13:29:31,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:29:31,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-07-25 13:29:31,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:31,357 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:29:31,357 INFO L226 Difference]: Without dead ends: 0 [2018-07-25 13:29:31,358 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:31,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-25 13:29:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-25 13:29:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-25 13:29:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-25 13:29:31,360 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-07-25 13:29:31,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:31,360 INFO L472 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-25 13:29:31,360 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:29:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-25 13:29:31,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-25 13:29:31,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-25 13:29:31,661 WARN L169 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-07-25 13:29:31,773 WARN L169 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-07-25 13:29:31,995 INFO L418 ceAbstractionStarter]: At program point L192(lines 166 192) the Hoare annotation is: (let ((.cse0 (= ~r_st 0))) (let ((.cse1 (<= 0 ~t_b)) (.cse2 (= ~wl_pc 2)) (.cse3 (<= ~t_b 0)) (.cse4 (= ~e_f ~wl_pc)) (.cse5 (= ~wl_st 0)) (.cse6 (not .cse0)) (.cse7 (<= 0 ~d)) (.cse8 (<= ~d 0))) (or (and .cse0 .cse1 .cse2 (= ~data 2) .cse3 .cse4 (= 2 ~c) (not (= ~c1_st 0)) (not .cse5)) (and .cse5 .cse1 .cse2 .cse6 .cse3 .cse4 (= ~d 2)) (and (= ~wb_pc 1) .cse5 (= ~wl_pc 1) .cse6 .cse7 (= ~c2_pc 1) .cse8 (= ~c1_pc 1)) (and .cse5 .cse6 .cse7 (<= ~c ~c_t) .cse8 (= ~wl_pc 0) (= ~wb_pc 0) (<= 2 ~e_c) (<= ~c_t ~c))))) [2018-07-25 13:29:31,995 INFO L422 ceAbstractionStarter]: For program point L448(lines 445 454) no Hoare annotation was computed. [2018-07-25 13:29:31,996 INFO L422 ceAbstractionStarter]: For program point L416(lines 416 423) no Hoare annotation was computed. [2018-07-25 13:29:31,996 INFO L425 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 53 461) the Hoare annotation is: true [2018-07-25 13:29:31,996 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 53 461) no Hoare annotation was computed. [2018-07-25 13:29:31,997 INFO L422 ceAbstractionStarter]: For program point L408(lines 403 409) no Hoare annotation was computed. [2018-07-25 13:29:31,997 INFO L422 ceAbstractionStarter]: For program point L342(lines 339 388) no Hoare annotation was computed. [2018-07-25 13:29:31,998 INFO L418 ceAbstractionStarter]: At program point L334(lines 296 340) the Hoare annotation is: (let ((.cse0 (not (= ~r_st 0)))) (or (and (<= 0 ~t_b) (= ~wl_pc 2) .cse0 (= ~data 2) (<= ~t_b 0) (= ~e_f ~wl_pc) (= ~wl_pc ~wl_st) (= 2 ~c) (not (= ~c1_st 0))) (= ~wl_pc 0) (and (= ~wl_pc 1) .cse0 (<= 0 ~d) (or (<= 2 ~e_c) (not (= ~wb_pc 1))) (<= ~d 0) (not (= ~wl_st 0))))) [2018-07-25 13:29:31,999 INFO L422 ceAbstractionStarter]: For program point L425(lines 422 426) no Hoare annotation was computed. [2018-07-25 13:29:32,000 INFO L418 ceAbstractionStarter]: At program point L161(lines 161 167) the Hoare annotation is: (let ((.cse8 (<= ~c ~c_t)) (.cse12 (<= ~c_t ~c)) (.cse14 (= ~wb_pc 1)) (.cse19 (= ~r_st 0)) (.cse18 (= ~wl_st 0))) (let ((.cse13 (or .cse19 .cse18)) (.cse0 (<= 0 ~t_b)) (.cse1 (= ~wl_pc 2)) (.cse3 (= ~data 2)) (.cse4 (<= ~t_b 0)) (.cse5 (= ~e_f ~wl_pc)) (.cse6 (not (= ~c1_st 0))) (.cse10 (= ~wl_pc 0)) (.cse17 (or (and .cse8 .cse12) (not .cse14))) (.cse15 (= ~wl_pc 1)) (.cse2 (not .cse19)) (.cse7 (<= 0 ~d)) (.cse9 (<= ~d 0)) (.cse11 (<= 2 ~e_c)) (.cse16 (not .cse18))) (or (and .cse0 .cse1 (= 2 ~c_t) .cse2 .cse3 .cse4 .cse5 (= ~wl_pc ~wl_st) .cse6 (= ~c_req_up 1)) (and .cse2 .cse7 .cse8 .cse9 .cse10 (= ~wb_pc 0) .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse4 .cse5 (= ~d 2)) (and .cse14 .cse13 .cse15 .cse2 .cse7 (= ~c2_pc 1) .cse9 (= ~c1_pc 1)) (and .cse13 .cse0 .cse1 .cse3 .cse4 .cse5 (= 2 ~c) .cse6 .cse16) (and .cse17 .cse2 .cse10 .cse11 .cse16) (and .cse17 .cse15 .cse2 .cse7 .cse9 .cse11 .cse16)))) [2018-07-25 13:29:32,000 INFO L422 ceAbstractionStarter]: For program point L318(lines 307 343) no Hoare annotation was computed. [2018-07-25 13:29:32,000 INFO L422 ceAbstractionStarter]: For program point L302(lines 209 302) no Hoare annotation was computed. [2018-07-25 13:29:32,001 INFO L422 ceAbstractionStarter]: For program point L360(lines 353 391) no Hoare annotation was computed. [2018-07-25 13:29:32,004 INFO L418 ceAbstractionStarter]: At program point L220(lines 220 271) the Hoare annotation is: (let ((.cse0 (not (= ~r_st 0))) (.cse1 (not (= ~wl_st 0)))) (or (and (= ~wb_pc 1) (= ~wl_pc 1) .cse0 (<= 0 ~d) (= ~c2_pc 1) (<= ~d 0) (= ~c1_pc 1) .cse1) (and (= ~wl_pc 2) (= ~e_f ~wl_pc) (and (<= 0 ~t_b) .cse0 (<= ~t_b 0) (= ~d 2) .cse1)))) [2018-07-25 13:29:32,005 INFO L418 ceAbstractionStarter]: At program point L187(lines 187 218) the Hoare annotation is: (let ((.cse0 (not (= ~r_st 0))) (.cse2 (<= 0 ~d)) (.cse3 (<= ~d 0)) (.cse1 (not (= ~wl_st 0)))) (or (and (<= 0 ~t_b) (= ~wl_pc 2) .cse0 (<= ~t_b 0) (= ~e_f ~wl_pc) (= ~d 2) .cse1) (and (= ~wb_pc 1) (= ~wl_pc 1) .cse0 .cse2 (= ~c2_pc 1) .cse3 (= ~c1_pc 1) .cse1) (and .cse0 .cse2 (<= ~c ~c_t) .cse3 (= ~wl_pc 0) (= ~wb_pc 0) (<= 2 ~e_c) (<= ~c_t ~c) .cse1))) [2018-07-25 13:29:32,006 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 333) the Hoare annotation is: false [2018-07-25 13:29:32,006 INFO L418 ceAbstractionStarter]: At program point L270(lines 270 332) the Hoare annotation is: false [2018-07-25 13:29:32,009 INFO L418 ceAbstractionStarter]: At program point L460(lines 146 460) the Hoare annotation is: (let ((.cse6 (= ~r_st 0)) (.cse1 (= ~wl_st 0))) (let ((.cse0 (or .cse6 .cse1)) (.cse2 (not .cse6)) (.cse3 (<= 0 ~d)) (.cse4 (<= ~d 0)) (.cse5 (<= 2 ~e_c))) (or (and .cse0 (<= 0 ~t_b) (= ~wl_pc 2) (= ~data 2) (<= ~t_b 0) (= ~e_f ~wl_pc) (= 2 ~c) (not (= ~c1_st 0)) (not .cse1)) (and .cse0 .cse2 .cse3 (<= ~c ~c_t) .cse4 (= ~wl_pc 0) (= ~wb_pc 0) .cse5 (<= ~c_t ~c)) (and (= ~wl_pc 1) (= ~wb_pc 1) .cse0 .cse2 .cse3 (= ~c2_pc 1) .cse4 (= ~c1_pc 1) .cse5)))) [2018-07-25 13:29:32,009 INFO L422 ceAbstractionStarter]: For program point L328(lines 328 354) no Hoare annotation was computed. [2018-07-25 13:29:32,009 INFO L422 ceAbstractionStarter]: For program point L196(lines 196 226) no Hoare annotation was computed. [2018-07-25 13:29:32,012 INFO L418 ceAbstractionStarter]: At program point L172(lines 172 193) the Hoare annotation is: (let ((.cse0 (= ~r_st 0))) (let ((.cse8 (or (and (<= ~c ~c_t) (<= ~c_t ~c)) (not (= ~wb_pc 1)))) (.cse10 (<= 2 ~e_c)) (.cse7 (not (= ~wl_st 0))) (.cse1 (<= 0 ~t_b)) (.cse2 (= ~wl_pc 2)) (.cse9 (not .cse0)) (.cse3 (= ~data 2)) (.cse4 (<= ~t_b 0)) (.cse5 (= ~e_f ~wl_pc)) (.cse6 (not (= ~c1_st 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 2 ~c) .cse6 .cse7) (and .cse8 .cse9 (= ~wl_pc 0) .cse10 .cse7) (and .cse8 (= ~wl_pc 1) .cse9 (<= 0 ~d) (<= ~d 0) .cse10 .cse7) (and .cse1 .cse2 (= 2 ~c_t) .cse9 .cse3 .cse4 .cse5 (= ~wl_pc ~wl_st) .cse6 (= ~c_req_up 1))))) [2018-07-25 13:29:32,015 INFO L422 ceAbstractionStarter]: For program point L206(lines 206 238) no Hoare annotation was computed. [2018-07-25 13:29:32,015 INFO L422 ceAbstractionStarter]: For program point L396(lines 331 396) no Hoare annotation was computed. [2018-07-25 13:29:32,015 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 53 461) no Hoare annotation was computed. [2018-07-25 13:29:32,015 INFO L422 ceAbstractionStarter]: For program point L248(lines 237 297) no Hoare annotation was computed. [2018-07-25 13:29:32,015 INFO L422 ceAbstractionStarter]: For program point L430(lines 430 437) no Hoare annotation was computed. [2018-07-25 13:29:32,016 INFO L422 ceAbstractionStarter]: For program point L232(lines 225 291) no Hoare annotation was computed. [2018-07-25 13:29:32,016 INFO L418 ceAbstractionStarter]: At program point L290(lines 177 290) the Hoare annotation is: (let ((.cse0 (= ~r_st 0))) (let ((.cse5 (= ~wl_pc 1)) (.cse7 (<= ~c ~c_t)) (.cse9 (= ~wb_pc 0)) (.cse10 (<= 2 ~e_c)) (.cse11 (<= ~c_t ~c)) (.cse4 (not (= ~wl_st 0))) (.cse1 (= ~wl_pc 2)) (.cse6 (<= 0 ~d)) (.cse3 (= ~c1_st 0)) (.cse12 (not .cse0)) (.cse2 (= ~e_f ~wl_pc)) (.cse8 (<= ~d 0))) (or (and .cse0 (<= 0 ~t_b) .cse1 (= ~data 2) (<= ~t_b 0) .cse2 (= 2 ~c) (not .cse3) .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse4) (and .cse0 .cse5 .cse4) (and .cse12 .cse7 (= ~wl_pc 0) .cse9 .cse10 .cse11 .cse4) (and .cse1 (= ~d ~t_b) .cse6 .cse3 (= ~c2_pc 1) (= ~wl_pc ~wl_st) (= ~d ~data) (= ~c2_st 0) (= ~wb_pc 1) .cse12 .cse2 .cse8 (= ~c1_pc 1))))) [2018-07-25 13:29:32,019 INFO L418 ceAbstractionStarter]: At program point L381(lines 157 381) the Hoare annotation is: (let ((.cse8 (<= ~c ~c_t)) (.cse12 (<= ~c_t ~c)) (.cse14 (= ~wb_pc 1)) (.cse19 (= ~r_st 0)) (.cse18 (= ~wl_st 0))) (let ((.cse13 (or .cse19 .cse18)) (.cse0 (<= 0 ~t_b)) (.cse1 (= ~wl_pc 2)) (.cse3 (= ~data 2)) (.cse4 (<= ~t_b 0)) (.cse5 (= ~e_f ~wl_pc)) (.cse6 (not (= ~c1_st 0))) (.cse10 (= ~wl_pc 0)) (.cse17 (or (and .cse8 .cse12) (not .cse14))) (.cse15 (= ~wl_pc 1)) (.cse2 (not .cse19)) (.cse7 (<= 0 ~d)) (.cse9 (<= ~d 0)) (.cse11 (<= 2 ~e_c)) (.cse16 (not .cse18))) (or (and .cse0 .cse1 (= 2 ~c_t) .cse2 .cse3 .cse4 .cse5 (= ~wl_pc ~wl_st) .cse6 (= ~c_req_up 1)) (and .cse2 .cse7 .cse8 .cse9 .cse10 (= ~wb_pc 0) .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse4 .cse5 (= ~d 2)) (and .cse14 .cse13 .cse15 .cse2 .cse7 (= ~c2_pc 1) .cse9 (= ~c1_pc 1)) (and .cse13 .cse0 .cse1 .cse3 .cse4 .cse5 (= 2 ~c) .cse6 .cse16) (and .cse17 .cse2 .cse10 .cse11 .cse16) (and .cse17 .cse15 .cse2 .cse7 .cse9 .cse11 .cse16)))) [2018-07-25 13:29:32,020 INFO L422 ceAbstractionStarter]: For program point L348(lines 261 348) no Hoare annotation was computed. [2018-07-25 13:29:32,020 INFO L422 ceAbstractionStarter]: For program point L439(lines 436 446) no Hoare annotation was computed. [2018-07-25 13:29:32,020 INFO L422 ceAbstractionStarter]: For program point L390(lines 387 404) no Hoare annotation was computed. [2018-07-25 13:29:32,020 INFO L422 ceAbstractionStarter]: For program point L258(lines 258 308) no Hoare annotation was computed. [2018-07-25 13:29:32,059 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:29:32 BoogieIcfgContainer [2018-07-25 13:29:32,059 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:29:32,060 INFO L168 Benchmark]: Toolchain (without parser) took 3501.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 306.5 MB). Peak memory consumption was 306.5 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:32,061 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:29:32,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:29:32,066 INFO L168 Benchmark]: Boogie Preprocessor took 62.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:29:32,067 INFO L168 Benchmark]: RCFGBuilder took 837.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:32,068 INFO L168 Benchmark]: TraceAbstraction took 2546.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 274.8 MB). Peak memory consumption was 274.8 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:32,072 INFO L336 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 837.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2546.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 274.8 MB). Peak memory consumption was 274.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 333]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((((((((0 <= ~t_b && ~wl_pc == 2) && !(~r_st == 0)) && ~data == 2) && ~t_b <= 0) && ~e_f == ~wl_pc) && ~wl_pc == ~wl_st) && 2 == ~c) && !(~c1_st == 0)) || ~wl_pc == 0) || (((((~wl_pc == 1 && !(~r_st == 0)) && 0 <= ~d) && (2 <= ~e_c || !(~wb_pc == 1))) && ~d <= 0) && !(~wl_st == 0)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((((((((~r_st == 0 && 0 <= ~t_b) && ~wl_pc == 2) && ~data == 2) && ~t_b <= 0) && ~e_f == ~wl_pc) && 2 == ~c) && !(~c1_st == 0)) && !(~wl_st == 0)) || ((((((~wl_st == 0 && 0 <= ~t_b) && ~wl_pc == 2) && !(~r_st == 0)) && ~t_b <= 0) && ~e_f == ~wl_pc) && ~d == 2)) || (((((((~wb_pc == 1 && ~wl_st == 0) && ~wl_pc == 1) && !(~r_st == 0)) && 0 <= ~d) && ~c2_pc == 1) && ~d <= 0) && ~c1_pc == 1)) || ((((((((~wl_st == 0 && !(~r_st == 0)) && 0 <= ~d) && ~c <= ~c_t) && ~d <= 0) && ~wl_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((((0 <= ~t_b && ~wl_pc == 2) && !(~r_st == 0)) && ~t_b <= 0) && ~e_f == ~wl_pc) && ~d == 2) && !(~wl_st == 0)) || (((((((~wb_pc == 1 && ~wl_pc == 1) && !(~r_st == 0)) && 0 <= ~d) && ~c2_pc == 1) && ~d <= 0) && ~c1_pc == 1) && !(~wl_st == 0))) || ((((((((!(~r_st == 0) && 0 <= ~d) && ~c <= ~c_t) && ~d <= 0) && ~wl_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) && !(~wl_st == 0)) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= ~t_b && ~wl_pc == 2) && 2 == ~c_t) && !(~r_st == 0)) && ~data == 2) && ~t_b <= 0) && ~e_f == ~wl_pc) && ~wl_pc == ~wl_st) && !(~c1_st == 0)) && ~c_req_up == 1) || (((((((!(~r_st == 0) && 0 <= ~d) && ~c <= ~c_t) && ~d <= 0) && ~wl_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c)) || (((((((~r_st == 0 || ~wl_st == 0) && 0 <= ~t_b) && ~wl_pc == 2) && !(~r_st == 0)) && ~t_b <= 0) && ~e_f == ~wl_pc) && ~d == 2)) || (((((((~wb_pc == 1 && (~r_st == 0 || ~wl_st == 0)) && ~wl_pc == 1) && !(~r_st == 0)) && 0 <= ~d) && ~c2_pc == 1) && ~d <= 0) && ~c1_pc == 1)) || (((((((((~r_st == 0 || ~wl_st == 0) && 0 <= ~t_b) && ~wl_pc == 2) && ~data == 2) && ~t_b <= 0) && ~e_f == ~wl_pc) && 2 == ~c) && !(~c1_st == 0)) && !(~wl_st == 0))) || ((((((~c <= ~c_t && ~c_t <= ~c) || !(~wb_pc == 1)) && !(~r_st == 0)) && ~wl_pc == 0) && 2 <= ~e_c) && !(~wl_st == 0))) || ((((((((~c <= ~c_t && ~c_t <= ~c) || !(~wb_pc == 1)) && ~wl_pc == 1) && !(~r_st == 0)) && 0 <= ~d) && ~d <= 0) && 2 <= ~e_c) && !(~wl_st == 0)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((0 <= ~t_b && ~wl_pc == 2) && 2 == ~c_t) && !(~r_st == 0)) && ~data == 2) && ~t_b <= 0) && ~e_f == ~wl_pc) && ~wl_pc == ~wl_st) && !(~c1_st == 0)) && ~c_req_up == 1) || (((((((!(~r_st == 0) && 0 <= ~d) && ~c <= ~c_t) && ~d <= 0) && ~wl_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c)) || (((((((~r_st == 0 || ~wl_st == 0) && 0 <= ~t_b) && ~wl_pc == 2) && !(~r_st == 0)) && ~t_b <= 0) && ~e_f == ~wl_pc) && ~d == 2)) || (((((((~wb_pc == 1 && (~r_st == 0 || ~wl_st == 0)) && ~wl_pc == 1) && !(~r_st == 0)) && 0 <= ~d) && ~c2_pc == 1) && ~d <= 0) && ~c1_pc == 1)) || (((((((((~r_st == 0 || ~wl_st == 0) && 0 <= ~t_b) && ~wl_pc == 2) && ~data == 2) && ~t_b <= 0) && ~e_f == ~wl_pc) && 2 == ~c) && !(~c1_st == 0)) && !(~wl_st == 0))) || ((((((~c <= ~c_t && ~c_t <= ~c) || !(~wb_pc == 1)) && !(~r_st == 0)) && ~wl_pc == 0) && 2 <= ~e_c) && !(~wl_st == 0))) || ((((((((~c <= ~c_t && ~c_t <= ~c) || !(~wb_pc == 1)) && ~wl_pc == 1) && !(~r_st == 0)) && 0 <= ~d) && ~d <= 0) && 2 <= ~e_c) && !(~wl_st == 0)) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((((((((((~r_st == 0 && 0 <= ~t_b) && ~wl_pc == 2) && ~data == 2) && ~t_b <= 0) && ~e_f == ~wl_pc) && 2 == ~c) && !(~c1_st == 0)) && !(~wl_st == 0)) || ((((((~c <= ~c_t && ~c_t <= ~c) || !(~wb_pc == 1)) && !(~r_st == 0)) && ~wl_pc == 0) && 2 <= ~e_c) && !(~wl_st == 0))) || ((((((((~c <= ~c_t && ~c_t <= ~c) || !(~wb_pc == 1)) && ~wl_pc == 1) && !(~r_st == 0)) && 0 <= ~d) && ~d <= 0) && 2 <= ~e_c) && !(~wl_st == 0))) || (((((((((0 <= ~t_b && ~wl_pc == 2) && 2 == ~c_t) && !(~r_st == 0)) && ~data == 2) && ~t_b <= 0) && ~e_f == ~wl_pc) && ~wl_pc == ~wl_st) && !(~c1_st == 0)) && ~c_req_up == 1) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: (((((((~wb_pc == 1 && ~wl_pc == 1) && !(~r_st == 0)) && 0 <= ~d) && ~c2_pc == 1) && ~d <= 0) && ~c1_pc == 1) && !(~wl_st == 0)) || ((~wl_pc == 2 && ~e_f == ~wl_pc) && (((0 <= ~t_b && !(~r_st == 0)) && ~t_b <= 0) && ~d == 2) && !(~wl_st == 0)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((~r_st == 0 || ~wl_st == 0) && 0 <= ~t_b) && ~wl_pc == 2) && ~data == 2) && ~t_b <= 0) && ~e_f == ~wl_pc) && 2 == ~c) && !(~c1_st == 0)) && !(~wl_st == 0)) || (((((((((~r_st == 0 || ~wl_st == 0) && !(~r_st == 0)) && 0 <= ~d) && ~c <= ~c_t) && ~d <= 0) && ~wl_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c)) || ((((((((~wl_pc == 1 && ~wb_pc == 1) && (~r_st == 0 || ~wl_st == 0)) && !(~r_st == 0)) && 0 <= ~d) && ~c2_pc == 1) && ~d <= 0) && ~c1_pc == 1) && 2 <= ~e_c) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((~r_st == 0 && 0 <= ~t_b) && ~wl_pc == 2) && ~data == 2) && ~t_b <= 0) && ~e_f == ~wl_pc) && 2 == ~c) && !(~c1_st == 0)) && !(~wl_st == 0)) || (((((((~wl_pc == 1 && 0 <= ~d) && ~c <= ~c_t) && ~d <= 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) && !(~wl_st == 0))) || ((~r_st == 0 && ~wl_pc == 1) && !(~wl_st == 0))) || ((((((!(~r_st == 0) && ~c <= ~c_t) && ~wl_pc == 0) && ~wb_pc == 0) && 2 <= ~e_c) && ~c_t <= ~c) && !(~wl_st == 0))) || ((((((((((((~wl_pc == 2 && ~d == ~t_b) && 0 <= ~d) && ~c1_st == 0) && ~c2_pc == 1) && ~wl_pc == ~wl_st) && ~d == ~data) && ~c2_st == 0) && ~wb_pc == 1) && !(~r_st == 0)) && ~e_f == ~wl_pc) && ~d <= 0) && ~c1_pc == 1) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. SAFE Result, 2.4s OverallTime, 7 OverallIterations, 9 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 121 SDtfs, 118 SDslu, 214 SDs, 0 SdLazy, 209 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 56 NumberOfFragments, 1087 HoareAnnotationTreeSize, 12 FomulaSimplifications, 350 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 113 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 25523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 181/247 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/toy.cil.c_34.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-29-32-091.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/toy.cil.c_34.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-29-32-091.csv Received shutdown request...