java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:20:04,239 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:20:04,241 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:20:04,258 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:20:04,259 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:20:04,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:20:04,262 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:20:04,265 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:20:04,266 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:20:04,267 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:20:04,268 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:20:04,269 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:20:04,270 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:20:04,271 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:20:04,272 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:20:04,273 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:20:04,280 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:20:04,285 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:20:04,290 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:20:04,295 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:20:04,298 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:20:04,301 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:20:04,306 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:20:04,307 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:20:04,307 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:20:04,308 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:20:04,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:20:04,314 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:20:04,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:20:04,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:20:04,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:20:04,322 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:20:04,323 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:20:04,323 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:20:04,324 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:20:04,326 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:20:04,327 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:20:04,343 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:20:04,344 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:20:04,349 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:20:04,349 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:20:04,352 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:20:04,352 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:20:04,353 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:20:04,353 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:20:04,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:20:04,436 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:20:04,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:20:04,445 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:20:04,446 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:20:04,446 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_4.bpl [2018-09-26 08:20:04,447 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_4.bpl' [2018-09-26 08:20:04,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:20:04,528 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:20:04,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:20:04,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:20:04,529 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:20:04,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:04" (1/1) ... [2018-09-26 08:20:04,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:04" (1/1) ... [2018-09-26 08:20:04,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:20:04,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:20:04,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:20:04,579 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:20:04,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:04" (1/1) ... [2018-09-26 08:20:04,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:04" (1/1) ... [2018-09-26 08:20:04,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:04" (1/1) ... [2018-09-26 08:20:04,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:04" (1/1) ... [2018-09-26 08:20:04,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:04" (1/1) ... [2018-09-26 08:20:04,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:04" (1/1) ... [2018-09-26 08:20:04,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:04" (1/1) ... [2018-09-26 08:20:04,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:20:04,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:20:04,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:20:04,606 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:20:04,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:04" (1/1) ... [2018-09-26 08:20:04,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:20:04,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:20:04,862 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:20:04,863 INFO L202 PluginConnector]: Adding new model sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:20:04 BoogieIcfgContainer [2018-09-26 08:20:04,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:20:04,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:20:04,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:20:04,870 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:20:04,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:04" (1/2) ... [2018-09-26 08:20:04,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f843f9e and model type sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:20:04, skipping insertion in model container [2018-09-26 08:20:04,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:20:04" (2/2) ... [2018-09-26 08:20:04,877 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04.i_4.bpl [2018-09-26 08:20:04,887 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:20:04,897 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:20:04,944 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:20:04,945 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:20:04,945 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:20:04,945 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:20:04,945 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:20:04,946 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:20:04,946 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:20:04,946 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:20:04,946 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:20:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 08:20:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:20:04,975 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:04,977 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:20:04,978 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:04,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:04,988 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-09-26 08:20:04,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:05,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:05,062 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:20:05,063 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:20:05,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:20:05,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:20:05,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:20:05,084 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-09-26 08:20:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:05,122 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-09-26 08:20:05,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:20:05,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-26 08:20:05,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:05,136 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:20:05,136 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:20:05,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:20:05,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:20:05,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-09-26 08:20:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:20:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:20:05,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2018-09-26 08:20:05,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:05,188 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:20:05,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:20:05,188 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:20:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:20:05,189 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:05,189 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-09-26 08:20:05,190 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:05,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:05,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1808144116, now seen corresponding path program 1 times [2018-09-26 08:20:05,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:05,219 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:05,219 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:20:05,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:20:05,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:20:05,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:20:05,224 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2018-09-26 08:20:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:05,254 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:20:05,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:20:05,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-09-26 08:20:05,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:05,256 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:20:05,256 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:20:05,257 INFO L605 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-09-26 08:20:05,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:20:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-09-26 08:20:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:20:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:20:05,262 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2018-09-26 08:20:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:05,262 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:20:05,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:20:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:20:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:20:05,263 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:05,264 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2018-09-26 08:20:05,264 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:05,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:05,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1056230233, now seen corresponding path program 2 times [2018-09-26 08:20:05,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:05,308 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:05,309 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:20:05,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:20:05,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:20:05,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:20:05,312 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 5 states. [2018-09-26 08:20:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:05,341 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:20:05,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:20:05,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-09-26 08:20:05,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:05,343 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:20:05,343 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:20:05,344 INFO L605 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-09-26 08:20:05,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:20:05,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-09-26 08:20:05,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:20:05,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:20:05,349 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2018-09-26 08:20:05,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:05,349 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:20:05,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:20:05,350 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:20:05,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:20:05,351 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:05,351 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2018-09-26 08:20:05,351 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:05,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:05,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1222224364, now seen corresponding path program 3 times [2018-09-26 08:20:05,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:05,417 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:05,417 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:20:05,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:20:05,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:20:05,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:20:05,419 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2018-09-26 08:20:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:05,447 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:20:05,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:20:05,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-09-26 08:20:05,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:05,448 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:20:05,448 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:20:05,449 INFO L605 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-09-26 08:20:05,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:20:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-09-26 08:20:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:20:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:20:05,455 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-09-26 08:20:05,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:05,455 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:20:05,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:20:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:20:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:20:05,456 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:05,457 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2018-09-26 08:20:05,457 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:05,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:05,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1448944007, now seen corresponding path program 4 times [2018-09-26 08:20:05,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:05,521 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:05,524 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:20:05,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:20:05,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:20:05,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:20:05,526 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2018-09-26 08:20:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:05,560 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:20:05,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:20:05,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-09-26 08:20:05,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:05,561 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:20:05,561 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:20:05,562 INFO L605 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-09-26 08:20:05,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:20:05,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-09-26 08:20:05,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:20:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:20:05,568 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2018-09-26 08:20:05,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:05,569 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:20:05,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:20:05,569 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:20:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:20:05,572 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:05,572 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1] [2018-09-26 08:20:05,574 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:05,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:05,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1071824180, now seen corresponding path program 5 times [2018-09-26 08:20:05,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:05,644 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:05,644 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:20:05,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:20:05,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:20:05,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:20:05,647 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2018-09-26 08:20:05,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:05,717 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:20:05,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:20:05,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-09-26 08:20:05,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:05,718 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:20:05,719 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:20:05,719 INFO L605 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-09-26 08:20:05,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:20:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-09-26 08:20:05,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:20:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:20:05,738 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2018-09-26 08:20:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:05,739 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:20:05,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:20:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:20:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:20:05,741 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:05,741 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1] [2018-09-26 08:20:05,741 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:05,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:05,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1929504359, now seen corresponding path program 6 times [2018-09-26 08:20:05,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:05,836 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:05,837 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:20:05,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:20:05,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:20:05,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:20:05,838 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-09-26 08:20:05,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:05,875 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:20:05,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:20:05,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-09-26 08:20:05,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:05,877 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:20:05,877 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:20:05,878 INFO L605 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-09-26 08:20:05,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:20:05,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-09-26 08:20:05,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:20:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:20:05,884 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2018-09-26 08:20:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:05,884 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:20:05,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:20:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:20:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:20:05,885 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:05,886 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2018-09-26 08:20:05,886 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:05,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:05,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1975694252, now seen corresponding path program 7 times [2018-09-26 08:20:05,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:05,958 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:05,959 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:05,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:20:05,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:20:05,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:20:05,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:20:05,961 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2018-09-26 08:20:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:06,013 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:20:06,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:20:06,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-09-26 08:20:06,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:06,016 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:20:06,016 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:20:06,017 INFO L605 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-09-26 08:20:06,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:20:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:20:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:20:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:20:06,026 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2018-09-26 08:20:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:06,026 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:20:06,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:20:06,029 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:20:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:20:06,030 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:06,030 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1] [2018-09-26 08:20:06,030 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:06,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:06,035 INFO L82 PathProgramCache]: Analyzing trace with hash 326599495, now seen corresponding path program 8 times [2018-09-26 08:20:06,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-26 08:20:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-26 08:20:06,102 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-09-26 08:20:06,143 INFO L202 PluginConnector]: Adding new model sum04.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:20:06 BoogieIcfgContainer [2018-09-26 08:20:06,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:20:06,145 INFO L168 Benchmark]: Toolchain (without parser) took 1619.41 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-09-26 08:20:06,147 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:20:06,150 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:20:06,151 INFO L168 Benchmark]: Boogie Preprocessor took 27.04 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:20:06,153 INFO L168 Benchmark]: RCFGBuilder took 257.58 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-09-26 08:20:06,154 INFO L168 Benchmark]: TraceAbstraction took 1279.24 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-09-26 08:20:06,158 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.22 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 48.78 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 27.04 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 257.58 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 1279.24 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: - CounterExampleResult [Line: 33]: assertion can be violated assertion can be violated We found a FailurePath: [L10] havoc main_#res; [L11] havoc main_#t~post0, main_~i~4, main_~sn~4; [L12] havoc main_~i~4; [L13] main_~sn~4 := 0; [L14] main_~i~4 := 1; VAL [main_~i~4=1, main_~sn~4=0] [L17] assume true; VAL [main_~i~4=1, main_~sn~4=0] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=1, main_~sn~4=0] [L37] assume main_~i~4 < 4; [L38] main_~sn~4 := main_~sn~4 + 2; [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=2, main_~sn~4=2] [L17] assume true; VAL [main_~i~4=2, main_~sn~4=2] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=2, main_~sn~4=2] [L37] assume main_~i~4 < 4; [L38] main_~sn~4 := main_~sn~4 + 2; [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=3, main_~sn~4=4] [L17] assume true; VAL [main_~i~4=3, main_~sn~4=4] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=3, main_~sn~4=4] [L37] assume main_~i~4 < 4; [L38] main_~sn~4 := main_~sn~4 + 2; [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=4, main_~sn~4=6] [L17] assume true; VAL [main_~i~4=4, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=4, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=5, main_~sn~4=6] [L17] assume true; VAL [main_~i~4=5, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=5, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=6, main_~sn~4=6] [L17] assume true; VAL [main_~i~4=6, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=6, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=7, main_~sn~4=6] [L17] assume true; VAL [main_~i~4=7, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=7, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=8, main_~sn~4=6] [L17] assume true; VAL [main_~i~4=8, main_~sn~4=6] [L30] assume !!(main_~i~4 <= 8); VAL [main_~i~4=8, main_~sn~4=6] [L41] assume !(main_~i~4 < 4); [L44] main_#t~post0 := main_~i~4; [L45] main_~i~4 := main_#t~post0 + 1; [L46] havoc main_#t~post0; VAL [main_~i~4=9, main_~sn~4=6] [L17] assume true; VAL [main_~i~4=9, main_~sn~4=6] [L22] assume !(main_~i~4 <= 8); [L23] __VERIFIER_assert_#in~cond := (if main_~sn~4 == 16 || main_~sn~4 == 0 then 1 else 0); [L24] havoc __VERIFIER_assert_~cond; [L25] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L26] assume __VERIFIER_assert_~cond == 0; [L27] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~4=9, main_~sn~4=6] [L33] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~4=9, main_~sn~4=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. UNSAFE Result, 1.1s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 32 SDtfs, 36 SDslu, 66 SDs, 0 SdLazy, 117 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=8, 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, 8 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 5292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 0/224 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum04.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-20-06-180.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/sum04.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-20-06-180.csv Received shutdown request...