java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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/diamond2.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:15:07,497 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:15:07,500 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:15:07,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:15:07,514 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:15:07,515 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:15:07,516 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:15:07,518 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:15:07,520 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:15:07,521 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:15:07,522 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:15:07,522 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:15:07,523 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:15:07,524 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:15:07,525 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:15:07,526 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:15:07,527 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:15:07,529 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:15:07,531 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:15:07,533 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:15:07,534 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:15:07,535 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:15:07,538 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:15:07,538 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:15:07,538 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:15:07,539 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:15:07,540 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:15:07,541 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:15:07,542 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:15:07,543 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:15:07,543 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:15:07,544 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:15:07,544 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:15:07,544 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:15:07,545 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:15:07,546 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:15:07,546 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:15:07,562 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:15:07,563 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:15:07,564 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:15:07,565 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:15:07,565 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:15:07,565 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:15:07,565 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:15:07,565 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:15:07,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:15:07,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:15:07,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:15:07,668 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:15:07,669 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:15:07,670 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond2.i_4.bpl [2018-09-26 08:15:07,670 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond2.i_4.bpl' [2018-09-26 08:15:07,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:15:07,760 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:15:07,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:15:07,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:15:07,762 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:15:07,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:07" (1/1) ... [2018-09-26 08:15:07,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:07" (1/1) ... [2018-09-26 08:15:07,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:15:07,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:15:07,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:15:07,804 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:15:07,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:07" (1/1) ... [2018-09-26 08:15:07,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:07" (1/1) ... [2018-09-26 08:15:07,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:07" (1/1) ... [2018-09-26 08:15:07,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:07" (1/1) ... [2018-09-26 08:15:07,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:07" (1/1) ... [2018-09-26 08:15:07,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:07" (1/1) ... [2018-09-26 08:15:07,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:07" (1/1) ... [2018-09-26 08:15:07,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:15:07,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:15:07,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:15:07,829 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:15:07,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:07" (1/1) ... [2018-09-26 08:15:07,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:15:07,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:15:08,131 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:15:08,132 INFO L202 PluginConnector]: Adding new model diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:15:08 BoogieIcfgContainer [2018-09-26 08:15:08,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:15:08,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:15:08,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:15:08,137 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:15:08,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:15:07" (1/2) ... [2018-09-26 08:15:08,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601c91e6 and model type diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:15:08, skipping insertion in model container [2018-09-26 08:15:08,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:15:08" (2/2) ... [2018-09-26 08:15:08,141 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond2.i_4.bpl [2018-09-26 08:15:08,151 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:15:08,159 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:15:08,204 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:15:08,205 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:15:08,205 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:15:08,205 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:15:08,206 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:15:08,206 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:15:08,206 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:15:08,206 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:15:08,206 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:15:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 08:15:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:15:08,230 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:08,231 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:15:08,233 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:08,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:08,239 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-09-26 08:15:08,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:08,344 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:15:08,345 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:15:08,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:15:08,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:15:08,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:15:08,366 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-09-26 08:15:08,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:08,411 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-09-26 08:15:08,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:15:08,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-26 08:15:08,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:08,425 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:15:08,426 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:15:08,429 INFO L605 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-09-26 08:15:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:15:08,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:15:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:15:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:15:08,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-09-26 08:15:08,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:08,470 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:15:08,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:15:08,470 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:15:08,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:15:08,471 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:08,471 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-09-26 08:15:08,471 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:08,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:08,472 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-09-26 08:15:08,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:08,531 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:08,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:15:08,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:15:08,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:15:08,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:15:08,536 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-09-26 08:15:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:08,595 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:15:08,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:15:08,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-26 08:15:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:08,597 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:15:08,598 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:15:08,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:15:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:15:08,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:15:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:15:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:15:08,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-09-26 08:15:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:08,603 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:15:08,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:15:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:15:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:15:08,604 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:08,605 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-09-26 08:15:08,605 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:08,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-09-26 08:15:08,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:08,681 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:08,681 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:15:08,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:15:08,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:15:08,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:15:08,683 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-09-26 08:15:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:08,775 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:15:08,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:15:08,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-26 08:15:08,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:08,779 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:15:08,779 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:15:08,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:15:08,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:15:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:15:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:15:08,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:15:08,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-26 08:15:08,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:08,789 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:15:08,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:15:08,790 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:15:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:15:08,790 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:08,790 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-09-26 08:15:08,791 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:08,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:08,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-09-26 08:15:08,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:08,861 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:08,861 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:15:08,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:15:08,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:15:08,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:15:08,862 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-09-26 08:15:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:08,953 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:15:08,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:15:08,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-09-26 08:15:08,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:08,954 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:15:08,955 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:15:08,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:15:08,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:15:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:15:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:15:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:15:08,968 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-26 08:15:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:08,968 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:15:08,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:15:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:15:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:15:08,972 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:08,972 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-09-26 08:15:08,972 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:08,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:08,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-09-26 08:15:08,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:09,074 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:09,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:15:09,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:15:09,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:15:09,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:15:09,078 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-09-26 08:15:09,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:09,175 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:15:09,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:15:09,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-09-26 08:15:09,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:09,178 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:15:09,178 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:15:09,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:15:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:15:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:15:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:15:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:15:09,189 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-09-26 08:15:09,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:09,189 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:15:09,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:15:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:15:09,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:15:09,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:09,191 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-09-26 08:15:09,191 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:09,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:09,193 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-09-26 08:15:09,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:09,280 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:09,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:15:09,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:15:09,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:15:09,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:15:09,285 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-09-26 08:15:09,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:09,389 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:15:09,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:15:09,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:15:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:09,392 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:15:09,392 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:15:09,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:15:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:15:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:15:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:15:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:15:09,406 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-09-26 08:15:09,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:09,407 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:15:09,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:15:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:15:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:15:09,408 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:09,408 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-09-26 08:15:09,409 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:09,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:09,409 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-09-26 08:15:09,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:09,770 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:09,770 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:15:09,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:15:09,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:15:09,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:15:09,772 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-09-26 08:15:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:09,823 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-09-26 08:15:09,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:15:09,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:15:09,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:09,824 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:15:09,824 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:15:09,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:15:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:15:09,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:15:09,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:15:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:15:09,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-09-26 08:15:09,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:09,828 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:15:09,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:15:09,828 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:15:09,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:15:09,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:15:09,957 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 1 57) the Hoare annotation is: false [2018-09-26 08:15:09,958 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 57) the Hoare annotation is: true [2018-09-26 08:15:09,958 INFO L422 ceAbstractionStarter]: At program point L29(lines 29 55) the Hoare annotation is: false [2018-09-26 08:15:09,958 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 57) no Hoare annotation was computed. [2018-09-26 08:15:09,960 INFO L422 ceAbstractionStarter]: At program point L54(lines 16 54) the Hoare annotation is: (let ((.cse4 (div ULTIMATE.start_main_~y~5 2))) (let ((.cse2 (* 4294967296 (div (+ ULTIMATE.start_main_~y~5 (* (- 2) .cse4)) 4294967296))) (.cse3 (* 2 .cse4))) (let ((.cse1 (+ .cse2 .cse3 ULTIMATE.start_main_~x~5)) (.cse0 (<= ULTIMATE.start_main_~y~5 (+ .cse2 .cse3)))) (or (and (<= 19 ULTIMATE.start_main_~x~5) .cse0 (<= ULTIMATE.start_main_~x~5 19)) (and (<= ULTIMATE.start_main_~x~5 0) (<= 0 ULTIMATE.start_main_~x~5)) (and (<= 95 ULTIMATE.start_main_~x~5) (<= ULTIMATE.start_main_~x~5 95) .cse0) (and (<= 38 ULTIMATE.start_main_~x~5) (<= .cse1 (+ ULTIMATE.start_main_~y~5 38)) .cse0) (and (<= .cse1 (+ ULTIMATE.start_main_~y~5 114)) (<= 114 ULTIMATE.start_main_~x~5) .cse0) (and .cse0 (<= 76 ULTIMATE.start_main_~x~5) (<= ULTIMATE.start_main_~x~5 76)) (and (<= .cse1 (+ ULTIMATE.start_main_~y~5 57)) .cse0 (<= 57 ULTIMATE.start_main_~x~5)))))) [2018-09-26 08:15:09,960 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 56) the Hoare annotation is: false [2018-09-26 08:15:09,962 INFO L422 ceAbstractionStarter]: At program point L19(lines 19 30) the Hoare annotation is: (let ((.cse4 (div ULTIMATE.start_main_~y~5 2))) (let ((.cse2 (* 4294967296 (div (+ ULTIMATE.start_main_~y~5 (* (- 2) .cse4)) 4294967296))) (.cse3 (* 2 .cse4))) (let ((.cse1 (+ .cse2 .cse3 ULTIMATE.start_main_~x~5)) (.cse0 (<= ULTIMATE.start_main_~y~5 (+ .cse2 .cse3)))) (or (and (<= 19 ULTIMATE.start_main_~x~5) .cse0 (<= ULTIMATE.start_main_~x~5 19)) (and (<= ULTIMATE.start_main_~x~5 0) (<= 0 ULTIMATE.start_main_~x~5)) (and (<= 95 ULTIMATE.start_main_~x~5) (<= ULTIMATE.start_main_~x~5 95) .cse0) (and (<= 38 ULTIMATE.start_main_~x~5) (<= .cse1 (+ ULTIMATE.start_main_~y~5 38)) .cse0) (and (<= .cse1 (+ ULTIMATE.start_main_~y~5 114)) (<= 114 ULTIMATE.start_main_~x~5) .cse0) (and .cse0 (<= 76 ULTIMATE.start_main_~x~5) (<= ULTIMATE.start_main_~x~5 76)) (and (<= .cse1 (+ ULTIMATE.start_main_~y~5 57)) .cse0 (<= 57 ULTIMATE.start_main_~x~5)))))) [2018-09-26 08:15:09,981 INFO L202 PluginConnector]: Adding new model diamond2.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:15:09 BoogieIcfgContainer [2018-09-26 08:15:09,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:15:09,982 INFO L168 Benchmark]: Toolchain (without parser) took 2224.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 158.5 MB). Peak memory consumption was 158.5 MB. Max. memory is 7.1 GB. [2018-09-26 08:15:09,985 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-09-26 08:15:09,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.20 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-09-26 08:15:09,987 INFO L168 Benchmark]: Boogie Preprocessor took 24.47 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-09-26 08:15:09,987 INFO L168 Benchmark]: RCFGBuilder took 303.66 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:15:09,989 INFO L168 Benchmark]: TraceAbstraction took 1847.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-09-26 08:15:09,999 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 42.20 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 24.47 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 303.66 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1847.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 56]: 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: 16]: Loop Invariant Derived loop invariant: (((((((19 <= main_~x~5 && main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2)) && main_~x~5 <= 19) || (main_~x~5 <= 0 && 0 <= main_~x~5)) || ((95 <= main_~x~5 && main_~x~5 <= 95) && main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2))) || ((38 <= main_~x~5 && 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2) + main_~x~5 <= main_~y~5 + 38) && main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2))) || ((4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2) + main_~x~5 <= main_~y~5 + 114 && 114 <= main_~x~5) && main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2))) || ((main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2) && 76 <= main_~x~5) && main_~x~5 <= 76)) || ((4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2) + main_~x~5 <= main_~y~5 + 57 && main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2)) && 57 <= main_~x~5) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((((19 <= main_~x~5 && main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2)) && main_~x~5 <= 19) || (main_~x~5 <= 0 && 0 <= main_~x~5)) || ((95 <= main_~x~5 && main_~x~5 <= 95) && main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2))) || ((38 <= main_~x~5 && 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2) + main_~x~5 <= main_~y~5 + 38) && main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2))) || ((4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2) + main_~x~5 <= main_~y~5 + 114 && 114 <= main_~x~5) && main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2))) || ((main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2) && 76 <= main_~x~5) && main_~x~5 <= 76)) || ((4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2) + main_~x~5 <= main_~y~5 + 57 && main_~y~5 <= 4294967296 * ((main_~y~5 + -2 * (main_~y~5 / 2)) / 4294967296) + 2 * (main_~y~5 / 2)) && 57 <= main_~x~5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 7 OverallIterations, 7 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 0 SDslu, 134 SDs, 0 SdLazy, 181 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 20 NumberOfFragments, 446 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 144 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 11215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/112 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/diamond2.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-15-10-023.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/diamond2.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-15-10-023.csv Received shutdown request...