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/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:24:00,202 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:24:00,204 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:24:00,219 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:24:00,220 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:24:00,221 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:24:00,225 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:24:00,228 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:24:00,231 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:24:00,238 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:24:00,239 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:24:00,240 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:24:00,241 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:24:00,244 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:24:00,249 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:24:00,250 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:24:00,251 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:24:00,254 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:24:00,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:24:00,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:24:00,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:24:00,263 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:24:00,267 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:24:00,268 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:24:00,268 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:24:00,269 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:24:00,270 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:24:00,271 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:24:00,273 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:24:00,276 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:24:00,276 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:24:00,277 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:24:00,277 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:24:00,277 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:24:00,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:24:00,281 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:24:00,282 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:24:00,296 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:24:00,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:24:00,297 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:24:00,298 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:24:00,298 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:24:00,298 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:24:00,298 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:24:00,298 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:24:00,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:24:00,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:24:00,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:24:00,387 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:24:00,387 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:24:00,388 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl [2018-09-26 08:24:00,388 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl' [2018-09-26 08:24:00,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:24:00,439 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:24:00,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:24:00,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:24:00,440 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:24:00,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:00" (1/1) ... [2018-09-26 08:24:00,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:00" (1/1) ... [2018-09-26 08:24:00,479 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:24:00,479 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:24:00,479 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:24:00,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:24:00,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:24:00,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:24:00,483 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:24:00,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:00" (1/1) ... [2018-09-26 08:24:00,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:00" (1/1) ... [2018-09-26 08:24:00,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:00" (1/1) ... [2018-09-26 08:24:00,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:00" (1/1) ... [2018-09-26 08:24:00,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:00" (1/1) ... [2018-09-26 08:24:00,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:00" (1/1) ... [2018-09-26 08:24:00,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:00" (1/1) ... [2018-09-26 08:24:00,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:24:00,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:24:00,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:24:00,505 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:24:00,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:00" (1/1) ... [2018-09-26 08:24:00,596 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-26 08:24:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 08:24:00,597 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 08:24:00,777 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:24:00,778 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:24:00 BoogieIcfgContainer [2018-09-26 08:24:00,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:24:00,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:24:00,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:24:00,784 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:24:00,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:00" (1/2) ... [2018-09-26 08:24:00,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15610a10 and model type Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:24:00, skipping insertion in model container [2018-09-26 08:24:00,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:24:00" (2/2) ... [2018-09-26 08:24:00,789 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-sophisticated.bpl [2018-09-26 08:24:00,800 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:24:00,814 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:24:00,870 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:24:00,871 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:24:00,871 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:24:00,871 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:24:00,871 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:24:00,872 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:24:00,872 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:24:00,872 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:24:00,872 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:24:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 08:24:00,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:24:00,904 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:00,906 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:24:00,907 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:00,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:00,921 INFO L82 PathProgramCache]: Analyzing trace with hash 30240, now seen corresponding path program 1 times [2018-09-26 08:24:00,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:00,987 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:24:00,990 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:24:00,990 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:24:00,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:24:01,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:24:01,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:24:01,018 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-09-26 08:24:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:01,050 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-09-26 08:24:01,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:24:01,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 08:24:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:01,072 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:24:01,072 INFO L226 Difference]: Without dead ends: 5 [2018-09-26 08:24:01,077 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:24:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-26 08:24:01,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-26 08:24:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-26 08:24:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-26 08:24:01,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-26 08:24:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:01,118 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-26 08:24:01,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:24:01,118 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-26 08:24:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:24:01,119 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:01,119 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:24:01,119 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:01,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:01,120 INFO L82 PathProgramCache]: Analyzing trace with hash 945112, now seen corresponding path program 1 times [2018-09-26 08:24:01,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:01,147 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:01,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:24:01,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:24:01,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:24:01,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:24:01,150 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-09-26 08:24:01,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:01,165 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-26 08:24:01,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:24:01,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 08:24:01,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:01,166 INFO L225 Difference]: With dead ends: 8 [2018-09-26 08:24:01,166 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 08:24:01,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:24:01,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 08:24:01,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 08:24:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:24:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:24:01,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-26 08:24:01,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:01,171 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:24:01,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:24:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:24:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:24:01,171 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:01,172 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-26 08:24:01,172 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:01,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:01,172 INFO L82 PathProgramCache]: Analyzing trace with hash 29306144, now seen corresponding path program 2 times [2018-09-26 08:24:01,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:01,232 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:01,232 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:24:01,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:24:01,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:24:01,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:24:01,234 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-09-26 08:24:01,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:01,250 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:24:01,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:24:01,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 08:24:01,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:01,251 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:24:01,251 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:24:01,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:24:01,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:24:01,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:24:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:24:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:24:01,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-26 08:24:01,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:01,256 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:24:01,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:24:01,259 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:24:01,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:24:01,259 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:01,260 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-09-26 08:24:01,260 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:01,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:01,261 INFO L82 PathProgramCache]: Analyzing trace with hash 908498136, now seen corresponding path program 3 times [2018-09-26 08:24:01,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:01,355 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:24:01,356 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:01,356 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:24:01,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:24:01,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:24:01,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:24:01,358 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-09-26 08:24:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:01,370 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 08:24:01,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:24:01,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:24:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:01,372 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:24:01,372 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:24:01,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:24:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:24:01,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:24:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:24:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:24:01,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-26 08:24:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:01,376 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:24:01,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:24:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:24:01,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:24:01,377 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:01,377 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-09-26 08:24:01,378 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:01,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:01,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1901321184, now seen corresponding path program 4 times [2018-09-26 08:24:01,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:01,475 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:01,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:24:01,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:24:01,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:24:01,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:24:01,477 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-09-26 08:24:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:01,506 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:24:01,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:24:01,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-09-26 08:24:01,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:01,507 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:24:01,507 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:24:01,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:24:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:24:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:24:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:24:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:24:01,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-26 08:24:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:01,511 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:24:01,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:24:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:24:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:24:01,512 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:01,512 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-09-26 08:24:01,512 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:01,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:01,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1188593112, now seen corresponding path program 5 times [2018-09-26 08:24:01,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:01,670 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:01,670 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:24:01,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:24:01,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:24:01,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:24:01,672 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-09-26 08:24:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:01,683 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:24:01,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:24:01,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:24:01,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:01,684 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:24:01,684 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:24:01,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:24:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:24:01,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:24:01,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:24:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:24:01,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-26 08:24:01,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:01,689 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:24:01,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:24:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:24:01,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:24:01,690 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:01,690 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-09-26 08:24:01,690 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:01,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:01,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1808311520, now seen corresponding path program 6 times [2018-09-26 08:24:01,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:02,073 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:02,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:24:02,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:24:02,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:24:02,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:24:02,074 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-09-26 08:24:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:02,086 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:24:02,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:24:02,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-26 08:24:02,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:02,087 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:24:02,087 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:24:02,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:24:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:24:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:24:02,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:24:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:24:02,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-26 08:24:02,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:02,092 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:24:02,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:24:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:24:02,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:24:02,093 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:02,093 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-09-26 08:24:02,094 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:02,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:02,094 INFO L82 PathProgramCache]: Analyzing trace with hash -223074600, now seen corresponding path program 7 times [2018-09-26 08:24:02,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:02,554 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:02,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:24:02,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:24:02,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:24:02,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:24:02,558 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-09-26 08:24:02,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:02,574 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:24:02,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:24:02,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-09-26 08:24:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:02,577 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:24:02,577 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:24:02,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:24:02,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:24:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:24:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:24:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:24:02,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-26 08:24:02,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:02,587 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:24:02,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:24:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:24:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:24:02,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:02,591 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-09-26 08:24:02,591 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:02,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:02,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1674629664, now seen corresponding path program 8 times [2018-09-26 08:24:02,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:03,480 WARN L178 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 3 [2018-09-26 08:24:03,807 WARN L178 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 3 [2018-09-26 08:24:04,194 WARN L178 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 3 [2018-09-26 08:24:04,482 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 3 [2018-09-26 08:24:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:04,493 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:04,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:24:04,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:24:04,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:24:04,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:24:04,499 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-09-26 08:24:04,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:04,521 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:24:04,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:24:04,522 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-09-26 08:24:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:04,523 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:24:04,523 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:24:04,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:24:04,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:24:04,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:24:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:24:04,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:24:04,532 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-26 08:24:04,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:04,533 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:24:04,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:24:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:24:04,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:24:04,535 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:04,535 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-09-26 08:24:04,535 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:04,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:04,537 INFO L82 PathProgramCache]: Analyzing trace with hash 373919704, now seen corresponding path program 9 times [2018-09-26 08:24:04,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:05,091 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 3 [2018-09-26 08:24:07,256 WARN L178 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 300 DAG size of output: 3 [2018-09-26 08:24:08,523 WARN L178 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 339 DAG size of output: 3 [2018-09-26 08:24:09,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:24:09,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:24:09,330 WARN L178 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 353 DAG size of output: 3 [2018-09-26 08:24:10,113 WARN L178 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 3 [2018-09-26 08:24:10,527 WARN L178 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 3 [2018-09-26 08:24:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:10,534 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:10,534 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:24:10,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:24:10,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:24:10,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:24:10,536 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-09-26 08:24:10,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:10,545 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:24:10,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:24:10,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-09-26 08:24:10,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:10,547 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:24:10,547 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:24:10,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:24:10,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:24:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:24:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:24:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:24:10,550 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-26 08:24:10,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:10,553 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:24:10,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:24:10,553 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:24:10,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:24:10,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:10,554 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-09-26 08:24:10,554 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:10,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:10,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1293383392, now seen corresponding path program 10 times [2018-09-26 08:24:10,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:11,522 WARN L178 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 3 [2018-09-26 08:24:16,403 WARN L178 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 588 DAG size of output: 3 [2018-09-26 08:24:20,220 WARN L178 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 675 DAG size of output: 3 [2018-09-26 08:24:21,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:24:21,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:24:21,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:24:22,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:24:23,233 WARN L178 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 729 DAG size of output: 3 [2018-09-26 08:24:25,780 WARN L178 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 715 DAG size of output: 3 [2018-09-26 08:24:27,831 WARN L178 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 735 DAG size of output: 3 [2018-09-26 08:24:28,626 WARN L178 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 410 DAG size of output: 3 [2018-09-26 08:24:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:28,631 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:28,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:24:28,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:24:28,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:24:28,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:24:28,632 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-09-26 08:24:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:28,639 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:24:28,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:24:28,640 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-09-26 08:24:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:28,641 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:24:28,641 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:24:28,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:24:28,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:24:28,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:24:28,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:24:28,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:24:28,644 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-09-26 08:24:28,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:28,645 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:24:28,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:24:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:24:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:24:28,645 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:28,646 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-09-26 08:24:28,646 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:28,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:28,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1440171816, now seen corresponding path program 11 times [2018-09-26 08:24:28,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:31,278 WARN L178 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 521 DAG size of output: 3 [2018-09-26 08:25:10,401 WARN L178 SmtUtils]: Spent 36.49 s on a formula simplification. DAG size of input: 1164 DAG size of output: 3 [2018-09-26 08:25:26,048 WARN L178 SmtUtils]: Spent 14.50 s on a formula simplification. DAG size of input: 1347 DAG size of output: 3 [2018-09-26 08:25:41,146 WARN L178 SmtUtils]: Spent 14.04 s on a formula simplification. DAG size of input: 1481 DAG size of output: 3 [2018-09-26 08:25:52,614 WARN L178 SmtUtils]: Spent 10.56 s on a formula simplification. DAG size of input: 1507 DAG size of output: 3 [2018-09-26 08:25:55,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:26:00,757 WARN L178 SmtUtils]: Spent 7.31 s on a formula simplification. DAG size of input: 1666 DAG size of output: 3 [2018-09-26 08:26:01,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:26:06,530 WARN L178 SmtUtils]: Spent 5.16 s on a formula simplification. DAG size of input: 1235 DAG size of output: 3 [2018-09-26 08:26:09,022 WARN L178 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 796 DAG size of output: 3 [2018-09-26 08:26:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:09,028 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:09,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:26:09,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:26:09,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:26:09,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:26:09,029 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-09-26 08:26:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:09,041 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:26:09,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:26:09,041 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-26 08:26:09,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:09,042 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:26:09,042 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:26:09,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 94.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:26:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:26:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:26:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:26:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:26:09,046 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-09-26 08:26:09,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:09,046 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:26:09,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:26:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:26:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:26:09,047 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:09,047 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-09-26 08:26:09,048 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:09,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:09,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1695645664, now seen corresponding path program 12 times [2018-09-26 08:26:09,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:16,753 WARN L178 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 1029 DAG size of output: 3 [2018-09-26 08:26:23,802 WARN L178 SmtUtils]: Spent 6.56 s on a formula simplification. DAG size of input: 1032 DAG size of output: 3 [2018-09-26 08:26:31,253 WARN L178 SmtUtils]: Spent 6.94 s on a formula simplification. DAG size of input: 1033 DAG size of output: 3 Received shutdown request... [2018-09-26 08:28:30,433 WARN L186 SmtUtils]: Removed 2 from assertion stack [2018-09-26 08:28:30,433 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:28:30,437 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:28:30,438 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:28:30 BoogieIcfgContainer [2018-09-26 08:28:30,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:28:30,439 INFO L168 Benchmark]: Toolchain (without parser) took 270002.77 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 262.9 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-26 08:28:30,440 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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:28:30,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.79 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:28:30,441 INFO L168 Benchmark]: Boogie Preprocessor took 21.77 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:28:30,442 INFO L168 Benchmark]: RCFGBuilder took 273.55 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:28:30,443 INFO L168 Benchmark]: TraceAbstraction took 269657.78 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 252.3 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-26 08:28:30,447 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.79 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 21.77 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 273.55 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 269657.78 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 252.3 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 16 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 2316. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 269.5s OverallTime, 13 OverallIterations, 12 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 2 SDslu, 60 SDs, 0 SdLazy, 150 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 118.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 127.2s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 2274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 1 PerfectInterpolantSequences, 0/286 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-sophisticated.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-28-30-461.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-sophisticated.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-28-30-461.csv Completed graceful shutdown