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/vogal.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:20:17,165 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:20:17,169 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:20:17,182 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:20:17,182 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:20:17,184 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:20:17,185 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:20:17,190 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:20:17,195 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:20:17,196 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:20:17,197 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:20:17,198 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:20:17,199 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:20:17,202 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:20:17,205 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:20:17,206 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:20:17,208 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:20:17,212 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:20:17,216 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:20:17,219 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:20:17,220 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:20:17,221 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:20:17,225 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:20:17,225 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:20:17,225 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:20:17,227 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:20:17,228 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:20:17,230 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:20:17,231 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:20:17,232 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:20:17,232 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:20:17,232 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:20:17,233 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:20:17,233 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:20:17,237 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:20:17,238 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:20:17,238 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:17,246 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:20:17,247 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:20:17,248 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:20:17,248 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:20:17,248 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:20:17,249 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:20:17,249 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:20:17,249 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:20:17,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:20:17,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:20:17,330 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:20:17,331 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:20:17,332 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:20:17,333 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl [2018-09-26 08:20:17,333 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl' [2018-09-26 08:20:17,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:20:17,396 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:20:17,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:20:17,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:20:17,397 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:20:17,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:17" (1/1) ... [2018-09-26 08:20:17,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:17" (1/1) ... [2018-09-26 08:20:17,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:20:17,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:20:17,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:20:17,443 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:20:17,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:17" (1/1) ... [2018-09-26 08:20:17,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:17" (1/1) ... [2018-09-26 08:20:17,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:17" (1/1) ... [2018-09-26 08:20:17,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:17" (1/1) ... [2018-09-26 08:20:17,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:17" (1/1) ... [2018-09-26 08:20:17,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:17" (1/1) ... [2018-09-26 08:20:17,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:17" (1/1) ... [2018-09-26 08:20:17,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:20:17,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:20:17,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:20:17,468 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:20:17,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:17" (1/1) ... [2018-09-26 08:20:17,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:20:17,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:20:17,823 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:20:17,823 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:20:17 BoogieIcfgContainer [2018-09-26 08:20:17,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:20:17,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:20:17,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:20:17,829 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:20:17,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:17" (1/2) ... [2018-09-26 08:20:17,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c12eeb and model type vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:20:17, skipping insertion in model container [2018-09-26 08:20:17,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:20:17" (2/2) ... [2018-09-26 08:20:17,833 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal.i_5.bpl [2018-09-26 08:20:17,844 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:20:17,853 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:20:17,898 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:20:17,898 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:20:17,898 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:20:17,899 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:20:17,899 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:20:17,899 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:20:17,899 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:20:17,899 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:20:17,900 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:20:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-09-26 08:20:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:20:17,923 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:17,925 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:17,926 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:17,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:17,934 INFO L82 PathProgramCache]: Analyzing trace with hash 148998095, now seen corresponding path program 1 times [2018-09-26 08:20:17,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:18,025 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:18,028 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:20:18,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:20:18,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:20:18,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:20:18,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:20:18,047 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2018-09-26 08:20:18,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:18,115 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-09-26 08:20:18,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:20:18,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-09-26 08:20:18,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:18,134 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:20:18,135 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:20:18,140 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:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:20:18,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-09-26 08:20:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:20:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-09-26 08:20:18,184 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 8 [2018-09-26 08:20:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:18,185 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-09-26 08:20:18,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:20:18,185 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2018-09-26 08:20:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:20:18,186 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:18,186 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:18,187 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:18,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:18,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1897140361, now seen corresponding path program 1 times [2018-09-26 08:20:18,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:18,241 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:18,241 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:18,241 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:20:18,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:20:18,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:20:18,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:20:18,244 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 4 states. [2018-09-26 08:20:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:18,375 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2018-09-26 08:20:18,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:20:18,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-09-26 08:20:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:18,377 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:20:18,377 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:20:18,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:20:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:20:18,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2018-09-26 08:20:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:20:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-09-26 08:20:18,385 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2018-09-26 08:20:18,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:18,385 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-09-26 08:20:18,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:20:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2018-09-26 08:20:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:20:18,386 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:18,387 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:18,387 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:18,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:18,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1765322045, now seen corresponding path program 2 times [2018-09-26 08:20:18,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:18,465 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:18,465 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:20:18,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:20:18,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:20:18,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:20:18,466 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 5 states. [2018-09-26 08:20:18,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:18,643 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-09-26 08:20:18,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:20:18,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-09-26 08:20:18,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:18,645 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:20:18,645 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:20:18,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:20:18,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:20:18,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 17. [2018-09-26 08:20:18,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:20:18,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-09-26 08:20:18,662 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2018-09-26 08:20:18,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:18,662 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-09-26 08:20:18,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:20:18,662 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-09-26 08:20:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:20:18,663 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:18,664 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:18,665 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:18,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:18,665 INFO L82 PathProgramCache]: Analyzing trace with hash 481488509, now seen corresponding path program 3 times [2018-09-26 08:20:18,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:18,736 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:18,737 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:20:18,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:20:18,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:20:18,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:20:18,738 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 6 states. [2018-09-26 08:20:18,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:18,917 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-09-26 08:20:18,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:20:18,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-09-26 08:20:18,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:18,919 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:20:18,922 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:20:18,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:20:18,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:20:18,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 19. [2018-09-26 08:20:18,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:20:18,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-09-26 08:20:18,930 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2018-09-26 08:20:18,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:18,931 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-09-26 08:20:18,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:20:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-09-26 08:20:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:20:18,934 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:18,937 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:18,937 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:18,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:18,938 INFO L82 PathProgramCache]: Analyzing trace with hash -702118985, now seen corresponding path program 4 times [2018-09-26 08:20:18,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:19,014 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:19,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:20:19,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:20:19,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:20:19,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:20:19,016 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 7 states. [2018-09-26 08:20:19,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:19,200 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-09-26 08:20:19,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:20:19,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-09-26 08:20:19,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:19,202 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:20:19,202 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:20:19,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:20:19,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:20:19,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 21. [2018-09-26 08:20:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:20:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-09-26 08:20:19,211 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2018-09-26 08:20:19,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:19,212 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-09-26 08:20:19,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:20:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-09-26 08:20:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:20:19,214 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:19,214 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:19,216 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:19,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:19,217 INFO L82 PathProgramCache]: Analyzing trace with hash 17412721, now seen corresponding path program 5 times [2018-09-26 08:20:19,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:19,269 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:19,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:19,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:20:19,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:20:19,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:20:19,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:20:19,271 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 8 states. [2018-09-26 08:20:19,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:19,406 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-09-26 08:20:19,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:20:19,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:20:19,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:19,408 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:20:19,408 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:20:19,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:20:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:20:19,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 23. [2018-09-26 08:20:19,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:20:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-09-26 08:20:19,418 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2018-09-26 08:20:19,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:19,419 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-09-26 08:20:19,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:20:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-09-26 08:20:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:20:19,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:19,422 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:19,423 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:19,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:19,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2352469, now seen corresponding path program 6 times [2018-09-26 08:20:19,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:19,473 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:19,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:20:19,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:20:19,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:20:19,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:20:19,476 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 9 states. [2018-09-26 08:20:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:19,619 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2018-09-26 08:20:19,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:20:19,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-09-26 08:20:19,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:19,621 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:20:19,621 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:20:19,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:20:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:20:19,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 25. [2018-09-26 08:20:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:20:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-09-26 08:20:19,632 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2018-09-26 08:20:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:19,632 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-09-26 08:20:19,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:20:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-09-26 08:20:19,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:20:19,634 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:19,635 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:19,635 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:19,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:19,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1816830875, now seen corresponding path program 7 times [2018-09-26 08:20:19,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:19,686 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:19,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:20:19,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:20:19,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:20:19,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:20:19,690 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 10 states. [2018-09-26 08:20:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:19,845 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2018-09-26 08:20:19,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:20:19,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-09-26 08:20:19,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:19,848 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:20:19,848 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:20:19,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:20:19,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:20:19,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 27. [2018-09-26 08:20:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:20:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-09-26 08:20:19,859 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 22 [2018-09-26 08:20:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:19,860 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-09-26 08:20:19,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:20:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-09-26 08:20:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:20:19,861 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:19,861 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:19,861 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:19,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:19,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1773856865, now seen corresponding path program 8 times [2018-09-26 08:20:19,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:19,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:19,942 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:20:19,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:20:19,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:20:19,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:20:19,945 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 11 states. [2018-09-26 08:20:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:20,118 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2018-09-26 08:20:20,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:20:20,119 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-09-26 08:20:20,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:20,120 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:20:20,120 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:20:20,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:20:20,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:20:20,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 29. [2018-09-26 08:20:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:20:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-09-26 08:20:20,128 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 24 [2018-09-26 08:20:20,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:20,129 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-09-26 08:20:20,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:20:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-09-26 08:20:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:20:20,132 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:20,132 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:20,133 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:20,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:20,133 INFO L82 PathProgramCache]: Analyzing trace with hash 869461081, now seen corresponding path program 9 times [2018-09-26 08:20:20,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:20,188 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:20,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:20:20,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:20:20,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:20:20,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:20:20,190 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 12 states. [2018-09-26 08:20:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:20,386 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2018-09-26 08:20:20,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:20:20,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-09-26 08:20:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:20,388 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:20:20,388 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:20:20,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:20:20,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:20:20,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 31. [2018-09-26 08:20:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:20:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-09-26 08:20:20,405 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 26 [2018-09-26 08:20:20,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:20,406 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-09-26 08:20:20,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:20:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-09-26 08:20:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:20:20,407 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:20,407 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:20,408 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:20,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:20,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1522632045, now seen corresponding path program 10 times [2018-09-26 08:20:20,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 08:20:20,459 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:20:20,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:20:20,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:20:20,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:20:20,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:20:20,461 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 3 states. [2018-09-26 08:20:20,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:20,469 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-09-26 08:20:20,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:20:20,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-09-26 08:20:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:20,470 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:20:20,470 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:20:20,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:20:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:20:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:20:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-09-26 08:20:20,483 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2018-09-26 08:20:20,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:20,483 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-09-26 08:20:20,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:20:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-09-26 08:20:20,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:20:20,485 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:20,486 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:20,486 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:20,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:20,488 INFO L82 PathProgramCache]: Analyzing trace with hash 50698691, now seen corresponding path program 1 times [2018-09-26 08:20:20,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 08:20:20,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:20,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:20:20,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:20:20,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:20:20,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:20:20,534 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2018-09-26 08:20:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:20,544 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-09-26 08:20:20,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:20:20,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-09-26 08:20:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:20,545 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:20:20,545 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:20:20,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:20:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:20:20,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-09-26 08:20:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:20:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-09-26 08:20:20,553 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2018-09-26 08:20:20,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:20,554 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-09-26 08:20:20,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:20:20,554 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-09-26 08:20:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:20:20,555 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:20,555 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:20,556 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:20,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:20,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1544539549, now seen corresponding path program 2 times [2018-09-26 08:20:20,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 08:20:20,604 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:20,604 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:20:20,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:20:20,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:20:20,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:20:20,607 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2018-09-26 08:20:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:20,620 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-09-26 08:20:20,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:20:20,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-09-26 08:20:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:20,621 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:20:20,621 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:20:20,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:20:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:20:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:20:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:20:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-09-26 08:20:20,627 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 36 [2018-09-26 08:20:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:20,628 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-09-26 08:20:20,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:20:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-09-26 08:20:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:20:20,629 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:20,629 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:20,633 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:20,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:20,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1688440073, now seen corresponding path program 3 times [2018-09-26 08:20:20,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 08:20:20,684 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:20,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:20:20,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:20:20,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:20:20,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:20:20,687 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2018-09-26 08:20:20,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:20,705 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-09-26 08:20:20,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:20:20,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-09-26 08:20:20,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:20,707 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:20:20,707 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:20:20,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:20:20,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:20:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:20:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:20:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-09-26 08:20:20,717 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2018-09-26 08:20:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:20,717 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-09-26 08:20:20,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:20:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-09-26 08:20:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:20:20,719 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:20,720 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:20,720 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:20,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:20,721 INFO L82 PathProgramCache]: Analyzing trace with hash 974465489, now seen corresponding path program 4 times [2018-09-26 08:20:20,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 08:20:20,783 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:20,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:20:20,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:20:20,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:20:20,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:20:20,785 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 7 states. [2018-09-26 08:20:20,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:20,805 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-09-26 08:20:20,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:20:20,806 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-09-26 08:20:20,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:20,807 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:20:20,807 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:20:20,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:20:20,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:20:20,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:20:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:20:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-09-26 08:20:20,817 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 40 [2018-09-26 08:20:20,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:20,818 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-09-26 08:20:20,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:20:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-09-26 08:20:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:20:20,820 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:20,820 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:20,822 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:20,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:20,822 INFO L82 PathProgramCache]: Analyzing trace with hash 226202155, now seen corresponding path program 5 times [2018-09-26 08:20:20,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 08:20:20,876 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:20,876 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:20:20,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:20:20,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:20:20,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:20:20,882 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 8 states. [2018-09-26 08:20:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:20,907 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-09-26 08:20:20,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:20:20,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-09-26 08:20:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:20,908 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:20:20,908 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:20:20,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:20:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:20:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:20:20,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:20:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-09-26 08:20:20,916 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 42 [2018-09-26 08:20:20,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:20,917 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-09-26 08:20:20,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:20:20,919 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-09-26 08:20:20,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:20:20,920 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:20,920 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:20,920 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:20,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:20,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1595323387, now seen corresponding path program 6 times [2018-09-26 08:20:20,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 08:20:20,980 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:20,980 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:20:20,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:20:20,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:20:20,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:20:20,982 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 9 states. [2018-09-26 08:20:21,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:21,016 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-09-26 08:20:21,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:20:21,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-09-26 08:20:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:21,018 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:20:21,018 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:20:21,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:20:21,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:20:21,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:20:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:20:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-09-26 08:20:21,028 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 44 [2018-09-26 08:20:21,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:21,029 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-09-26 08:20:21,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:20:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-09-26 08:20:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:20:21,030 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:21,030 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 8, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:21,031 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:21,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:21,031 INFO L82 PathProgramCache]: Analyzing trace with hash 265287519, now seen corresponding path program 7 times [2018-09-26 08:20:21,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 08:20:21,104 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:21,104 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:20:21,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:20:21,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:20:21,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:20:21,106 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 10 states. [2018-09-26 08:20:21,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:21,148 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-09-26 08:20:21,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:20:21,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-09-26 08:20:21,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:21,149 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:20:21,150 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:20:21,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:20:21,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:20:21,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:20:21,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:20:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-09-26 08:20:21,168 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 46 [2018-09-26 08:20:21,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:21,168 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-09-26 08:20:21,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:20:21,168 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-09-26 08:20:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:20:21,169 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:21,175 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 9, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:21,175 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:21,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:21,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1605973049, now seen corresponding path program 8 times [2018-09-26 08:20:21,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 2 proven. 72 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 08:20:21,247 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:21,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:20:21,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:20:21,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:20:21,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:20:21,252 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 11 states. [2018-09-26 08:20:21,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:21,309 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-09-26 08:20:21,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:20:21,310 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-09-26 08:20:21,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:21,311 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:20:21,311 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:20:21,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:20:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:20:21,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:20:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:20:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-09-26 08:20:21,319 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 48 [2018-09-26 08:20:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:21,320 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-09-26 08:20:21,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:20:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-09-26 08:20:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:20:21,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:21,323 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:21,323 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:21,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:21,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1514578579, now seen corresponding path program 9 times [2018-09-26 08:20:21,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 2 proven. 90 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 08:20:21,395 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:21,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:20:21,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:20:21,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:20:21,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:20:21,397 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 12 states. [2018-09-26 08:20:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:21,447 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-09-26 08:20:21,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:20:21,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-09-26 08:20:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:21,449 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:20:21,449 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:20:21,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:20:21,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:20:21,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:20:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:20:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-09-26 08:20:21,456 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 50 [2018-09-26 08:20:21,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:21,456 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-09-26 08:20:21,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:20:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-09-26 08:20:21,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:20:21,457 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:21,458 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:20:21,458 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:21,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:21,458 INFO L82 PathProgramCache]: Analyzing trace with hash -416161171, now seen corresponding path program 10 times [2018-09-26 08:20:21,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-09-26 08:20:21,557 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:20:21,557 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:20:21,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:20:21,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:20:21,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:20:21,559 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2018-09-26 08:20:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:21,567 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-09-26 08:20:21,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:20:21,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-09-26 08:20:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:21,568 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:20:21,568 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:20:21,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:20:21,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:20:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:20:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:20:21,570 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-09-26 08:20:21,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:21,570 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:20:21,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:20:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:20:21,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:20:21,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:20:21,604 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 124) no Hoare annotation was computed. [2018-09-26 08:20:21,604 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 102) the Hoare annotation is: false [2018-09-26 08:20:21,605 INFO L429 ceAbstractionStarter]: At program point L83(lines 54 83) the Hoare annotation is: true [2018-09-26 08:20:21,605 INFO L422 ceAbstractionStarter]: At program point L96(lines 96 101) the Hoare annotation is: false [2018-09-26 08:20:21,605 INFO L429 ceAbstractionStarter]: At program point L63(lines 44 63) the Hoare annotation is: true [2018-09-26 08:20:21,605 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 124) the Hoare annotation is: true [2018-09-26 08:20:21,605 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 124) no Hoare annotation was computed. [2018-09-26 08:20:21,606 INFO L422 ceAbstractionStarter]: At program point L123(lines 100 123) the Hoare annotation is: false [2018-09-26 08:20:21,606 INFO L422 ceAbstractionStarter]: At program point L86(lines 86 97) the Hoare annotation is: (and (= ULTIMATE.start_main_~cont~5 0) (= ULTIMATE.start_main_~cont_aux~5 0) (= ULTIMATE.start_main_~i~5 0) (= 0 (select ULTIMATE.start_main_~string_entrada~5 0))) [2018-09-26 08:20:21,606 INFO L422 ceAbstractionStarter]: At program point L113(lines 77 113) the Hoare annotation is: (and (= ULTIMATE.start_main_~cont~5 0) (= ULTIMATE.start_main_~cont_aux~5 0) (= ULTIMATE.start_main_~i~5 0) (= 0 (select ULTIMATE.start_main_~string_entrada~5 0))) [2018-09-26 08:20:21,606 INFO L429 ceAbstractionStarter]: At program point L47(lines 47 55) the Hoare annotation is: true [2018-09-26 08:20:21,607 INFO L422 ceAbstractionStarter]: At program point L105(lines 105 114) the Hoare annotation is: false [2018-09-26 08:20:21,607 INFO L429 ceAbstractionStarter]: At program point L66(lines 66 78) the Hoare annotation is: true [2018-09-26 08:20:21,622 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:20:21 BoogieIcfgContainer [2018-09-26 08:20:21,622 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:20:21,623 INFO L168 Benchmark]: Toolchain (without parser) took 4229.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 391.1 MB). Peak memory consumption was 391.1 MB. Max. memory is 7.1 GB. [2018-09-26 08:20:21,626 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:20:21,626 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:20:21,627 INFO L168 Benchmark]: Boogie Preprocessor took 25.06 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:21,628 INFO L168 Benchmark]: RCFGBuilder took 356.31 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:21,628 INFO L168 Benchmark]: TraceAbstraction took 3797.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 380.5 MB). Peak memory consumption was 380.5 MB. Max. memory is 7.1 GB. [2018-09-26 08:20:21,633 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 44.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.06 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 356.31 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 3797.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 380.5 MB). Peak memory consumption was 380.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 102]: 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: 44]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((main_~cont~5 == 0 && main_~cont_aux~5 == 0) && main_~i~5 == 0) && 0 == main_~string_entrada~5[0] - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((main_~cont~5 == 0 && main_~cont_aux~5 == 0) && main_~i~5 == 0) && 0 == main_~string_entrada~5[0] - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. SAFE Result, 3.7s OverallTime, 21 OverallIterations, 11 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 453 SDtfs, 333 SDslu, 2262 SDs, 0 SdLazy, 2647 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=20, 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.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 332 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 35 NumberOfFragments, 39 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 628 NumberOfCodeBlocks, 628 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 59045 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 1340/2000 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/vogal.i_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-20-21-647.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/vogal.i_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-20-21-647.csv Received shutdown request...