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/toy/tooDifficultLoopInvariant/HiddenInequality.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:30:47,779 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:30:47,781 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:30:47,794 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:30:47,795 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:30:47,796 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:30:47,797 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:30:47,799 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:30:47,801 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:30:47,802 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:30:47,803 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:30:47,803 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:30:47,804 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:30:47,805 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:30:47,806 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:30:47,807 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:30:47,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:30:47,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:30:47,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:30:47,813 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:30:47,815 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:30:47,816 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:30:47,819 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:30:47,819 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:30:47,819 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:30:47,820 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:30:47,821 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:30:47,822 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:30:47,823 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:30:47,824 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:30:47,824 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:30:47,825 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:30:47,825 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:30:47,826 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:30:47,827 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:30:47,827 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:30:47,828 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:30:47,836 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:30:47,836 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:30:47,838 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:30:47,838 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:30:47,838 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:30:47,838 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:30:47,838 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:30:47,839 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:30:47,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:30:47,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:30:47,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:30:47,923 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:30:47,924 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:30:47,925 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenInequality.bpl [2018-07-25 13:30:47,925 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenInequality.bpl' [2018-07-25 13:30:47,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:30:47,978 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:30:47,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:30:47,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:30:47,979 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:30:48,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:47" (1/1) ... [2018-07-25 13:30:48,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:47" (1/1) ... [2018-07-25 13:30:48,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:30:48,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:30:48,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:30:48,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:30:48,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:47" (1/1) ... [2018-07-25 13:30:48,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:47" (1/1) ... [2018-07-25 13:30:48,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:47" (1/1) ... [2018-07-25 13:30:48,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:47" (1/1) ... [2018-07-25 13:30:48,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:47" (1/1) ... [2018-07-25 13:30:48,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:47" (1/1) ... [2018-07-25 13:30:48,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:47" (1/1) ... [2018-07-25 13:30:48,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:30:48,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:30:48,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:30:48,045 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:30:48,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:47" (1/1) ... [2018-07-25 13:30:48,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:30:48,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:30:48,245 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:30:48,246 INFO L202 PluginConnector]: Adding new model HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:30:48 BoogieIcfgContainer [2018-07-25 13:30:48,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:30:48,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:30:48,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:30:48,251 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:30:48,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:30:47" (1/2) ... [2018-07-25 13:30:48,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380b82aa and model type HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:30:48, skipping insertion in model container [2018-07-25 13:30:48,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:30:48" (2/2) ... [2018-07-25 13:30:48,256 INFO L112 eAbstractionObserver]: Analyzing ICFG HiddenInequality.bpl [2018-07-25 13:30:48,266 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:30:48,275 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:30:48,326 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:30:48,327 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:30:48,327 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:30:48,327 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:30:48,328 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:30:48,328 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:30:48,328 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:30:48,328 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:30:48,329 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:30:48,343 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-25 13:30:48,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 13:30:48,352 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,353 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 13:30:48,355 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,360 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-07-25 13:30:48,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:48,432 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:30:48,435 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:30:48,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:30:48,440 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:30:48,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:30:48,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:30:48,457 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-25 13:30:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:48,482 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 13:30:48,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:30:48,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-25 13:30:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:48,502 INFO L225 Difference]: With dead ends: 9 [2018-07-25 13:30:48,503 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 13:30:48,506 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:30:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 13:30:48,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 13:30:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 13:30:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 13:30:48,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 13:30:48,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:48,543 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 13:30:48,544 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:30:48,544 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 13:30:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:30:48,544 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,545 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:30:48,545 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,545 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-07-25 13:30:48,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:48,574 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:48,574 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:30:48,577 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:30:48,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:30:48,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:30:48,578 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-25 13:30:48,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:48,593 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 13:30:48,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:30:48,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 13:30:48,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:48,594 INFO L225 Difference]: With dead ends: 8 [2018-07-25 13:30:48,594 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 13:30:48,595 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:30:48,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 13:30:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 13:30:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 13:30:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 13:30:48,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 13:30:48,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:48,599 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 13:30:48,599 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:30:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 13:30:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:30:48,600 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,600 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-25 13:30:48,600 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,601 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2018-07-25 13:30:48,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:48,633 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:48,633 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:30:48,634 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:30:48,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:30:48,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:30:48,635 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-25 13:30:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:48,650 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 13:30:48,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:30:48,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 13:30:48,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:48,652 INFO L225 Difference]: With dead ends: 9 [2018-07-25 13:30:48,654 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:30:48,655 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:30:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:30:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:30:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:30:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:30:48,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 13:30:48,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:48,663 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:30:48,663 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:30:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:30:48,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:30:48,664 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,664 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-25 13:30:48,664 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,665 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2018-07-25 13:30:48,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:48,715 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:48,715 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:30:48,715 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:30:48,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:30:48,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:30:48,716 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 13:30:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:48,739 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 13:30:48,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:30:48,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:30:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:48,740 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:30:48,740 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 13:30:48,741 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:30:48,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 13:30:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 13:30:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 13:30:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 13:30:48,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 13:30:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:48,745 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 13:30:48,745 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:30:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 13:30:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:30:48,746 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,746 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-25 13:30:48,746 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2018-07-25 13:30:48,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:48,806 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:48,806 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:30:48,806 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:30:48,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:30:48,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:30:48,807 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-25 13:30:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:48,821 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:30:48,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:30:48,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 13:30:48,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:48,823 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:30:48,823 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:30:48,824 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:30:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:30:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:30:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:30:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:30:48,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 13:30:48,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:48,828 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:30:48,828 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:30:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:30:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:30:48,829 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,831 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-25 13:30:48,832 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2018-07-25 13:30:48,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:48,924 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:48,924 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:30:48,924 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:30:48,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:30:48,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:30:48,925 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-25 13:30:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:48,944 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 13:30:48,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:30:48,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:30:48,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:48,945 INFO L225 Difference]: With dead ends: 12 [2018-07-25 13:30:48,945 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 13:30:48,946 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:30:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 13:30:48,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 13:30:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 13:30:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 13:30:48,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 13:30:48,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:48,950 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 13:30:48,950 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:30:48,950 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 13:30:48,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:30:48,951 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,951 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-25 13:30:48,951 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2018-07-25 13:30:48,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:48,992 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:48,992 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:30:48,992 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:30:48,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:30:48,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:30:48,996 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-25 13:30:49,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:49,025 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:30:49,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:30:49,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 13:30:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:49,026 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:30:49,026 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:30:49,027 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:30:49,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:30:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:30:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:30:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:30:49,036 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 13:30:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:49,036 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:30:49,036 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:30:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:30:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:30:49,037 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:49,037 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-25 13:30:49,037 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:49,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2018-07-25 13:30:49,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:49,128 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:49,129 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:30:49,129 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:30:49,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:30:49,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:30:49,130 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-25 13:30:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:49,162 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 13:30:49,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:30:49,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-25 13:30:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:49,164 INFO L225 Difference]: With dead ends: 14 [2018-07-25 13:30:49,164 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 13:30:49,165 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:30:49,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 13:30:49,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 13:30:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 13:30:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 13:30:49,168 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 13:30:49,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:49,169 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 13:30:49,169 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:30:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 13:30:49,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:30:49,170 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:49,170 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-25 13:30:49,170 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:49,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2018-07-25 13:30:49,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:49,213 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:49,213 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:30:49,214 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:30:49,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:30:49,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:30:49,215 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-25 13:30:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:49,227 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:30:49,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:30:49,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-25 13:30:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:49,228 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:30:49,229 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:30:49,229 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:30:49,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:30:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:30:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:30:49,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:30:49,233 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 13:30:49,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:49,233 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:30:49,234 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:30:49,234 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:30:49,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:30:49,234 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:49,235 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-25 13:30:49,235 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:49,235 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2018-07-25 13:30:49,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:49,310 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:49,310 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:30:49,311 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-07-25 13:30:49,311 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:30:49,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:30:49,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:30:49,312 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-25 13:30:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:49,343 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:30:49,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:30:49,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-25 13:30:49,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:49,344 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:30:49,345 INFO L226 Difference]: Without dead ends: 0 [2018-07-25 13:30:49,345 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:30:49,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-25 13:30:49,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-25 13:30:49,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-25 13:30:49,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-25 13:30:49,346 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-07-25 13:30:49,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:49,347 INFO L472 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-25 13:30:49,347 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:30:49,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-25 13:30:49,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-25 13:30:49,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-25 13:30:49,400 INFO L425 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 22 30) the Hoare annotation is: true [2018-07-25 13:30:49,406 INFO L425 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 22 30) the Hoare annotation is: true [2018-07-25 13:30:49,408 INFO L418 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: (<= 9 s) [2018-07-25 13:30:49,408 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 22 30) no Hoare annotation was computed. [2018-07-25 13:30:49,408 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 29) the Hoare annotation is: false [2018-07-25 13:30:49,413 INFO L418 ceAbstractionStarter]: At program point L25-1(lines 25 28) the Hoare annotation is: (or (<= 9 s) (and (<= i 0) (<= 0 s)) (and (<= 4 s) (<= i 4)) (and (<= i 1) (<= 1 s)) (and (<= 8 s) (<= i 8)) (and (<= i 7) (<= 7 s)) (and (<= i 3) (<= 3 s)) (and (<= 5 s) (<= i 5)) (and (<= i 2) (<= 2 s)) (and (<= i 6) (<= 6 s))) [2018-07-25 13:30:49,428 INFO L202 PluginConnector]: Adding new model HiddenInequality.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:30:49 BoogieIcfgContainer [2018-07-25 13:30:49,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:30:49,429 INFO L168 Benchmark]: Toolchain (without parser) took 1452.34 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-07-25 13:30:49,431 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.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-07-25 13:30:49,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.76 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:30:49,432 INFO L168 Benchmark]: Boogie Preprocessor took 22.13 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:30:49,433 INFO L168 Benchmark]: RCFGBuilder took 202.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:30:49,434 INFO L168 Benchmark]: TraceAbstraction took 1180.69 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: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-07-25 13:30:49,438 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.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 Procedure Inliner took 42.76 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 22.13 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 202.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1180.69 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: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: 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: 25]: Loop Invariant Derived loop invariant: ((((((((9 <= s || (i <= 0 && 0 <= s)) || (4 <= s && i <= 4)) || (i <= 1 && 1 <= s)) || (8 <= s && i <= 8)) || (i <= 7 && 7 <= s)) || (i <= 3 && 3 <= s)) || (5 <= s && i <= 5)) || (i <= 2 && 2 <= s)) || (i <= 6 && 6 <= s) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 1.0s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 30 SDtfs, 9 SDslu, 39 SDs, 0 SdLazy, 111 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=9, 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 16 NumberOfFragments, 73 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 1407 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 45/165 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/HiddenInequality.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-30-49-452.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenInequality.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-30-49-452.csv Received shutdown request...