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/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:10:53,209 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:10:53,211 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:10:53,230 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:10:53,230 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:10:53,232 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:10:53,233 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:10:53,236 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:10:53,238 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:10:53,240 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:10:53,243 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:10:53,243 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:10:53,244 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:10:53,247 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:10:53,248 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:10:53,248 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:10:53,249 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:10:53,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:10:53,262 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:10:53,266 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:10:53,267 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:10:53,268 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:10:53,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:10:53,271 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:10:53,271 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:10:53,275 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:10:53,276 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:10:53,278 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:10:53,279 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:10:53,280 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:10:53,280 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:10:53,281 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:10:53,281 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:10:53,283 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:10:53,284 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:10:53,286 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:10:53,287 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:10:53,302 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:10:53,302 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:10:53,305 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:10:53,305 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:10:53,305 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:10:53,306 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:10:53,306 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:10:53,306 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:10:53,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:10:53,385 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:10:53,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:10:53,394 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:10:53,395 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:10:53,396 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-09-26 08:10:53,396 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested.i_4.bplTransformedIcfg_BEv2_3.bpl' [2018-09-26 08:10:53,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:10:53,457 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:10:53,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:10:53,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:10:53,458 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:10:53,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:53" (1/1) ... [2018-09-26 08:10:53,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:53" (1/1) ... [2018-09-26 08:10:53,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:10:53,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:10:53,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:10:53,497 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:10:53,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:53" (1/1) ... [2018-09-26 08:10:53,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:53" (1/1) ... [2018-09-26 08:10:53,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:53" (1/1) ... [2018-09-26 08:10:53,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:53" (1/1) ... [2018-09-26 08:10:53,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:53" (1/1) ... [2018-09-26 08:10:53,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:53" (1/1) ... [2018-09-26 08:10:53,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:53" (1/1) ... [2018-09-26 08:10:53,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:10:53,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:10:53,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:10:53,516 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:10:53,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:53" (1/1) ... [2018-09-26 08:10:53,601 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-26 08:10:53,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:10:53,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:10:53,730 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:10:53,730 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:10:53 BoogieIcfgContainer [2018-09-26 08:10:53,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:10:53,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:10:53,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:10:53,735 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:10:53,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:10:53" (1/2) ... [2018-09-26 08:10:53,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b75c3de and model type nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:10:53, skipping insertion in model container [2018-09-26 08:10:53,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:10:53" (2/2) ... [2018-09-26 08:10:53,739 INFO L112 eAbstractionObserver]: Analyzing ICFG nested.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-09-26 08:10:53,749 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:10:53,757 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:10:53,801 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:10:53,802 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:10:53,802 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:10:53,802 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:10:53,802 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:10:53,803 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:10:53,803 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:10:53,803 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:10:53,803 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:10:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-09-26 08:10:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:10:53,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:53,824 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:10:53,825 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:53,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:53,831 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-09-26 08:10:53,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:53,906 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:10:53,909 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:10:53,909 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:10:53,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:10:53,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:10:53,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:10:53,927 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-09-26 08:10:53,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:53,955 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-09-26 08:10:53,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:10:53,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 08:10:53,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:53,968 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:10:53,969 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:10:53,972 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:10:53,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:10:54,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-09-26 08:10:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:10:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-09-26 08:10:54,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-09-26 08:10:54,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:54,009 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-09-26 08:10:54,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:10:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-09-26 08:10:54,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:10:54,010 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:54,010 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-26 08:10:54,011 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:54,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:54,011 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-09-26 08:10:54,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:54,049 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:10:54,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:10:54,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:10:54,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:10:54,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:10:54,053 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-09-26 08:10:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:54,080 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-09-26 08:10:54,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:10:54,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-09-26 08:10:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:54,082 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:10:54,082 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:10:54,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:10:54,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:10:54,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:10:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:10:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-09-26 08:10:54,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-09-26 08:10:54,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:54,087 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-09-26 08:10:54,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:10:54,087 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-09-26 08:10:54,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:10:54,087 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:54,088 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:10:54,088 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:54,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:54,088 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-09-26 08:10:54,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:54,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:54,124 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:54,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:10:54,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:10:54,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:10:54,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:10:54,125 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-09-26 08:10:54,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:54,178 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-09-26 08:10:54,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:10:54,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-09-26 08:10:54,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:54,179 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:10:54,180 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:10:54,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:10:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:10:54,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:10:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:10:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-09-26 08:10:54,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-09-26 08:10:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:54,185 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-09-26 08:10:54,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:10:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-09-26 08:10:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:10:54,186 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:54,186 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-09-26 08:10:54,186 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:54,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:54,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-09-26 08:10:54,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:54,226 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:54,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:10:54,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:10:54,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:10:54,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:10:54,228 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 6 states. [2018-09-26 08:10:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:54,301 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-09-26 08:10:54,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:10:54,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-26 08:10:54,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:54,302 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:10:54,302 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:10:54,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:10:54,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:10:54,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:10:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:10:54,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-26 08:10:54,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2018-09-26 08:10:54,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:54,307 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-26 08:10:54,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:10:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-26 08:10:54,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:10:54,308 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:54,308 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2018-09-26 08:10:54,309 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:54,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:54,309 INFO L82 PathProgramCache]: Analyzing trace with hash 553857454, now seen corresponding path program 3 times [2018-09-26 08:10:54,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:54,347 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:54,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:10:54,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:10:54,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:10:54,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:10:54,349 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 7 states. [2018-09-26 08:10:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:54,432 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-09-26 08:10:54,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:10:54,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-26 08:10:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:54,433 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:10:54,434 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:10:54,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:10:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:10:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:10:54,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-09-26 08:10:54,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-09-26 08:10:54,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:54,439 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-09-26 08:10:54,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:10:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-09-26 08:10:54,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:10:54,440 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:54,440 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2018-09-26 08:10:54,440 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:54,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:54,441 INFO L82 PathProgramCache]: Analyzing trace with hash -10336275, now seen corresponding path program 4 times [2018-09-26 08:10:54,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:54,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:54,486 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:54,486 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:10:54,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:10:54,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:10:54,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:10:54,490 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 8 states. [2018-09-26 08:10:54,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:54,586 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-09-26 08:10:54,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:10:54,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-09-26 08:10:54,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:54,588 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:10:54,588 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:10:54,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:10:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:10:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:10:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:10:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-26 08:10:54,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2018-09-26 08:10:54,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:54,602 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-26 08:10:54,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:10:54,602 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-26 08:10:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:10:54,603 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:54,603 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2018-09-26 08:10:54,603 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:54,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:54,604 INFO L82 PathProgramCache]: Analyzing trace with hash -320472690, now seen corresponding path program 5 times [2018-09-26 08:10:54,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:54,654 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:54,654 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:54,654 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:10:54,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:10:54,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:10:54,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:10:54,656 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 9 states. [2018-09-26 08:10:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:54,712 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-09-26 08:10:54,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:10:54,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-09-26 08:10:54,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:54,715 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:10:54,715 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:10:54,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:10:54,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:10:54,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:10:54,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:10:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-09-26 08:10:54,720 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-09-26 08:10:54,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:54,721 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-09-26 08:10:54,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:10:54,721 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-09-26 08:10:54,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:10:54,722 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:54,722 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2018-09-26 08:10:54,722 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:54,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:54,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1344766963, now seen corresponding path program 6 times [2018-09-26 08:10:54,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:54,776 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:54,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:10:54,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:10:54,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:10:54,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:10:54,777 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 10 states. [2018-09-26 08:10:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:54,845 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-09-26 08:10:54,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:10:54,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-26 08:10:54,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:54,846 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:10:54,846 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:10:54,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:10:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:10:54,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:10:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:10:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-26 08:10:54,851 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-09-26 08:10:54,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:54,852 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-26 08:10:54,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:10:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-26 08:10:54,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:10:54,853 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:54,853 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2018-09-26 08:10:54,853 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:54,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:54,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1261848942, now seen corresponding path program 7 times [2018-09-26 08:10:54,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:54,910 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:54,910 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:10:54,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:10:54,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:10:54,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:54,914 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 11 states. [2018-09-26 08:10:54,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:54,991 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-09-26 08:10:54,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:10:54,992 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2018-09-26 08:10:54,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:54,992 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:10:54,995 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:10:54,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:10:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:10:55,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:10:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:10:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-09-26 08:10:55,006 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-09-26 08:10:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:55,006 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-09-26 08:10:55,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:10:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-09-26 08:10:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:10:55,007 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:55,007 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2018-09-26 08:10:55,011 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:55,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:55,011 INFO L82 PathProgramCache]: Analyzing trace with hash 462563373, now seen corresponding path program 8 times [2018-09-26 08:10:55,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:55,072 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:55,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:10:55,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:55,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:55,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:55,074 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 12 states. [2018-09-26 08:10:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:55,154 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-09-26 08:10:55,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:10:55,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-09-26 08:10:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:55,157 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:10:55,157 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:10:55,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:10:55,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:10:55,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:10:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:10:55,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-26 08:10:55,165 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-09-26 08:10:55,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:55,167 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-26 08:10:55,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:55,167 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-26 08:10:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:10:55,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:55,168 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2018-09-26 08:10:55,168 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:55,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:55,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1454514510, now seen corresponding path program 9 times [2018-09-26 08:10:55,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:55,223 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:55,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:10:55,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:10:55,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:10:55,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:10:55,225 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 13 states. [2018-09-26 08:10:55,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:55,302 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-09-26 08:10:55,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:10:55,303 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-09-26 08:10:55,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:55,304 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:10:55,304 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:10:55,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:10:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:10:55,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:10:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:10:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-09-26 08:10:55,309 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-09-26 08:10:55,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:55,310 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-09-26 08:10:55,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:10:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-09-26 08:10:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:10:55,311 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:55,312 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2018-09-26 08:10:55,312 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:55,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:55,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2140228685, now seen corresponding path program 10 times [2018-09-26 08:10:55,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-26 08:10:55,336 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:55,336 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:10:55,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:10:55,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:10:55,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:10:55,338 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 4 states. [2018-09-26 08:10:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:55,352 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-09-26 08:10:55,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:10:55,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-09-26 08:10:55,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:55,357 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:10:55,357 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:10:55,357 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:10:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:10:55,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-09-26 08:10:55,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:10:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-09-26 08:10:55,372 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 15 [2018-09-26 08:10:55,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:55,373 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-09-26 08:10:55,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:10:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-09-26 08:10:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:10:55,375 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:55,375 INFO L375 BasicCegarLoop]: trace histogram [20, 2, 2, 1, 1, 1] [2018-09-26 08:10:55,376 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:55,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:55,377 INFO L82 PathProgramCache]: Analyzing trace with hash 595035287, now seen corresponding path program 11 times [2018-09-26 08:10:55,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 08:10:55,411 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:55,411 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:10:55,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:10:55,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:10:55,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:10:55,413 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2018-09-26 08:10:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:55,428 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-09-26 08:10:55,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:10:55,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-09-26 08:10:55,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:55,430 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:10:55,430 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:10:55,430 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:10:55,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:10:55,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2018-09-26 08:10:55,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:10:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-09-26 08:10:55,445 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 27 [2018-09-26 08:10:55,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:55,446 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-09-26 08:10:55,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:10:55,446 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-09-26 08:10:55,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:10:55,450 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:55,450 INFO L375 BasicCegarLoop]: trace histogram [30, 3, 3, 1, 1, 1] [2018-09-26 08:10:55,451 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:55,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:55,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1180066335, now seen corresponding path program 12 times [2018-09-26 08:10:55,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-09-26 08:10:55,495 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:55,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:10:55,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:10:55,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:10:55,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:10:55,498 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 6 states. [2018-09-26 08:10:55,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:55,525 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-09-26 08:10:55,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:10:55,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-09-26 08:10:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:55,528 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:10:55,528 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:10:55,529 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:10:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:10:55,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2018-09-26 08:10:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:10:55,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-09-26 08:10:55,550 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2018-09-26 08:10:55,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:55,551 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-09-26 08:10:55,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:10:55,551 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-09-26 08:10:55,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 08:10:55,553 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:55,554 INFO L375 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1] [2018-09-26 08:10:55,554 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:55,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:55,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1381898283, now seen corresponding path program 13 times [2018-09-26 08:10:55,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:55,619 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-09-26 08:10:55,620 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:55,620 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:10:55,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:10:55,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:10:55,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:10:55,621 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 7 states. [2018-09-26 08:10:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:55,655 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-09-26 08:10:55,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:10:55,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-09-26 08:10:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:55,658 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:10:55,658 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:10:55,661 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:10:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:10:55,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2018-09-26 08:10:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:10:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-09-26 08:10:55,682 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 51 [2018-09-26 08:10:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:55,684 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-09-26 08:10:55,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:10:55,684 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-09-26 08:10:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:10:55,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:55,686 INFO L375 BasicCegarLoop]: trace histogram [50, 5, 5, 1, 1, 1] [2018-09-26 08:10:55,688 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:55,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:55,689 INFO L82 PathProgramCache]: Analyzing trace with hash -536120459, now seen corresponding path program 14 times [2018-09-26 08:10:55,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-09-26 08:10:55,771 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:55,771 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:10:55,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:10:55,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:10:55,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:10:55,773 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2018-09-26 08:10:55,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:55,813 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-09-26 08:10:55,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:10:55,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-09-26 08:10:55,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:55,815 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:10:55,815 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:10:55,816 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:10:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:10:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2018-09-26 08:10:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:10:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-09-26 08:10:55,848 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 63 [2018-09-26 08:10:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:55,850 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-09-26 08:10:55,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:10:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-09-26 08:10:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:10:55,853 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:55,853 INFO L375 BasicCegarLoop]: trace histogram [60, 6, 6, 1, 1, 1] [2018-09-26 08:10:55,853 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:55,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:55,853 INFO L82 PathProgramCache]: Analyzing trace with hash -681037889, now seen corresponding path program 15 times [2018-09-26 08:10:55,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-09-26 08:10:55,965 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:55,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:10:55,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:10:55,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:10:55,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:10:55,967 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 9 states. [2018-09-26 08:10:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,010 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-09-26 08:10:56,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:10:56,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2018-09-26 08:10:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,012 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:10:56,012 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:10:56,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:10:56,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:10:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-09-26 08:10:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:10:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-09-26 08:10:56,055 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 75 [2018-09-26 08:10:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,055 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-09-26 08:10:56,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:10:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-09-26 08:10:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 08:10:56,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,057 INFO L375 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-09-26 08:10:56,058 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,060 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 16 times [2018-09-26 08:10:56,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-09-26 08:10:56,209 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,210 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:10:56,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:10:56,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:10:56,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:10:56,214 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 10 states. [2018-09-26 08:10:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,264 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-09-26 08:10:56,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:10:56,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-09-26 08:10:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,266 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:10:56,266 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:10:56,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:10:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:10:56,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-09-26 08:10:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:10:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-09-26 08:10:56,306 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-09-26 08:10:56,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,307 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-09-26 08:10:56,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:10:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-09-26 08:10:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 08:10:56,311 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,312 INFO L375 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-09-26 08:10:56,312 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,320 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 17 times [2018-09-26 08:10:56,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-09-26 08:10:56,473 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,473 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:10:56,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:10:56,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:10:56,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:56,476 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2018-09-26 08:10:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,545 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-09-26 08:10:56,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:10:56,545 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-09-26 08:10:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,547 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:10:56,547 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:10:56,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:56,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:10:56,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-09-26 08:10:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 08:10:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-09-26 08:10:56,593 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-09-26 08:10:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,596 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-09-26 08:10:56,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:10:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-09-26 08:10:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-26 08:10:56,598 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,598 INFO L375 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-09-26 08:10:56,598 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 18 times [2018-09-26 08:10:56,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-09-26 08:10:56,765 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:56,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:10:56,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:56,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:56,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:56,766 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 12 states. [2018-09-26 08:10:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:56,830 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-09-26 08:10:56,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:10:56,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2018-09-26 08:10:56,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:56,832 INFO L225 Difference]: With dead ends: 126 [2018-09-26 08:10:56,832 INFO L226 Difference]: Without dead ends: 124 [2018-09-26 08:10:56,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-26 08:10:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-09-26 08:10:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-26 08:10:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-09-26 08:10:56,886 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-09-26 08:10:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:56,887 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-09-26 08:10:56,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-09-26 08:10:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-26 08:10:56,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:56,888 INFO L375 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-09-26 08:10:56,889 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:56,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:56,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 19 times [2018-09-26 08:10:56,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 6041 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-26 08:10:58,166 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:10:58,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-09-26 08:10:58,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:10:58,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:10:58,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:10:58,174 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 103 states. [2018-09-26 08:11:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:00,137 INFO L93 Difference]: Finished difference Result 5119 states and 5579 transitions. [2018-09-26 08:11:00,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:11:00,138 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 123 [2018-09-26 08:11:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:00,138 INFO L225 Difference]: With dead ends: 5119 [2018-09-26 08:11:00,139 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:11:00,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:11:00,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:11:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:11:00,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:11:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:11:00,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2018-09-26 08:11:00,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:00,156 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:11:00,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:11:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:11:00,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:11:00,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:11:47,574 WARN L178 SmtUtils]: Spent 47.38 s on a formula simplification. DAG size of input: 5090 DAG size of output: 1364 [2018-09-26 08:11:48,287 WARN L178 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 680 DAG size of output: 671 [2018-09-26 08:11:54,936 WARN L178 SmtUtils]: Spent 6.63 s on a formula simplification. DAG size of input: 1364 DAG size of output: 369 [2018-09-26 08:11:55,314 WARN L178 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 671 DAG size of output: 68 [2018-09-26 08:11:55,317 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2018-09-26 08:11:55,319 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 51) the Hoare annotation is: false [2018-09-26 08:11:55,333 INFO L422 ceAbstractionStarter]: At program point L64(lines 49 65) the Hoare annotation is: (let ((.cse33 (<= (+ ULTIMATE.start_main_~j~5 7) ULTIMATE.start_main_~m~5)) (.cse38 (<= (+ ULTIMATE.start_main_~j~5 5) ULTIMATE.start_main_~m~5)) (.cse30 (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~m~5)) (.cse39 (<= (+ ULTIMATE.start_main_~j~5 3) ULTIMATE.start_main_~m~5)) (.cse3 (<= (+ ULTIMATE.start_main_~j~5 10) ULTIMATE.start_main_~m~5)) (.cse10 (<= (+ ULTIMATE.start_main_~j~5 4) ULTIMATE.start_main_~m~5)) (.cse34 (<= (+ ULTIMATE.start_main_~j~5 8) ULTIMATE.start_main_~m~5)) (.cse31 (<= (+ ULTIMATE.start_main_~j~5 2) ULTIMATE.start_main_~m~5)) (.cse28 (<= (+ ULTIMATE.start_main_~j~5 9) ULTIMATE.start_main_~m~5)) (.cse4 (<= 10 ULTIMATE.start_main_~m~5)) (.cse22 (<= (+ ULTIMATE.start_main_~j~5 6) ULTIMATE.start_main_~m~5))) (let ((.cse7 (<= 90 ULTIMATE.start_main_~k~5)) (.cse27 (<= 70 ULTIMATE.start_main_~k~5)) (.cse29 (<= 60 ULTIMATE.start_main_~k~5)) (.cse36 (<= 10 ULTIMATE.start_main_~k~5)) (.cse25 (<= 20 ULTIMATE.start_main_~k~5)) (.cse1 (and .cse4 .cse22)) (.cse35 (<= 50 ULTIMATE.start_main_~k~5)) (.cse15 (and .cse28 .cse4)) (.cse11 (and .cse31 .cse4)) (.cse17 (<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5)) (.cse24 (<= 40 ULTIMATE.start_main_~k~5)) (.cse6 (<= (+ ULTIMATE.start_main_~i~5 6) ULTIMATE.start_main_~n~5)) (.cse23 (and .cse4 .cse34)) (.cse32 (<= 80 ULTIMATE.start_main_~k~5)) (.cse0 (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5)) (.cse20 (and .cse4 .cse10)) (.cse2 (<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5)) (.cse19 (<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5)) (.cse8 (and .cse3 .cse4)) (.cse37 (<= 30 ULTIMATE.start_main_~k~5)) (.cse13 (and .cse4 .cse39)) (.cse12 (<= (+ ULTIMATE.start_main_~i~5 3) ULTIMATE.start_main_~n~5)) (.cse16 (<= (+ ULTIMATE.start_main_~i~5 5) ULTIMATE.start_main_~n~5)) (.cse18 (and .cse30 .cse4)) (.cse9 (<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5)) (.cse26 (and .cse38 .cse4)) (.cse14 (<= (+ ULTIMATE.start_main_~i~5 2) ULTIMATE.start_main_~n~5)) (.cse5 (and .cse33 .cse4)) (.cse21 (<= (+ ULTIMATE.start_main_~i~5 4) ULTIMATE.start_main_~n~5))) (or (and .cse0 .cse1 (<= 94 ULTIMATE.start_main_~k~5)) (and .cse2 .cse3 (<= 0 ULTIMATE.start_main_~k~5) .cse4) (and .cse5 .cse6 (<= 43 ULTIMATE.start_main_~k~5)) (and .cse0 .cse7 .cse8) (and .cse9 (<= 16 ULTIMATE.start_main_~k~5) .cse4 .cse10) (and (<= 78 ULTIMATE.start_main_~k~5) .cse11 .cse12) (and .cse0 .cse13 (<= 97 ULTIMATE.start_main_~k~5)) (and (<= 88 ULTIMATE.start_main_~k~5) .cse11 .cse14) (and .cse5 (<= 83 ULTIMATE.start_main_~k~5) .cse14) (and .cse15 .cse16 (<= 51 ULTIMATE.start_main_~k~5)) (and .cse17 (<= 29 ULTIMATE.start_main_~k~5) .cse18) (and .cse17 (<= 28 ULTIMATE.start_main_~k~5) .cse11) (and (<= 71 ULTIMATE.start_main_~k~5) .cse15 .cse12) (and .cse19 .cse20 (<= 36 ULTIMATE.start_main_~k~5)) (and .cse0 .cse15 (<= 91 ULTIMATE.start_main_~k~5)) (and (<= 74 ULTIMATE.start_main_~k~5) .cse12 .cse1) (and .cse11 .cse21 (<= 68 ULTIMATE.start_main_~k~5)) (and .cse15 .cse17 (<= 21 ULTIMATE.start_main_~k~5)) (and .cse9 (<= 14 ULTIMATE.start_main_~k~5) .cse4 .cse22) (and (<= 61 ULTIMATE.start_main_~k~5) .cse15 .cse21) (and .cse15 .cse19 (<= 31 ULTIMATE.start_main_~k~5)) (and .cse19 .cse18 (<= 39 ULTIMATE.start_main_~k~5)) (and (<= 72 ULTIMATE.start_main_~k~5) .cse23 .cse12) (and .cse0 (<= 99 ULTIMATE.start_main_~k~5) .cse18) (and .cse5 (<= 53 ULTIMATE.start_main_~k~5) .cse16) (and .cse0 (<= 98 ULTIMATE.start_main_~k~5) .cse11) (and (<= 54 ULTIMATE.start_main_~k~5) .cse16 .cse1) (and .cse8 .cse24 .cse6) (and .cse13 .cse19 (<= 37 ULTIMATE.start_main_~k~5)) (and .cse8 .cse17 .cse25) (and .cse19 .cse26 (<= 35 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 92 ULTIMATE.start_main_~k~5) .cse23) (and .cse27 .cse4 .cse21) (and .cse7 .cse4 .cse14) (and .cse2 .cse28 (<= 1 ULTIMATE.start_main_~k~5) .cse4) (and .cse29 .cse21 .cse8) (and .cse1 (<= 64 ULTIMATE.start_main_~k~5) .cse21) (and .cse13 (<= 87 ULTIMATE.start_main_~k~5) .cse14) (and .cse17 (<= 24 ULTIMATE.start_main_~k~5) .cse1) (and .cse27 .cse8 .cse12) (and (<= 89 ULTIMATE.start_main_~k~5) .cse18 .cse14) (and .cse2 .cse4 .cse22 (<= 4 ULTIMATE.start_main_~k~5)) (and .cse6 (<= 47 ULTIMATE.start_main_~k~5) .cse13) (and .cse18 (<= 79 ULTIMATE.start_main_~k~5) .cse12) (and .cse30 (<= 19 ULTIMATE.start_main_~k~5) .cse9 .cse4) (and .cse0 .cse5 (<= 93 ULTIMATE.start_main_~k~5)) (and .cse19 (<= 34 ULTIMATE.start_main_~k~5) .cse1) (and .cse20 .cse21 (<= 66 ULTIMATE.start_main_~k~5)) (and (<= 56 ULTIMATE.start_main_~k~5) .cse20 .cse16) (and .cse19 .cse5 (<= 33 ULTIMATE.start_main_~k~5)) (and .cse2 .cse31 .cse4 (<= 8 ULTIMATE.start_main_~k~5)) (and (<= 65 ULTIMATE.start_main_~k~5) .cse21 .cse26) (and (<= 45 ULTIMATE.start_main_~k~5) .cse6 .cse26) (and (<= 81 ULTIMATE.start_main_~k~5) .cse15 .cse14) (and .cse18 (<= 69 ULTIMATE.start_main_~k~5) .cse21) (and .cse19 (<= 38 ULTIMATE.start_main_~k~5) .cse11) (and .cse4 .cse12 .cse32) (and .cse2 (<= 3 ULTIMATE.start_main_~k~5) .cse33 .cse4) (and (<= 46 ULTIMATE.start_main_~k~5) .cse20 .cse6) (and .cse9 .cse4 (<= 12 ULTIMATE.start_main_~k~5) .cse34) (and .cse17 .cse23 (<= 22 ULTIMATE.start_main_~k~5)) (and .cse35 .cse16 .cse8) (and (<= 32 ULTIMATE.start_main_~k~5) .cse19 .cse23) (and .cse2 (<= 6 ULTIMATE.start_main_~k~5) .cse4 .cse10) (and .cse16 .cse29 .cse4) (and .cse6 (<= 48 ULTIMATE.start_main_~k~5) .cse11) (and .cse31 (<= 18 ULTIMATE.start_main_~k~5) .cse9 .cse4) (and .cse2 .cse36 .cse4) (and .cse17 .cse13 (<= 27 ULTIMATE.start_main_~k~5)) (and .cse0 .cse26 (<= 95 ULTIMATE.start_main_~k~5)) (and .cse26 .cse17 (<= 25 ULTIMATE.start_main_~k~5)) (and .cse16 .cse23 (<= 52 ULTIMATE.start_main_~k~5)) (and .cse2 .cse30 .cse4 (<= 9 ULTIMATE.start_main_~k~5)) (and .cse28 .cse9 (<= 11 ULTIMATE.start_main_~k~5) .cse4) (and .cse6 .cse1 (<= 44 ULTIMATE.start_main_~k~5)) (and .cse36 .cse9 .cse3 .cse4) (and .cse17 (<= 26 ULTIMATE.start_main_~k~5) .cse20) (and .cse6 .cse18 (<= 49 ULTIMATE.start_main_~k~5)) (and .cse25 .cse9 .cse4) (and (<= 84 ULTIMATE.start_main_~k~5) .cse1 .cse14) (and .cse17 .cse4 .cse37) (and .cse35 .cse6 .cse4) (and (<= 41 ULTIMATE.start_main_~k~5) .cse6 .cse15) (and (<= 82 ULTIMATE.start_main_~k~5) .cse23 .cse14) (and .cse0 (<= 100 ULTIMATE.start_main_~k~5) .cse4) (and .cse11 .cse16 (<= 58 ULTIMATE.start_main_~k~5)) (and .cse2 .cse38 .cse4 (<= 5 ULTIMATE.start_main_~k~5)) (and (<= 76 ULTIMATE.start_main_~k~5) .cse20 .cse12) (and .cse17 (<= 23 ULTIMATE.start_main_~k~5) .cse5) (and .cse24 .cse19 .cse4) (and .cse21 .cse13 (<= 67 ULTIMATE.start_main_~k~5)) (and .cse16 (<= 57 ULTIMATE.start_main_~k~5) .cse13) (and .cse9 .cse4 (<= 17 ULTIMATE.start_main_~k~5) .cse39) (and .cse26 .cse16 (<= 55 ULTIMATE.start_main_~k~5)) (and .cse23 .cse21 (<= 62 ULTIMATE.start_main_~k~5)) (and (<= 42 ULTIMATE.start_main_~k~5) .cse6 .cse23) (and .cse8 .cse14 .cse32) (and (<= 73 ULTIMATE.start_main_~k~5) .cse12 .cse5) (and .cse20 .cse14 (<= 86 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 7 ULTIMATE.start_main_~k~5) .cse4 .cse39) (and .cse26 .cse12 (<= 75 ULTIMATE.start_main_~k~5)) (and .cse0 .cse20 (<= 96 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 2 ULTIMATE.start_main_~k~5) .cse4 .cse34) (and .cse19 .cse8 .cse37) (and (<= 77 ULTIMATE.start_main_~k~5) .cse13 .cse12) (and .cse16 (<= 59 ULTIMATE.start_main_~k~5) .cse18) (and .cse9 (<= 15 ULTIMATE.start_main_~k~5) .cse38 .cse4) (and .cse9 (<= 13 ULTIMATE.start_main_~k~5) .cse33 .cse4) (and .cse26 (<= 85 ULTIMATE.start_main_~k~5) .cse14) (and .cse5 .cse21 (<= 63 ULTIMATE.start_main_~k~5))))) [2018-09-26 08:11:55,334 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 71) the Hoare annotation is: true [2018-09-26 08:11:55,334 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 71) no Hoare annotation was computed. [2018-09-26 08:11:55,334 INFO L422 ceAbstractionStarter]: At program point L45(lines 45 50) the Hoare annotation is: false [2018-09-26 08:11:55,335 INFO L422 ceAbstractionStarter]: At program point L70(lines 33 70) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~m~5))) (or (and (<= 70 ULTIMATE.start_main_~k~5) .cse0 (<= (+ ULTIMATE.start_main_~i~5 3) ULTIMATE.start_main_~n~5)) (and (<= (+ ULTIMATE.start_main_~i~5 10) ULTIMATE.start_main_~n~5) (<= 0 ULTIMATE.start_main_~k~5) .cse0) (and (<= (+ ULTIMATE.start_main_~i~5 7) ULTIMATE.start_main_~n~5) .cse0 (<= 30 ULTIMATE.start_main_~k~5)) (and (<= 100 ULTIMATE.start_main_~k~5) .cse0) (and .cse0 (<= (+ ULTIMATE.start_main_~i~5 2) ULTIMATE.start_main_~n~5) (<= 80 ULTIMATE.start_main_~k~5)) (and (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5) (<= 90 ULTIMATE.start_main_~k~5) .cse0) (and (<= (+ ULTIMATE.start_main_~i~5 8) ULTIMATE.start_main_~n~5) (<= 20 ULTIMATE.start_main_~k~5) .cse0) (and (<= 60 ULTIMATE.start_main_~k~5) .cse0 (<= (+ ULTIMATE.start_main_~i~5 4) ULTIMATE.start_main_~n~5)) (and (<= 50 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~i~5 5) ULTIMATE.start_main_~n~5) .cse0) (and (<= 40 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~i~5 6) ULTIMATE.start_main_~n~5) .cse0) (and (<= 10 ULTIMATE.start_main_~k~5) (<= (+ ULTIMATE.start_main_~i~5 9) ULTIMATE.start_main_~n~5) .cse0))) [2018-09-26 08:11:55,378 INFO L202 PluginConnector]: Adding new model nested.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:11:55 BoogieIcfgContainer [2018-09-26 08:11:55,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:11:55,379 INFO L168 Benchmark]: Toolchain (without parser) took 61924.85 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 346.3 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-26 08:11:55,381 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:11:55,381 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.71 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:11:55,382 INFO L168 Benchmark]: Boogie Preprocessor took 19.27 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:11:55,382 INFO L168 Benchmark]: RCFGBuilder took 214.66 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:11:55,385 INFO L168 Benchmark]: TraceAbstraction took 61646.73 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 335.7 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-26 08:11:55,393 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 38.71 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 19.27 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 214.66 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 61646.73 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 335.7 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: 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: 49]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && 94 <= main_~k~5) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 10 <= main_~m~5) && 0 <= main_~k~5) && 10 <= main_~m~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 6 <= main_~n~5) && 43 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 90 <= main_~k~5) && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 16 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5)) || ((78 <= main_~k~5 && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 97 <= main_~k~5)) || ((88 <= main_~k~5 && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 83 <= main_~k~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 51 <= main_~k~5)) || ((main_~i~5 + 8 <= main_~n~5 && 29 <= main_~k~5) && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 28 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || ((71 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 7 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && 36 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && 91 <= main_~k~5)) || ((74 <= main_~k~5 && main_~i~5 + 3 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || (((main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 68 <= main_~k~5)) || (((main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 8 <= main_~n~5) && 21 <= main_~k~5)) || (((main_~i~5 + 9 <= main_~n~5 && 14 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 6 <= main_~m~5)) || ((61 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || (((main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 7 <= main_~n~5) && 31 <= main_~k~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 39 <= main_~k~5)) || ((72 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 99 <= main_~k~5) && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 53 <= main_~k~5) && main_~i~5 + 5 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 98 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || ((54 <= main_~k~5 && main_~i~5 + 5 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || (((main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && 40 <= main_~k~5) && main_~i~5 + 6 <= main_~n~5)) || (((10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && main_~i~5 + 7 <= main_~n~5) && 37 <= main_~k~5)) || (((main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 8 <= main_~n~5) && 20 <= main_~k~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && 35 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 92 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5)) || ((70 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || ((90 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 9 <= main_~m~5) && 1 <= main_~k~5) && 10 <= main_~m~5)) || ((60 <= main_~k~5 && main_~i~5 + 4 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5)) || (((10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && 64 <= main_~k~5) && main_~i~5 + 4 <= main_~n~5)) || (((10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 87 <= main_~k~5) && main_~i~5 + 2 <= main_~n~5)) || ((main_~i~5 + 8 <= main_~n~5 && 24 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || ((70 <= main_~k~5 && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((89 <= main_~k~5 && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~i~5 + 10 <= main_~n~5 && 10 <= main_~m~5) && main_~j~5 + 6 <= main_~m~5) && 4 <= main_~k~5)) || ((main_~i~5 + 6 <= main_~n~5 && 47 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5)) || (((main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 79 <= main_~k~5) && main_~i~5 + 3 <= main_~n~5)) || (((main_~j~5 + 1 <= main_~m~5 && 19 <= main_~k~5) && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 93 <= main_~k~5)) || ((main_~i~5 + 7 <= main_~n~5 && 34 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5)) || (((10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 66 <= main_~k~5)) || ((56 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && 33 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 2 <= main_~m~5) && 10 <= main_~m~5) && 8 <= main_~k~5)) || ((65 <= main_~k~5 && main_~i~5 + 4 <= main_~n~5) && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5)) || ((45 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5)) || ((81 <= main_~k~5 && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 69 <= main_~k~5) && main_~i~5 + 4 <= main_~n~5)) || ((main_~i~5 + 7 <= main_~n~5 && 38 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || ((10 <= main_~m~5 && main_~i~5 + 3 <= main_~n~5) && 80 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5) && 10 <= main_~m~5)) || ((46 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 6 <= main_~n~5)) || (((main_~i~5 + 9 <= main_~n~5 && 10 <= main_~m~5) && 12 <= main_~k~5) && main_~j~5 + 8 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && 22 <= main_~k~5)) || ((50 <= main_~k~5 && main_~i~5 + 5 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5)) || ((32 <= main_~k~5 && main_~i~5 + 7 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5)) || (((main_~i~5 + 10 <= main_~n~5 && 6 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 4 <= main_~m~5)) || ((main_~i~5 + 5 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 6 <= main_~n~5 && 48 <= main_~k~5) && main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~j~5 + 2 <= main_~m~5 && 18 <= main_~k~5) && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5)) || ((main_~i~5 + 10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 27 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && 95 <= main_~k~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 8 <= main_~n~5) && 25 <= main_~k~5)) || ((main_~i~5 + 5 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && 52 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5) && 10 <= main_~m~5) && 9 <= main_~k~5)) || (((main_~j~5 + 9 <= main_~m~5 && main_~i~5 + 9 <= main_~n~5) && 11 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 6 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && 44 <= main_~k~5)) || (((10 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && main_~j~5 + 10 <= main_~m~5) && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 26 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5)) || ((main_~i~5 + 6 <= main_~n~5 && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5) && 49 <= main_~k~5)) || ((20 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5)) || ((84 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 6 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || ((main_~i~5 + 8 <= main_~n~5 && 10 <= main_~m~5) && 30 <= main_~k~5)) || ((50 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5)) || ((41 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && main_~j~5 + 9 <= main_~m~5 && 10 <= main_~m~5)) || ((82 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5)) || ((main_~i~5 + 1 <= main_~n~5 && 100 <= main_~k~5) && 10 <= main_~m~5)) || (((main_~j~5 + 2 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 58 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5) && 5 <= main_~k~5)) || ((76 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 8 <= main_~n~5 && 23 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5)) || ((40 <= main_~k~5 && main_~i~5 + 7 <= main_~n~5) && 10 <= main_~m~5)) || ((main_~i~5 + 4 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && 67 <= main_~k~5)) || ((main_~i~5 + 5 <= main_~n~5 && 57 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~j~5 + 3 <= main_~m~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 5 <= main_~n~5) && 55 <= main_~k~5)) || (((10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 62 <= main_~k~5)) || ((42 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5 && main_~j~5 + 8 <= main_~m~5)) || (((main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5) && 80 <= main_~k~5)) || ((73 <= main_~k~5 && main_~i~5 + 3 <= main_~n~5) && main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5)) || (((10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && main_~i~5 + 2 <= main_~n~5) && 86 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && 7 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 3 <= main_~m~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) && 75 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 + 4 <= main_~m~5) && 96 <= main_~k~5)) || (((main_~i~5 + 10 <= main_~n~5 && 2 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 + 8 <= main_~m~5)) || ((main_~i~5 + 7 <= main_~n~5 && main_~j~5 + 10 <= main_~m~5 && 10 <= main_~m~5) && 30 <= main_~k~5)) || ((77 <= main_~k~5 && 10 <= main_~m~5 && main_~j~5 + 3 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5)) || ((main_~i~5 + 5 <= main_~n~5 && 59 <= main_~k~5) && main_~j~5 + 1 <= main_~m~5 && 10 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 15 <= main_~k~5) && main_~j~5 + 5 <= main_~m~5) && 10 <= main_~m~5)) || (((main_~i~5 + 9 <= main_~n~5 && 13 <= main_~k~5) && main_~j~5 + 7 <= main_~m~5) && 10 <= main_~m~5)) || (((main_~j~5 + 5 <= main_~m~5 && 10 <= main_~m~5) && 85 <= main_~k~5) && main_~i~5 + 2 <= main_~n~5)) || (((main_~j~5 + 7 <= main_~m~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5) && 63 <= main_~k~5) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((((70 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 3 <= main_~n~5) || ((main_~i~5 + 10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 7 <= main_~n~5 && 10 <= main_~m~5) && 30 <= main_~k~5)) || (100 <= main_~k~5 && 10 <= main_~m~5)) || ((10 <= main_~m~5 && main_~i~5 + 2 <= main_~n~5) && 80 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 90 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 8 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5)) || ((60 <= main_~k~5 && 10 <= main_~m~5) && main_~i~5 + 4 <= main_~n~5)) || ((50 <= main_~k~5 && main_~i~5 + 5 <= main_~n~5) && 10 <= main_~m~5)) || ((40 <= main_~k~5 && main_~i~5 + 6 <= main_~n~5) && 10 <= main_~m~5)) || ((10 <= main_~k~5 && main_~i~5 + 9 <= main_~n~5) && 10 <= main_~m~5) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 61.5s OverallTime, 21 OverallIterations, 100 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 55.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 264 SDtfs, 342 SDslu, 370 SDs, 0 SdLazy, 540 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 297 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred 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.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 89 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 5121 NumberOfFragments, 2032 HoareAnnotationTreeSize, 5 FomulaSimplifications, 2036884 FormulaSimplificationTreeSizeReduction, 48.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 326487 FormulaSimplificationTreeSizeReductionInter, 7.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 788 NumberOfCodeBlocks, 788 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 767 ConstructedInterpolants, 0 QuantifiedInterpolants, 261543 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 8535/23385 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/nested.i_4.bplTransformedIcfg_BEv2_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-11-55-417.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested.i_4.bplTransformedIcfg_BEv2_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-11-55-417.csv Received shutdown request...