java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:45:29,237 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:45:29,239 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:45:29,257 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:45:29,257 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:45:29,258 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:45:29,260 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:45:29,261 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:45:29,263 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:45:29,264 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:45:29,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:45:29,265 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:45:29,266 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:45:29,267 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:45:29,268 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:45:29,269 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:45:29,270 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:45:29,272 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:45:29,274 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:45:29,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:45:29,276 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:45:29,278 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:45:29,280 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:45:29,280 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:45:29,281 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:45:29,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:45:29,282 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:45:29,283 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:45:29,284 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:45:29,285 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:45:29,285 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:45:29,286 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:45:29,286 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:45:29,287 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:45:29,288 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:45:29,288 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:45:29,289 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:45:29,303 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:45:29,304 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:45:29,305 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:45:29,305 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:45:29,305 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:45:29,306 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:45:29,306 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:45:29,306 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:45:29,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:45:29,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:45:29,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:45:29,377 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:45:29,377 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:45:29,378 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2018-07-25 08:45:29,378 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2018-07-25 08:45:29,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:45:29,436 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:45:29,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:45:29,437 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:45:29,437 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:45:29,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:29" (1/1) ... [2018-07-25 08:45:29,476 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:29" (1/1) ... [2018-07-25 08:45:29,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:45:29,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:45:29,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:45:29,484 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:45:29,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:29" (1/1) ... [2018-07-25 08:45:29,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:29" (1/1) ... [2018-07-25 08:45:29,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:29" (1/1) ... [2018-07-25 08:45:29,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:29" (1/1) ... [2018-07-25 08:45:29,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:29" (1/1) ... [2018-07-25 08:45:29,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:29" (1/1) ... [2018-07-25 08:45:29,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:29" (1/1) ... [2018-07-25 08:45:29,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:45:29,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:45:29,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:45:29,515 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:45:29,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:29" (1/1) ... [2018-07-25 08:45:29,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 08:45:29,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 08:45:29,810 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 08:45:29,811 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:45:29 BoogieIcfgContainer [2018-07-25 08:45:29,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:45:29,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:45:29,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:45:29,816 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:45:29,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:45:29" (1/2) ... [2018-07-25 08:45:29,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b64f97 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:45:29, skipping insertion in model container [2018-07-25 08:45:29,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:45:29" (2/2) ... [2018-07-25 08:45:29,821 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2018-07-25 08:45:29,831 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:45:29,839 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:45:29,880 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:45:29,881 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:45:29,881 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:45:29,882 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:45:29,882 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:45:29,882 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:45:29,882 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:45:29,883 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:45:29,883 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:45:29,898 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-07-25 08:45:29,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:45:29,907 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:29,908 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 08:45:29,910 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:29,917 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-07-25 08:45:29,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:29,988 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 08:45:29,991 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:45:29,991 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:45:29,995 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:45:30,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:45:30,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:45:30,010 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-07-25 08:45:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:30,044 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2018-07-25 08:45:30,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:45:30,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-07-25 08:45:30,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:30,057 INFO L225 Difference]: With dead ends: 17 [2018-07-25 08:45:30,058 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:45:30,061 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 08:45:30,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:45:30,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:45:30,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:45:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-07-25 08:45:30,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 6 [2018-07-25 08:45:30,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:30,103 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-07-25 08:45:30,103 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:45:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-07-25 08:45:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:45:30,104 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:30,105 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:45:30,105 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:30,105 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2018-07-25 08:45:30,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:30,135 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:30,135 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 08:45:30,139 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:45:30,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:45:30,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:45:30,140 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 4 states. [2018-07-25 08:45:30,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:30,172 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-07-25 08:45:30,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:45:30,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-07-25 08:45:30,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:30,174 INFO L225 Difference]: With dead ends: 19 [2018-07-25 08:45:30,177 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 08:45:30,179 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 08:45:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 08:45:30,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 08:45:30,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 08:45:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-07-25 08:45:30,183 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2018-07-25 08:45:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:30,184 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-07-25 08:45:30,184 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:45:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-07-25 08:45:30,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:45:30,185 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:30,185 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-07-25 08:45:30,185 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:30,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1946764223, now seen corresponding path program 2 times [2018-07-25 08:45:30,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:30,218 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 08:45:30,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:30,219 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:45:30,219 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:45:30,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:45:30,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:45:30,220 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 5 states. [2018-07-25 08:45:30,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:30,256 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-07-25 08:45:30,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:45:30,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-07-25 08:45:30,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:30,260 INFO L225 Difference]: With dead ends: 21 [2018-07-25 08:45:30,260 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:45:30,261 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 08:45:30,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:45:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:45:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:45:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-07-25 08:45:30,268 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2018-07-25 08:45:30,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:30,269 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-07-25 08:45:30,269 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:45:30,269 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-07-25 08:45:30,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:45:30,271 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:30,271 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-07-25 08:45:30,271 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:30,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1715698183, now seen corresponding path program 3 times [2018-07-25 08:45:30,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:30,329 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:30,329 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:45:30,330 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:45:30,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:45:30,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:45:30,331 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 6 states. [2018-07-25 08:45:30,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:30,356 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-07-25 08:45:30,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:45:30,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-07-25 08:45:30,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:30,359 INFO L225 Difference]: With dead ends: 23 [2018-07-25 08:45:30,359 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 08:45:30,360 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 08:45:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 08:45:30,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 08:45:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 08:45:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-07-25 08:45:30,370 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2018-07-25 08:45:30,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:30,372 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-07-25 08:45:30,372 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:45:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-07-25 08:45:30,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:45:30,373 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:30,373 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-07-25 08:45:30,373 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:30,374 INFO L82 PathProgramCache]: Analyzing trace with hash 531112371, now seen corresponding path program 4 times [2018-07-25 08:45:30,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:30,449 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:30,449 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:45:30,450 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:45:30,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:45:30,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:45:30,451 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 7 states. [2018-07-25 08:45:30,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:30,490 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-07-25 08:45:30,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:45:30,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-07-25 08:45:30,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:30,492 INFO L225 Difference]: With dead ends: 25 [2018-07-25 08:45:30,492 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 08:45:30,493 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 08:45:30,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 08:45:30,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 08:45:30,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 08:45:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-07-25 08:45:30,498 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2018-07-25 08:45:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:30,499 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-07-25 08:45:30,499 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:45:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-07-25 08:45:30,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:45:30,500 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:30,500 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-07-25 08:45:30,500 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:30,501 INFO L82 PathProgramCache]: Analyzing trace with hash -652495123, now seen corresponding path program 5 times [2018-07-25 08:45:30,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-25 08:45:30,571 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:45:30,571 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:45:30,572 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:45:30,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:45:30,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:45:30,573 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2018-07-25 08:45:30,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:30,621 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-07-25 08:45:30,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:45:30,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-07-25 08:45:30,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:30,622 INFO L225 Difference]: With dead ends: 25 [2018-07-25 08:45:30,623 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 08:45:30,623 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 08:45:30,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 08:45:30,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-07-25 08:45:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 08:45:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-07-25 08:45:30,630 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2018-07-25 08:45:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:30,631 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-07-25 08:45:30,631 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:45:30,631 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-07-25 08:45:30,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:45:30,632 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:30,632 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:45:30,632 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:30,633 INFO L82 PathProgramCache]: Analyzing trace with hash -386140989, now seen corresponding path program 1 times [2018-07-25 08:45:30,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-25 08:45:30,673 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:45:30,673 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 08:45:30,674 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:45:30,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:45:30,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:45:30,675 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-07-25 08:45:30,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:30,756 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-07-25 08:45:30,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:45:30,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-07-25 08:45:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:30,757 INFO L225 Difference]: With dead ends: 31 [2018-07-25 08:45:30,757 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 08:45:30,760 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:45:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 08:45:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-07-25 08:45:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 08:45:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-07-25 08:45:30,768 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-07-25 08:45:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:30,769 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-07-25 08:45:30,769 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:45:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-07-25 08:45:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:45:30,770 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:30,771 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:45:30,771 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:30,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1646565475, now seen corresponding path program 1 times [2018-07-25 08:45:30,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-25 08:45:30,810 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:30,810 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:45:30,810 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:45:30,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:45:30,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:45:30,811 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2018-07-25 08:45:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:30,887 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-07-25 08:45:30,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:45:30,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-07-25 08:45:30,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:30,889 INFO L225 Difference]: With dead ends: 29 [2018-07-25 08:45:30,889 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 08:45:30,892 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:45:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 08:45:30,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 08:45:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 08:45:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-07-25 08:45:30,904 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 22 [2018-07-25 08:45:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:30,904 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-07-25 08:45:30,904 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:45:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-07-25 08:45:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 08:45:30,906 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:30,906 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 08:45:30,907 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:30,907 INFO L82 PathProgramCache]: Analyzing trace with hash -267137677, now seen corresponding path program 2 times [2018-07-25 08:45:30,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-07-25 08:45:30,958 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:30,958 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:45:30,959 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:45:30,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:45:30,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:45:30,960 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2018-07-25 08:45:31,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:31,005 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-07-25 08:45:31,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:45:31,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-07-25 08:45:31,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:31,006 INFO L225 Difference]: With dead ends: 41 [2018-07-25 08:45:31,006 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 08:45:31,007 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:45:31,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 08:45:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-07-25 08:45:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 08:45:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-07-25 08:45:31,017 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2018-07-25 08:45:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:31,017 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-07-25 08:45:31,018 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:45:31,018 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-07-25 08:45:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 08:45:31,019 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:31,019 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1] [2018-07-25 08:45:31,019 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:31,020 INFO L82 PathProgramCache]: Analyzing trace with hash -735824691, now seen corresponding path program 3 times [2018-07-25 08:45:31,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-25 08:45:31,070 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:31,070 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:45:31,074 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:45:31,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:45:31,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:45:31,075 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2018-07-25 08:45:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:31,156 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-07-25 08:45:31,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:45:31,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-07-25 08:45:31,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:31,157 INFO L225 Difference]: With dead ends: 45 [2018-07-25 08:45:31,157 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 08:45:31,158 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:45:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 08:45:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 08:45:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 08:45:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-07-25 08:45:31,169 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2018-07-25 08:45:31,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:31,169 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-07-25 08:45:31,170 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:45:31,170 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-07-25 08:45:31,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 08:45:31,173 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:31,173 INFO L354 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 3, 3, 3, 1, 1, 1, 1] [2018-07-25 08:45:31,174 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:31,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2097831421, now seen corresponding path program 4 times [2018-07-25 08:45:31,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-07-25 08:45:31,265 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:31,265 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:45:31,265 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:45:31,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:45:31,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:45:31,267 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-07-25 08:45:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:31,362 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-07-25 08:45:31,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:45:31,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-07-25 08:45:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:31,364 INFO L225 Difference]: With dead ends: 55 [2018-07-25 08:45:31,364 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 08:45:31,367 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:45:31,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 08:45:31,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-07-25 08:45:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 08:45:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-07-25 08:45:31,387 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 34 [2018-07-25 08:45:31,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:31,389 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-07-25 08:45:31,389 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:45:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-07-25 08:45:31,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 08:45:31,391 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:31,392 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 5, 4, 4, 3, 3, 1, 1, 1, 1] [2018-07-25 08:45:31,393 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash -103625897, now seen corresponding path program 5 times [2018-07-25 08:45:31,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 28 proven. 24 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-07-25 08:45:31,459 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:31,459 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:45:31,460 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:45:31,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:45:31,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:45:31,461 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 9 states. [2018-07-25 08:45:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:31,556 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-07-25 08:45:31,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 08:45:31,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-07-25 08:45:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:31,558 INFO L225 Difference]: With dead ends: 61 [2018-07-25 08:45:31,559 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 08:45:31,560 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:45:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 08:45:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 08:45:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 08:45:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-07-25 08:45:31,579 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 36 [2018-07-25 08:45:31,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:31,580 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-07-25 08:45:31,580 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:45:31,580 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-07-25 08:45:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 08:45:31,581 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:31,582 INFO L354 BasicCegarLoop]: trace histogram [10, 6, 6, 5, 5, 4, 4, 1, 1, 1, 1] [2018-07-25 08:45:31,582 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:31,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1754318879, now seen corresponding path program 6 times [2018-07-25 08:45:31,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-07-25 08:45:31,663 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:31,663 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:45:31,664 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:45:31,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:45:31,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:45:31,666 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 8 states. [2018-07-25 08:45:31,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:31,725 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-07-25 08:45:31,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 08:45:31,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-07-25 08:45:31,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:31,727 INFO L225 Difference]: With dead ends: 73 [2018-07-25 08:45:31,727 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 08:45:31,731 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:45:31,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 08:45:31,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-07-25 08:45:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 08:45:31,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-07-25 08:45:31,752 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 44 [2018-07-25 08:45:31,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:31,752 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-07-25 08:45:31,753 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:45:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-07-25 08:45:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 08:45:31,754 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:31,757 INFO L354 BasicCegarLoop]: trace histogram [11, 7, 6, 5, 5, 4, 4, 1, 1, 1, 1] [2018-07-25 08:45:31,757 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:31,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1924807867, now seen corresponding path program 7 times [2018-07-25 08:45:31,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 74 proven. 44 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-07-25 08:45:31,817 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:31,817 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:45:31,822 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:45:31,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:45:31,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:45:31,827 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 11 states. [2018-07-25 08:45:31,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:31,921 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2018-07-25 08:45:31,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:45:31,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-07-25 08:45:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:31,923 INFO L225 Difference]: With dead ends: 81 [2018-07-25 08:45:31,923 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 08:45:31,924 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:45:31,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 08:45:31,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 08:45:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 08:45:31,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-07-25 08:45:31,951 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 46 [2018-07-25 08:45:31,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:31,952 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-07-25 08:45:31,952 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:45:31,952 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-07-25 08:45:31,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 08:45:31,955 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:31,955 INFO L354 BasicCegarLoop]: trace histogram [15, 10, 6, 6, 5, 5, 5, 1, 1, 1, 1] [2018-07-25 08:45:31,955 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:31,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1394491679, now seen corresponding path program 8 times [2018-07-25 08:45:31,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:32,161 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 134 proven. 52 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-07-25 08:45:32,162 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:32,162 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:45:32,162 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:45:32,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:45:32,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:45:32,163 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 13 states. [2018-07-25 08:45:32,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:32,214 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-07-25 08:45:32,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:45:32,215 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-07-25 08:45:32,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:32,215 INFO L225 Difference]: With dead ends: 59 [2018-07-25 08:45:32,216 INFO L226 Difference]: Without dead ends: 0 [2018-07-25 08:45:32,217 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:45:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-25 08:45:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-25 08:45:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-25 08:45:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-25 08:45:32,218 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2018-07-25 08:45:32,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:32,219 INFO L472 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-25 08:45:32,219 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:45:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-25 08:45:32,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-25 08:45:32,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-25 08:45:32,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:45:32,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:45:32,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:45:32,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:45:32,400 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2018-07-25 08:45:32,401 INFO L418 ceAbstractionStarter]: At program point L56(lines 56 70) the Hoare annotation is: (and (<= ~n 5) (= 0 (select ~array 1)) (<= 5 ~n) (= ULTIMATE.start_SelectionSort_~lh~4 0) (= 0 (select ~array 0))) [2018-07-25 08:45:32,401 INFO L418 ceAbstractionStarter]: At program point L79(lines 79 91) the Hoare annotation is: (and (<= (+ ULTIMATE.start_SelectionSort_~i~4 4) ~n) (<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ULTIMATE.start_SelectionSort_~i~4) (<= ~n 5) (= 0 (select ~array 1)) (= 0 ULTIMATE.start_SelectionSort_~rh~4) (= ULTIMATE.start_SelectionSort_~lh~4 0) (= 0 (select ~array 0))) [2018-07-25 08:45:32,402 INFO L418 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2018-07-25 08:45:32,402 INFO L418 ceAbstractionStarter]: At program point L98(lines 74 98) the Hoare annotation is: (and (<= (+ ULTIMATE.start_SelectionSort_~i~4 4) ~n) (<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ULTIMATE.start_SelectionSort_~i~4) (<= ~n 5) (= 0 (select ~array 1)) (= 0 ULTIMATE.start_SelectionSort_~rh~4) (= ULTIMATE.start_SelectionSort_~lh~4 0) (= 0 (select ~array 0))) [2018-07-25 08:45:32,402 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) the Hoare annotation is: false [2018-07-25 08:45:32,403 INFO L425 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 5 99) the Hoare annotation is: true [2018-07-25 08:45:32,403 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 5 99) no Hoare annotation was computed. [2018-07-25 08:45:32,403 INFO L418 ceAbstractionStarter]: At program point L90(lines 46 90) the Hoare annotation is: (and (<= ~n 5) (= 0 (select ~array 1)) (<= 5 ~n) (= ULTIMATE.start_SelectionSort_~lh~4 0) (= 0 (select ~array 0))) [2018-07-25 08:45:32,404 INFO L418 ceAbstractionStarter]: At program point L53(lines 32 53) the Hoare annotation is: (and (<= ~n 5) (= 0 (select ~array 1)) (<= 5 ~n) (= 0 (select ~array 0))) [2018-07-25 08:45:32,404 INFO L418 ceAbstractionStarter]: At program point L35(lines 35 47) the Hoare annotation is: (and (<= ~n 5) (= 0 (select ~array 1)) (<= 5 ~n) (= 0 (select ~array 0))) [2018-07-25 08:45:32,419 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:45:32 BoogieIcfgContainer [2018-07-25 08:45:32,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:45:32,420 INFO L168 Benchmark]: Toolchain (without parser) took 2985.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 222.0 MB). Peak memory consumption was 222.0 MB. Max. memory is 7.1 GB. [2018-07-25 08:45:32,422 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:45:32,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.07 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 08:45:32,424 INFO L168 Benchmark]: Boogie Preprocessor took 29.83 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 08:45:32,424 INFO L168 Benchmark]: RCFGBuilder took 297.17 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-07-25 08:45:32,425 INFO L168 Benchmark]: TraceAbstraction took 2606.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 211.4 MB). Peak memory consumption was 211.4 MB. Max. memory is 7.1 GB. [2018-07-25 08:45:32,429 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 47.07 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 29.83 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 297.17 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 2606.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 211.4 MB). Peak memory consumption was 211.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 76]: 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: 79]: Loop Invariant Derived loop invariant: (((((SelectionSort_~i~4 + 4 <= ~n && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && ~n <= 5) && 0 == ~array[1]) && 0 == SelectionSort_~rh~4) && SelectionSort_~lh~4 == 0) && 0 == ~array[0] - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((~n <= 5 && 0 == ~array[1]) && 5 <= ~n) && SelectionSort_~lh~4 == 0) && 0 == ~array[0] - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((~n <= 5 && 0 == ~array[1]) && 5 <= ~n) && 0 == ~array[0] - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((SelectionSort_~i~4 + 4 <= ~n && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && ~n <= 5) && 0 == ~array[1]) && 0 == SelectionSort_~rh~4) && SelectionSort_~lh~4 == 0) && 0 == ~array[0] - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (((~n <= 5 && 0 == ~array[1]) && 5 <= ~n) && SelectionSort_~lh~4 == 0) && 0 == ~array[0] - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((~n <= 5 && 0 == ~array[1]) && 5 <= ~n) && 0 == ~array[0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. SAFE Result, 2.5s OverallTime, 15 OverallIterations, 15 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 147 SDtfs, 125 SDslu, 341 SDs, 0 SdLazy, 343 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 10 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 31 NumberOfFragments, 137 HoareAnnotationTreeSize, 9 FomulaSimplifications, 1816 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 608 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 363 ConstructedInterpolants, 0 QuantifiedInterpolants, 53763 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 760/952 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/eureka_05.i_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-45-32-445.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/eureka_05.i_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-45-32-445.csv Received shutdown request...