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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:53:53,666 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:53:53,668 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:53:53,682 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:53:53,682 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:53:53,683 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:53:53,685 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:53:53,688 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:53:53,689 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:53:53,690 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:53:53,691 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:53:53,691 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:53:53,692 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:53:53,693 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:53:53,694 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:53:53,695 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:53:53,696 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:53:53,698 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:53:53,700 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:53:53,701 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:53:53,702 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:53:53,704 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:53:53,706 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:53:53,706 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:53:53,707 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:53:53,707 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:53:53,710 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:53:53,711 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:53:53,712 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:53:53,716 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:53:53,717 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:53:53,717 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:53:53,718 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:53:53,718 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:53:53,719 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:53:53,719 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:53:53,720 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:53:53,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:53:53,743 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:53:53,743 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:53:53,744 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:53:53,744 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:53:53,745 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:53:53,745 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:53:53,746 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:53:53,746 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:53:53,746 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:53:53,746 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:53:53,746 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:53:53,747 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:53:53,747 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:53:53,747 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:53:53,747 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:53:53,747 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:53:53,749 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:53:53,749 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:53:53,749 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:53:53,749 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:53:53,749 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:53:53,750 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:53:53,750 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:53:53,750 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:53:53,750 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:53:53,751 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:53:53,751 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:53:53,751 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:53:53,751 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:53:53,751 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:53:53,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:53:53,815 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:53:53,822 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:53:53,823 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:53:53,824 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:53:53,825 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl [2018-10-01 00:53:53,825 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl' [2018-10-01 00:53:53,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:53:53,893 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:53:53,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:53:53,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:53:53,894 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:53:53,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:53" (1/1) ... [2018-10-01 00:53:53,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:53" (1/1) ... [2018-10-01 00:53:53,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:53:53,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:53:53,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:53:53,936 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:53:53,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:53" (1/1) ... [2018-10-01 00:53:53,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:53" (1/1) ... [2018-10-01 00:53:53,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:53" (1/1) ... [2018-10-01 00:53:53,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:53" (1/1) ... [2018-10-01 00:53:53,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:53" (1/1) ... [2018-10-01 00:53:53,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:53" (1/1) ... [2018-10-01 00:53:53,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:53" (1/1) ... [2018-10-01 00:53:53,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:53:53,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:53:53,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:53:53,957 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:53:53,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:53:54,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:53:54,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:53:54,231 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:53:54,232 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:53:54 BoogieIcfgContainer [2018-10-01 00:53:54,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:53:54,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:53:54,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:53:54,237 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:53:54,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:53:53" (1/2) ... [2018-10-01 00:53:54,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e3f1ed and model type nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:53:54, skipping insertion in model container [2018-10-01 00:53:54,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:53:54" (2/2) ... [2018-10-01 00:53:54,240 INFO L112 eAbstractionObserver]: Analyzing ICFG nested.i_4.bpl [2018-10-01 00:53:54,250 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:53:54,258 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:53:54,309 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:53:54,310 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:53:54,310 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:53:54,310 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:53:54,310 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:53:54,310 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:53:54,311 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:53:54,311 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:53:54,311 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:53:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-01 00:53:54,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-01 00:53:54,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:54,344 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-01 00:53:54,345 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:54,352 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:54,352 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-01 00:53:54,354 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:54,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:54,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:54,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:54,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:54,505 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:53:54,506 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:53:54,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:53:54,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:53:54,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:54,525 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-01 00:53:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:54,741 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2018-10-01 00:53:54,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:53:54,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-01 00:53:54,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:54,755 INFO L225 Difference]: With dead ends: 17 [2018-10-01 00:53:54,756 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 00:53:54,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:53:54,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 00:53:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-10-01 00:53:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-01 00:53:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-10-01 00:53:54,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 4 [2018-10-01 00:53:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:54,791 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-10-01 00:53:54,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:53:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-10-01 00:53:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:53:54,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:54,792 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-10-01 00:53:54,792 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:54,792 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:54,792 INFO L82 PathProgramCache]: Analyzing trace with hash 209100445, now seen corresponding path program 1 times [2018-10-01 00:53:54,793 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:54,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:54,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:54,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:54,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:54,889 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:53:54,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:53:54,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:53:54,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:53:54,891 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:54,891 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2018-10-01 00:53:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:54,982 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-10-01 00:53:54,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:53:54,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-01 00:53:54,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:54,983 INFO L225 Difference]: With dead ends: 17 [2018-10-01 00:53:54,983 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 00:53:54,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:53:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 00:53:54,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-01 00:53:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-01 00:53:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-10-01 00:53:54,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-10-01 00:53:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:54,988 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-10-01 00:53:54,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:53:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-10-01 00:53:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:53:54,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:54,989 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-10-01 00:53:54,990 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:54,990 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:54,990 INFO L82 PathProgramCache]: Analyzing trace with hash -850198025, now seen corresponding path program 1 times [2018-10-01 00:53:54,990 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:54,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:54,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:54,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:54,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:55,149 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:55,149 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:53:55,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:55,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:55,410 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:55,411 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-10-01 00:53:55,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:53:55,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:53:55,412 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:55,412 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 7 states. [2018-10-01 00:53:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:55,698 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-10-01 00:53:55,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:53:55,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-10-01 00:53:55,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:55,700 INFO L225 Difference]: With dead ends: 21 [2018-10-01 00:53:55,700 INFO L226 Difference]: Without dead ends: 13 [2018-10-01 00:53:55,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:53:55,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-01 00:53:55,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-01 00:53:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-01 00:53:55,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-10-01 00:53:55,705 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-10-01 00:53:55,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:55,705 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-10-01 00:53:55,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:53:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-10-01 00:53:55,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:53:55,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:55,706 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-10-01 00:53:55,707 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:55,707 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:55,707 INFO L82 PathProgramCache]: Analyzing trace with hash -928778543, now seen corresponding path program 2 times [2018-10-01 00:53:55,707 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:55,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:55,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:55,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:53:55,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:55,816 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:55,817 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:53:55,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:53:55,849 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:53:55,849 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:55,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-01 00:53:56,097 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:56,097 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2018-10-01 00:53:56,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:53:56,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:53:56,098 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:56,098 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 8 states. [2018-10-01 00:53:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:57,070 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-10-01 00:53:57,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:53:57,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-01 00:53:57,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:57,072 INFO L225 Difference]: With dead ends: 43 [2018-10-01 00:53:57,072 INFO L226 Difference]: Without dead ends: 33 [2018-10-01 00:53:57,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:53:57,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-01 00:53:57,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-10-01 00:53:57,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-01 00:53:57,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-01 00:53:57,081 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2018-10-01 00:53:57,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:57,082 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-01 00:53:57,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:53:57,082 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-01 00:53:57,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 00:53:57,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:57,083 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 3, 2, 2, 1, 1, 1] [2018-10-01 00:53:57,083 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:57,084 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:57,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1778757007, now seen corresponding path program 3 times [2018-10-01 00:53:57,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:57,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:57,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:57,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:57,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-01 00:53:57,275 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:57,275 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:53:57,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:53:57,297 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-01 00:53:57,298 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:57,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-01 00:53:57,439 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:57,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-10-01 00:53:57,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:53:57,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:53:57,440 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:57,441 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 10 states. [2018-10-01 00:53:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:58,231 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-10-01 00:53:58,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:53:58,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-10-01 00:53:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:58,234 INFO L225 Difference]: With dead ends: 65 [2018-10-01 00:53:58,235 INFO L226 Difference]: Without dead ends: 51 [2018-10-01 00:53:58,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:53:58,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-01 00:53:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-10-01 00:53:58,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-01 00:53:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-10-01 00:53:58,248 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 24 [2018-10-01 00:53:58,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:58,248 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-10-01 00:53:58,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:53:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-01 00:53:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-01 00:53:58,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:58,250 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 4, 3, 3, 1, 1, 1] [2018-10-01 00:53:58,250 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:58,251 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:58,251 INFO L82 PathProgramCache]: Analyzing trace with hash 209827969, now seen corresponding path program 4 times [2018-10-01 00:53:58,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:58,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:58,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:58,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:58,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 106 proven. 20 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-01 00:53:58,370 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:58,370 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:53:58,383 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:53:58,419 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:53:58,419 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:58,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 106 proven. 20 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-10-01 00:53:58,519 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:58,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-10-01 00:53:58,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:53:58,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:53:58,520 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:58,521 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 13 states. [2018-10-01 00:53:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:58,700 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-10-01 00:53:58,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:53:58,705 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-10-01 00:53:58,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:58,706 INFO L225 Difference]: With dead ends: 75 [2018-10-01 00:53:58,706 INFO L226 Difference]: Without dead ends: 47 [2018-10-01 00:53:58,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:53:58,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-01 00:53:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-01 00:53:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-01 00:53:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-10-01 00:53:58,722 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 40 [2018-10-01 00:53:58,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:58,723 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-10-01 00:53:58,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:53:58,723 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-10-01 00:53:58,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-01 00:53:58,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:58,725 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 4, 3, 3, 1, 1, 1] [2018-10-01 00:53:58,725 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:58,725 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:58,725 INFO L82 PathProgramCache]: Analyzing trace with hash -254509681, now seen corresponding path program 5 times [2018-10-01 00:53:58,726 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:58,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:58,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:58,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:58,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 150 proven. 30 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-01 00:53:58,934 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:58,934 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:53:58,947 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:53:59,009 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-10-01 00:53:59,009 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:59,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 150 proven. 30 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-01 00:53:59,370 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:59,370 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-10-01 00:53:59,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:53:59,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:53:59,371 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:59,371 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 15 states. [2018-10-01 00:53:59,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:59,489 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-10-01 00:53:59,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:53:59,500 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-10-01 00:53:59,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:59,502 INFO L225 Difference]: With dead ends: 85 [2018-10-01 00:53:59,502 INFO L226 Difference]: Without dead ends: 53 [2018-10-01 00:53:59,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:53:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-01 00:53:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-01 00:53:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-01 00:53:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-10-01 00:53:59,518 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 46 [2018-10-01 00:53:59,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:59,518 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-10-01 00:53:59,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:53:59,522 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-10-01 00:53:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-01 00:53:59,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:59,523 INFO L375 BasicCegarLoop]: trace histogram [21, 18, 4, 3, 3, 1, 1, 1] [2018-10-01 00:53:59,523 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:59,524 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:59,524 INFO L82 PathProgramCache]: Analyzing trace with hash -996261859, now seen corresponding path program 6 times [2018-10-01 00:53:59,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:59,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:59,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:59,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:59,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:59,672 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 202 proven. 42 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-10-01 00:53:59,673 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:59,673 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:53:59,682 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:53:59,698 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-01 00:53:59,699 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:59,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-01 00:54:00,182 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:00,182 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2018-10-01 00:54:00,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:54:00,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:54:00,183 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:00,183 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 14 states. [2018-10-01 00:54:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:01,773 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2018-10-01 00:54:01,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-01 00:54:01,773 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2018-10-01 00:54:01,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:01,775 INFO L225 Difference]: With dead ends: 129 [2018-10-01 00:54:01,775 INFO L226 Difference]: Without dead ends: 93 [2018-10-01 00:54:01,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:54:01,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-01 00:54:01,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2018-10-01 00:54:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-01 00:54:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-10-01 00:54:01,796 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 52 [2018-10-01 00:54:01,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:01,796 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-10-01 00:54:01,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:54:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-10-01 00:54:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-01 00:54:01,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:01,798 INFO L375 BasicCegarLoop]: trace histogram [32, 28, 5, 4, 4, 1, 1, 1] [2018-10-01 00:54:01,798 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:01,798 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:01,799 INFO L82 PathProgramCache]: Analyzing trace with hash -252111625, now seen corresponding path program 7 times [2018-10-01 00:54:01,799 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:01,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:01,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:01,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:01,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 392 proven. 56 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2018-10-01 00:54:02,478 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:02,478 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:54:02,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:02,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 392 proven. 56 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2018-10-01 00:54:03,282 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:03,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-10-01 00:54:03,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 00:54:03,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 00:54:03,283 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:03,284 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 19 states. [2018-10-01 00:54:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:03,474 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-10-01 00:54:03,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:54:03,475 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-10-01 00:54:03,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:03,476 INFO L225 Difference]: With dead ends: 143 [2018-10-01 00:54:03,476 INFO L226 Difference]: Without dead ends: 85 [2018-10-01 00:54:03,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:54:03,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-01 00:54:03,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-01 00:54:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-01 00:54:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-10-01 00:54:03,497 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 76 [2018-10-01 00:54:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:03,497 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-10-01 00:54:03,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 00:54:03,498 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-10-01 00:54:03,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-01 00:54:03,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:03,499 INFO L375 BasicCegarLoop]: trace histogram [36, 32, 5, 4, 4, 1, 1, 1] [2018-10-01 00:54:03,500 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:03,500 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:03,500 INFO L82 PathProgramCache]: Analyzing trace with hash 771511391, now seen corresponding path program 8 times [2018-10-01 00:54:03,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:03,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:03,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:03,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:03,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 494 proven. 72 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2018-10-01 00:54:03,674 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:03,674 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:54:03,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:54:03,764 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:54:03,765 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:54:03,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 494 proven. 72 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2018-10-01 00:54:04,118 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:04,118 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-10-01 00:54:04,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-01 00:54:04,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-01 00:54:04,119 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:04,119 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 21 states. [2018-10-01 00:54:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:04,346 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2018-10-01 00:54:04,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:54:04,347 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 84 [2018-10-01 00:54:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:04,348 INFO L225 Difference]: With dead ends: 157 [2018-10-01 00:54:04,348 INFO L226 Difference]: Without dead ends: 93 [2018-10-01 00:54:04,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:54:04,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-01 00:54:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-10-01 00:54:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-01 00:54:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-10-01 00:54:04,365 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 84 [2018-10-01 00:54:04,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:04,365 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-10-01 00:54:04,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-01 00:54:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-10-01 00:54:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-01 00:54:04,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:04,367 INFO L375 BasicCegarLoop]: trace histogram [40, 36, 5, 4, 4, 1, 1, 1] [2018-10-01 00:54:04,367 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:04,368 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:04,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1630563271, now seen corresponding path program 9 times [2018-10-01 00:54:04,368 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:04,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:04,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:04,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:04,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:04,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 608 proven. 90 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-10-01 00:54:04,502 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:04,503 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:54:04,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:54:04,575 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-10-01 00:54:04,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:54:04,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 608 proven. 90 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-10-01 00:54:04,961 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:04,961 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-10-01 00:54:04,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-01 00:54:04,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-01 00:54:04,962 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:04,962 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 23 states. [2018-10-01 00:54:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:05,370 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2018-10-01 00:54:05,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:54:05,372 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 92 [2018-10-01 00:54:05,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:05,373 INFO L225 Difference]: With dead ends: 171 [2018-10-01 00:54:05,373 INFO L226 Difference]: Without dead ends: 101 [2018-10-01 00:54:05,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:54:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-01 00:54:05,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-10-01 00:54:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-01 00:54:05,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-10-01 00:54:05,392 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 92 [2018-10-01 00:54:05,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:05,393 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-10-01 00:54:05,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-01 00:54:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-10-01 00:54:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-01 00:54:05,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:05,395 INFO L375 BasicCegarLoop]: trace histogram [44, 40, 5, 4, 4, 1, 1, 1] [2018-10-01 00:54:05,395 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:05,395 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:05,395 INFO L82 PathProgramCache]: Analyzing trace with hash -220374225, now seen corresponding path program 10 times [2018-10-01 00:54:05,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:05,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:05,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:05,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:05,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1912 backedges. 0 proven. 1472 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-10-01 00:54:05,528 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:05,528 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:54:05,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:54:05,580 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:54:05,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:54:05,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1912 backedges. 0 proven. 1472 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-10-01 00:54:05,823 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:05,823 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-01 00:54:05,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:54:05,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:54:05,824 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:05,824 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 12 states. [2018-10-01 00:54:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:06,007 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-10-01 00:54:06,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:54:06,008 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2018-10-01 00:54:06,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:06,009 INFO L225 Difference]: With dead ends: 149 [2018-10-01 00:54:06,009 INFO L226 Difference]: Without dead ends: 147 [2018-10-01 00:54:06,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:54:06,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-01 00:54:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 125. [2018-10-01 00:54:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-01 00:54:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-10-01 00:54:06,031 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 100 [2018-10-01 00:54:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:06,032 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-10-01 00:54:06,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:54:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-10-01 00:54:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-01 00:54:06,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:06,034 INFO L375 BasicCegarLoop]: trace histogram [55, 50, 6, 5, 5, 1, 1, 1] [2018-10-01 00:54:06,034 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:06,034 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:06,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1446024969, now seen corresponding path program 11 times [2018-10-01 00:54:06,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:06,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:06,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:06,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:06,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3000 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-10-01 00:54:06,440 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:06,440 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:54:06,448 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:54:06,523 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-01 00:54:06,523 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:54:06,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:06,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3000 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-10-01 00:54:06,938 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:06,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-01 00:54:06,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:54:06,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:54:06,939 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:06,940 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 14 states. [2018-10-01 00:54:07,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:07,054 INFO L93 Difference]: Finished difference Result 173 states and 180 transitions. [2018-10-01 00:54:07,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:54:07,055 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 124 [2018-10-01 00:54:07,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:07,056 INFO L225 Difference]: With dead ends: 173 [2018-10-01 00:54:07,057 INFO L226 Difference]: Without dead ends: 171 [2018-10-01 00:54:07,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:54:07,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-01 00:54:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 149. [2018-10-01 00:54:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-01 00:54:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2018-10-01 00:54:07,086 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 124 [2018-10-01 00:54:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:07,086 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2018-10-01 00:54:07,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:54:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2018-10-01 00:54:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-01 00:54:07,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:07,088 INFO L375 BasicCegarLoop]: trace histogram [66, 60, 7, 6, 6, 1, 1, 1] [2018-10-01 00:54:07,089 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:07,089 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:07,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1667523811, now seen corresponding path program 12 times [2018-10-01 00:54:07,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:07,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:07,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4332 backedges. 0 proven. 3672 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-10-01 00:54:07,332 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:07,332 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:54:07,341 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:54:07,416 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2018-10-01 00:54:07,416 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:54:07,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4332 backedges. 0 proven. 3672 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-10-01 00:54:07,822 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:07,823 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-01 00:54:07,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:54:07,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:54:07,823 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:07,824 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 16 states. [2018-10-01 00:54:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:08,041 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2018-10-01 00:54:08,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:54:08,043 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 148 [2018-10-01 00:54:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:08,044 INFO L225 Difference]: With dead ends: 197 [2018-10-01 00:54:08,044 INFO L226 Difference]: Without dead ends: 195 [2018-10-01 00:54:08,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:54:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-01 00:54:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2018-10-01 00:54:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-01 00:54:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 180 transitions. [2018-10-01 00:54:08,069 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 180 transitions. Word has length 148 [2018-10-01 00:54:08,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:08,070 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 180 transitions. [2018-10-01 00:54:08,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:54:08,070 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 180 transitions. [2018-10-01 00:54:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-01 00:54:08,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:08,072 INFO L375 BasicCegarLoop]: trace histogram [77, 70, 8, 7, 7, 1, 1, 1] [2018-10-01 00:54:08,072 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:08,073 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash 107136189, now seen corresponding path program 13 times [2018-10-01 00:54:08,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:08,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:08,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:08,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:08,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5908 backedges. 0 proven. 5138 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-10-01 00:54:08,352 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:08,353 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:54:08,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:08,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5908 backedges. 0 proven. 5138 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-10-01 00:54:08,866 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:08,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-01 00:54:08,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:54:08,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:54:08,867 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:08,868 INFO L87 Difference]: Start difference. First operand 173 states and 180 transitions. Second operand 18 states. [2018-10-01 00:54:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:09,083 INFO L93 Difference]: Finished difference Result 221 states and 230 transitions. [2018-10-01 00:54:09,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:54:09,084 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 172 [2018-10-01 00:54:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:09,085 INFO L225 Difference]: With dead ends: 221 [2018-10-01 00:54:09,085 INFO L226 Difference]: Without dead ends: 219 [2018-10-01 00:54:09,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:54:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-01 00:54:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 197. [2018-10-01 00:54:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-01 00:54:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 205 transitions. [2018-10-01 00:54:09,129 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 205 transitions. Word has length 172 [2018-10-01 00:54:09,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:09,130 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 205 transitions. [2018-10-01 00:54:09,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:54:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 205 transitions. [2018-10-01 00:54:09,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-01 00:54:09,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:09,132 INFO L375 BasicCegarLoop]: trace histogram [88, 80, 9, 8, 8, 1, 1, 1] [2018-10-01 00:54:09,133 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:09,133 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:09,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1927956841, now seen corresponding path program 14 times [2018-10-01 00:54:09,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:09,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:09,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:09,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:54:09,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7728 backedges. 0 proven. 6848 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-10-01 00:54:09,924 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:09,924 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:54:09,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:54:10,027 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:54:10,027 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:54:10,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:10,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7728 backedges. 0 proven. 6848 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-10-01 00:54:10,600 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:10,601 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-01 00:54:10,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:54:10,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:54:10,602 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:10,602 INFO L87 Difference]: Start difference. First operand 197 states and 205 transitions. Second operand 20 states. [2018-10-01 00:54:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:10,845 INFO L93 Difference]: Finished difference Result 245 states and 255 transitions. [2018-10-01 00:54:10,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:54:10,846 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 196 [2018-10-01 00:54:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:10,847 INFO L225 Difference]: With dead ends: 245 [2018-10-01 00:54:10,847 INFO L226 Difference]: Without dead ends: 243 [2018-10-01 00:54:10,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:54:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-01 00:54:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2018-10-01 00:54:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-01 00:54:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 230 transitions. [2018-10-01 00:54:10,890 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 230 transitions. Word has length 196 [2018-10-01 00:54:10,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:10,890 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 230 transitions. [2018-10-01 00:54:10,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:54:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 230 transitions. [2018-10-01 00:54:10,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-01 00:54:10,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:10,893 INFO L375 BasicCegarLoop]: trace histogram [99, 90, 10, 9, 9, 1, 1, 1] [2018-10-01 00:54:10,893 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:10,894 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:10,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1486407055, now seen corresponding path program 15 times [2018-10-01 00:54:10,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:10,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:10,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:10,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:10,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9792 backedges. 0 proven. 8802 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-10-01 00:54:11,196 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:54:11,196 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:54:11,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:54:11,487 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-10-01 00:54:11,487 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:54:11,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:54:11,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9792 backedges. 0 proven. 8802 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-10-01 00:54:11,987 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:54:11,988 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-01 00:54:11,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-01 00:54:11,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-01 00:54:11,989 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:11,989 INFO L87 Difference]: Start difference. First operand 221 states and 230 transitions. Second operand 22 states. [2018-10-01 00:54:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:12,366 INFO L93 Difference]: Finished difference Result 269 states and 280 transitions. [2018-10-01 00:54:12,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:54:12,366 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 220 [2018-10-01 00:54:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:12,368 INFO L225 Difference]: With dead ends: 269 [2018-10-01 00:54:12,368 INFO L226 Difference]: Without dead ends: 267 [2018-10-01 00:54:12,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:54:12,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-01 00:54:12,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 245. [2018-10-01 00:54:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-01 00:54:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 255 transitions. [2018-10-01 00:54:12,415 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 255 transitions. Word has length 220 [2018-10-01 00:54:12,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:12,415 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 255 transitions. [2018-10-01 00:54:12,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-01 00:54:12,416 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 255 transitions. [2018-10-01 00:54:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-01 00:54:12,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:54:12,417 INFO L375 BasicCegarLoop]: trace histogram [110, 100, 11, 10, 10, 1, 1, 1] [2018-10-01 00:54:12,417 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:54:12,418 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:54:12,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1732333643, now seen corresponding path program 16 times [2018-10-01 00:54:12,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:54:12,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:54:12,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:12,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:54:12,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:54:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:54:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 12082 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-01 00:54:14,578 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:54:14,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-10-01 00:54:14,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-01 00:54:14,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-01 00:54:14,580 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:54:14,580 INFO L87 Difference]: Start difference. First operand 245 states and 255 transitions. Second operand 103 states. [2018-10-01 00:54:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:54:18,558 INFO L93 Difference]: Finished difference Result 10235 states and 10695 transitions. [2018-10-01 00:54:18,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-01 00:54:18,559 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 244 [2018-10-01 00:54:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:54:18,559 INFO L225 Difference]: With dead ends: 10235 [2018-10-01 00:54:18,560 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:54:18,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:54:18,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:54:18,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:54:18,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:54:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:54:18,573 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2018-10-01 00:54:18,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:54:18,573 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:54:18,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-01 00:54:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:54:18,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:54:18,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:54:24,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:24,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:24,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:24,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:24,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:24,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:24,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:24,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:25,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:25,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:25,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:25,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:25,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:25,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:25,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:26,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:26,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:26,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:26,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:26,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:26,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:27,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:27,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:27,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:27,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:27,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:28,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:28,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:29,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:29,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:29,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:29,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:30,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:30,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:30,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:30,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:31,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:31,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:31,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:32,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:32,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:32,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:32,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:33,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:33,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:33,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:33,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:33,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:33,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:33,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:34,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:34,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:35,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:35,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:36,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:36,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:37,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:39,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:41,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:41,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:42,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:42,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:44,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:46,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:46,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:46,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:47,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:49,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:51,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:54,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:54:56,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:00,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:00,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:08,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:30,257 WARN L178 SmtUtils]: Spent 1.19 m on a formula simplification. DAG size of input: 5105 DAG size of output: 1935 [2018-10-01 00:55:34,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:34,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:34,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:34,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:34,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:34,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:34,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:34,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:34,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:34,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:34,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:34,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:35,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:35,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:35,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:35,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:35,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:35,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:35,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:35,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:36,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:36,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:36,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:36,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:37,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:37,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:37,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:38,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:38,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:38,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:38,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:39,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:40,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:40,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:40,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:40,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:41,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:41,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:41,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:42,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:42,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:42,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:42,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:43,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:43,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:43,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:43,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:43,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:43,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:43,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:45,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:45,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:45,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:46,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:46,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:47,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:47,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:49,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:52,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:52,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:52,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:52,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:55,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:56,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:56,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:57,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:55:58,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:00,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:02,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:05,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:07,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:11,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:11,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:18,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:42,083 WARN L178 SmtUtils]: Spent 1.20 m on a formula simplification. DAG size of input: 5105 DAG size of output: 1935 [2018-10-01 00:56:42,898 WARN L178 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-10-01 00:56:43,818 WARN L178 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-10-01 00:57:58,345 WARN L178 SmtUtils]: Spent 1.24 m on a formula simplification. DAG size of input: 1932 DAG size of output: 362 [2018-10-01 00:59:12,121 WARN L178 SmtUtils]: Spent 1.23 m on a formula simplification. DAG size of input: 1932 DAG size of output: 362 [2018-10-01 00:59:18,654 WARN L178 SmtUtils]: Spent 6.53 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-10-01 00:59:25,144 WARN L178 SmtUtils]: Spent 6.48 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-10-01 00:59:25,147 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2018-10-01 00:59:25,147 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 71) no Hoare annotation was computed. [2018-10-01 00:59:25,147 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2018-10-01 00:59:25,148 INFO L422 ceAbstractionStarter]: At program point L61(lines 31 61) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse1 (<= 10 ULTIMATE.start_main_~m~5))) (or (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 0)) (and .cse0 (<= 60 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 6)) (and .cse0 (<= 50 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 5) .cse1) (and (<= 100 ULTIMATE.start_main_~k~5) .cse1) (and .cse0 (<= 20 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 2) .cse1) (and .cse0 (<= 90 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 9) .cse1) (and .cse0 (<= ULTIMATE.start_main_~i~5 8) .cse1 (<= 80 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 40 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 4) .cse1) (and .cse0 (<= 70 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 7)) (and .cse0 (<= ULTIMATE.start_main_~i~5 3) .cse1 (<= 30 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 10 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 1)))) [2018-10-01 00:59:25,148 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 71) no Hoare annotation was computed. [2018-10-01 00:59:25,148 INFO L422 ceAbstractionStarter]: At program point L53(lines 53 62) the Hoare annotation is: (let ((.cse17 (<= ULTIMATE.start_main_~j~5 5)) (.cse10 (<= ULTIMATE.start_main_~j~5 9)) (.cse20 (<= ULTIMATE.start_main_~j~5 7)) (.cse33 (<= ULTIMATE.start_main_~j~5 8)) (.cse19 (<= ULTIMATE.start_main_~j~5 3)) (.cse25 (<= ULTIMATE.start_main_~j~5 6)) (.cse21 (<= ULTIMATE.start_main_~j~5 2)) (.cse8 (<= ULTIMATE.start_main_~j~5 4)) (.cse11 (<= ULTIMATE.start_main_~j~5 1)) (.cse4 (<= 10 ULTIMATE.start_main_~m~5)) (.cse32 (<= ULTIMATE.start_main_~j~5 0))) (let ((.cse28 (<= 90 ULTIMATE.start_main_~k~5)) (.cse36 (<= 50 ULTIMATE.start_main_~k~5)) (.cse3 (<= 20 ULTIMATE.start_main_~k~5)) (.cse14 (<= 80 ULTIMATE.start_main_~k~5)) (.cse31 (<= 40 ULTIMATE.start_main_~k~5)) (.cse6 (<= 70 ULTIMATE.start_main_~k~5)) (.cse29 (and .cse4 .cse32)) (.cse24 (and .cse11 .cse4)) (.cse34 (<= 60 ULTIMATE.start_main_~k~5)) (.cse35 (<= 30 ULTIMATE.start_main_~k~5)) (.cse18 (<= ULTIMATE.start_main_~i~5 4)) (.cse26 (<= ULTIMATE.start_main_~i~5 8)) (.cse22 (and .cse8 .cse4)) (.cse37 (and .cse4 .cse21)) (.cse5 (<= ULTIMATE.start_main_~i~5 1)) (.cse9 (<= ULTIMATE.start_main_~i~5 2)) (.cse39 (and .cse25 .cse4)) (.cse1 (and .cse19 .cse4)) (.cse15 (<= ULTIMATE.start_main_~i~5 7)) (.cse23 (<= ULTIMATE.start_main_~i~5 5)) (.cse16 (and .cse33 .cse4)) (.cse30 (and .cse20 .cse4)) (.cse40 (<= 10 ULTIMATE.start_main_~k~5)) (.cse12 (<= ULTIMATE.start_main_~i~5 0)) (.cse38 (and .cse4 .cse10)) (.cse0 (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5)) (.cse27 (and .cse17 .cse4)) (.cse7 (<= ULTIMATE.start_main_~i~5 6)) (.cse2 (<= 10 ULTIMATE.start_main_~n~5)) (.cse13 (<= ULTIMATE.start_main_~i~5 3))) (or (and (and .cse0 .cse1) (<= 93 ULTIMATE.start_main_~k~5)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse4 .cse6 .cse7) (and .cse2 .cse8 .cse9 (<= 24 ULTIMATE.start_main_~k~5) .cse4) (and .cse2 (<= 19 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse10) (and .cse2 (<= 1 ULTIMATE.start_main_~k~5) .cse11 .cse4 .cse12) (and .cse2 .cse13 .cse4 .cse10 (<= 39 ULTIMATE.start_main_~k~5)) (and .cse2 .cse4 .cse14 .cse15) (and .cse2 .cse16 (<= 78 ULTIMATE.start_main_~k~5) .cse15) (and .cse2 .cse17 .cse13 .cse4 (<= 35 ULTIMATE.start_main_~k~5)) (and .cse2 .cse4 .cse18 .cse10 (<= 49 ULTIMATE.start_main_~k~5)) (and .cse2 .cse19 .cse13 .cse4 (<= 33 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 7 ULTIMATE.start_main_~k~5) .cse20 .cse4 .cse12) (and .cse2 (<= 32 ULTIMATE.start_main_~k~5) .cse13 .cse4 .cse21) (and .cse2 .cse4 .cse10 (<= 9 ULTIMATE.start_main_~k~5) .cse12) (and (and .cse0 .cse22) (<= 94 ULTIMATE.start_main_~k~5)) (and .cse2 .cse23 (<= 51 ULTIMATE.start_main_~k~5) .cse24) (and .cse2 .cse8 .cse4 (<= 4 ULTIMATE.start_main_~k~5) .cse12) (and .cse2 (<= 3 ULTIMATE.start_main_~k~5) .cse19 .cse4 .cse12) (and .cse2 .cse25 (<= 6 ULTIMATE.start_main_~k~5) .cse4 .cse12) (and .cse2 (<= 41 ULTIMATE.start_main_~k~5) .cse11 .cse4 .cse18) (and .cse2 .cse20 .cse4 (<= 17 ULTIMATE.start_main_~k~5) .cse5) (and .cse2 .cse26 (<= 88 ULTIMATE.start_main_~k~5) .cse16) (and .cse2 (<= 2 ULTIMATE.start_main_~k~5) .cse4 .cse21 .cse12) (and .cse2 .cse9 .cse4 (<= 22 ULTIMATE.start_main_~k~5) .cse21) (and .cse2 .cse27 .cse15 (<= 75 ULTIMATE.start_main_~k~5)) (and .cse2 .cse23 .cse27 (<= 55 ULTIMATE.start_main_~k~5)) (and .cse28 (and .cse0 .cse29)) (and (and .cse0 .cse24) (<= 91 ULTIMATE.start_main_~k~5)) (and .cse2 .cse26 .cse30 (<= 87 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 29 ULTIMATE.start_main_~k~5) .cse9 .cse4 .cse10) (and .cse2 (<= 54 ULTIMATE.start_main_~k~5) .cse23 .cse22) (and .cse2 .cse9 (<= 25 ULTIMATE.start_main_~k~5) .cse17 .cse4) (and .cse2 (<= 12 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse21) (and .cse2 (<= 45 ULTIMATE.start_main_~k~5) .cse17 .cse4 .cse18) (and .cse2 .cse22 (<= 64 ULTIMATE.start_main_~k~5) .cse7) (and .cse2 .cse19 (<= 13 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse2 (<= 71 ULTIMATE.start_main_~k~5) .cse24 .cse15) (and .cse2 .cse25 .cse9 (<= 26 ULTIMATE.start_main_~k~5) .cse4) (and (<= 74 ULTIMATE.start_main_~k~5) .cse2 .cse22 .cse15) (and .cse2 .cse8 .cse18 .cse4 (<= 44 ULTIMATE.start_main_~k~5)) (and .cse2 .cse31 .cse18 .cse4 .cse32) (and .cse2 .cse33 (<= 48 ULTIMATE.start_main_~k~5) .cse4 .cse18) (and .cse2 .cse20 (<= 47 ULTIMATE.start_main_~k~5) .cse18 .cse4) (and .cse2 .cse34 .cse29 .cse7) (and .cse2 .cse9 .cse4 .cse35) (and .cse2 .cse16 .cse7 (<= 68 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 42 ULTIMATE.start_main_~k~5) .cse18 .cse4 .cse21) (and .cse2 .cse26 (<= 81 ULTIMATE.start_main_~k~5) .cse24) (and (and .cse0 .cse30) (<= 97 ULTIMATE.start_main_~k~5)) (and (<= 95 ULTIMATE.start_main_~k~5) (and .cse0 .cse27)) (and .cse2 (<= 18 ULTIMATE.start_main_~k~5) .cse33 .cse4 .cse5) (and .cse2 .cse7 .cse1 (<= 63 ULTIMATE.start_main_~k~5)) (and .cse2 .cse36 .cse18 .cse4) (and .cse2 .cse8 (<= 14 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse2 (<= 77 ULTIMATE.start_main_~k~5) .cse30 .cse15) (and .cse2 .cse9 (<= 21 ULTIMATE.start_main_~k~5) .cse11 .cse4) (and .cse2 (<= 11 ULTIMATE.start_main_~k~5) .cse11 .cse4 .cse5) (and .cse2 .cse26 .cse28 .cse4) (and (and .cse0 .cse37) (<= 92 ULTIMATE.start_main_~k~5)) (and .cse2 .cse29 .cse36 .cse23) (and .cse2 .cse17 .cse4 (<= 5 ULTIMATE.start_main_~k~5) .cse12) (and .cse2 .cse26 (<= 89 ULTIMATE.start_main_~k~5) .cse38) (and .cse2 .cse26 .cse37 (<= 82 ULTIMATE.start_main_~k~5)) (and .cse2 .cse3 .cse9 .cse4 .cse32) (and .cse2 .cse26 .cse29 .cse14) (and .cse2 (<= 72 ULTIMATE.start_main_~k~5) .cse37 .cse15) (and .cse2 .cse33 .cse4 (<= 8 ULTIMATE.start_main_~k~5) .cse12) (and .cse2 .cse25 (<= 16 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse2 .cse26 .cse39 (<= 86 ULTIMATE.start_main_~k~5)) (and .cse2 .cse31 .cse13 .cse4) (and (<= 98 ULTIMATE.start_main_~k~5) (and .cse0 .cse16)) (and .cse2 (<= 79 ULTIMATE.start_main_~k~5) .cse38 .cse15) (and .cse2 .cse23 .cse37 (<= 52 ULTIMATE.start_main_~k~5)) (and .cse2 .cse26 .cse27 (<= 85 ULTIMATE.start_main_~k~5)) (and (and .cse0 .cse38) (<= 99 ULTIMATE.start_main_~k~5)) (and .cse2 .cse17 (<= 15 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse2 .cse9 (<= 27 ULTIMATE.start_main_~k~5) .cse20 .cse4) (and .cse2 (<= 46 ULTIMATE.start_main_~k~5) .cse25 .cse4 .cse18) (and .cse2 (<= 0 ULTIMATE.start_main_~k~5) .cse4 .cse32 .cse12) (and .cse2 .cse6 .cse29 .cse15) (and .cse2 .cse9 .cse33 (<= 28 ULTIMATE.start_main_~k~5) .cse4) (and .cse2 (<= 61 ULTIMATE.start_main_~k~5) .cse24 .cse7) (and .cse2 .cse39 (<= 66 ULTIMATE.start_main_~k~5) .cse7) (and .cse2 .cse13 .cse20 .cse4 (<= 37 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 53 ULTIMATE.start_main_~k~5) .cse23 .cse1) (and .cse2 .cse4 .cse23 .cse34) (and .cse2 .cse33 (<= 38 ULTIMATE.start_main_~k~5) .cse13 .cse4) (and .cse2 .cse13 .cse4 .cse32 .cse35) (and .cse2 .cse19 (<= 43 ULTIMATE.start_main_~k~5) .cse4 .cse18) (and .cse2 .cse8 (<= 34 ULTIMATE.start_main_~k~5) .cse13 .cse4) (and .cse2 .cse26 .cse1 (<= 83 ULTIMATE.start_main_~k~5)) (and .cse2 .cse23 (<= 59 ULTIMATE.start_main_~k~5) .cse38) (and .cse2 .cse25 .cse13 (<= 36 ULTIMATE.start_main_~k~5) .cse4) (and .cse2 .cse23 (<= 57 ULTIMATE.start_main_~k~5) .cse30) (and .cse2 .cse26 (<= 84 ULTIMATE.start_main_~k~5) .cse22) (and .cse2 .cse37 .cse7 (<= 62 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 56 ULTIMATE.start_main_~k~5) .cse23 .cse39) (and .cse2 .cse40 .cse4 .cse32 .cse5) (and .cse2 .cse9 .cse19 (<= 23 ULTIMATE.start_main_~k~5) .cse4) (and .cse2 .cse39 (<= 76 ULTIMATE.start_main_~k~5) .cse15) (and (and .cse0 .cse39) (<= 96 ULTIMATE.start_main_~k~5)) (and .cse2 .cse1 (<= 73 ULTIMATE.start_main_~k~5) .cse15) (and .cse2 .cse23 .cse16 (<= 58 ULTIMATE.start_main_~k~5)) (and .cse2 .cse30 .cse7 (<= 67 ULTIMATE.start_main_~k~5)) (and .cse2 .cse40 .cse4 .cse12) (and .cse2 (<= 69 ULTIMATE.start_main_~k~5) .cse38 .cse7) (and (<= 100 ULTIMATE.start_main_~k~5) (and .cse0 .cse4)) (and .cse2 (<= 65 ULTIMATE.start_main_~k~5) .cse27 .cse7) (and .cse2 .cse13 .cse11 .cse4 (<= 31 ULTIMATE.start_main_~k~5))))) [2018-10-01 00:59:25,149 INFO L422 ceAbstractionStarter]: At program point L44(lines 44 49) the Hoare annotation is: false [2018-10-01 00:59:25,149 INFO L422 ceAbstractionStarter]: At program point L70(lines 48 70) the Hoare annotation is: (let ((.cse17 (<= ULTIMATE.start_main_~j~5 5)) (.cse10 (<= ULTIMATE.start_main_~j~5 9)) (.cse20 (<= ULTIMATE.start_main_~j~5 7)) (.cse33 (<= ULTIMATE.start_main_~j~5 8)) (.cse19 (<= ULTIMATE.start_main_~j~5 3)) (.cse25 (<= ULTIMATE.start_main_~j~5 6)) (.cse21 (<= ULTIMATE.start_main_~j~5 2)) (.cse8 (<= ULTIMATE.start_main_~j~5 4)) (.cse11 (<= ULTIMATE.start_main_~j~5 1)) (.cse4 (<= 10 ULTIMATE.start_main_~m~5)) (.cse32 (<= ULTIMATE.start_main_~j~5 0))) (let ((.cse28 (<= 90 ULTIMATE.start_main_~k~5)) (.cse36 (<= 50 ULTIMATE.start_main_~k~5)) (.cse3 (<= 20 ULTIMATE.start_main_~k~5)) (.cse14 (<= 80 ULTIMATE.start_main_~k~5)) (.cse31 (<= 40 ULTIMATE.start_main_~k~5)) (.cse6 (<= 70 ULTIMATE.start_main_~k~5)) (.cse29 (and .cse4 .cse32)) (.cse24 (and .cse11 .cse4)) (.cse34 (<= 60 ULTIMATE.start_main_~k~5)) (.cse35 (<= 30 ULTIMATE.start_main_~k~5)) (.cse18 (<= ULTIMATE.start_main_~i~5 4)) (.cse26 (<= ULTIMATE.start_main_~i~5 8)) (.cse22 (and .cse8 .cse4)) (.cse37 (and .cse4 .cse21)) (.cse5 (<= ULTIMATE.start_main_~i~5 1)) (.cse9 (<= ULTIMATE.start_main_~i~5 2)) (.cse39 (and .cse25 .cse4)) (.cse1 (and .cse19 .cse4)) (.cse15 (<= ULTIMATE.start_main_~i~5 7)) (.cse23 (<= ULTIMATE.start_main_~i~5 5)) (.cse16 (and .cse33 .cse4)) (.cse30 (and .cse20 .cse4)) (.cse40 (<= 10 ULTIMATE.start_main_~k~5)) (.cse12 (<= ULTIMATE.start_main_~i~5 0)) (.cse38 (and .cse4 .cse10)) (.cse0 (<= (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~n~5)) (.cse27 (and .cse17 .cse4)) (.cse7 (<= ULTIMATE.start_main_~i~5 6)) (.cse2 (<= 10 ULTIMATE.start_main_~n~5)) (.cse13 (<= ULTIMATE.start_main_~i~5 3))) (or (and (and .cse0 .cse1) (<= 93 ULTIMATE.start_main_~k~5)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse4 .cse6 .cse7) (and .cse2 .cse8 .cse9 (<= 24 ULTIMATE.start_main_~k~5) .cse4) (and .cse2 (<= 19 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse10) (and .cse2 (<= 1 ULTIMATE.start_main_~k~5) .cse11 .cse4 .cse12) (and .cse2 .cse13 .cse4 .cse10 (<= 39 ULTIMATE.start_main_~k~5)) (and .cse2 .cse4 .cse14 .cse15) (and .cse2 .cse16 (<= 78 ULTIMATE.start_main_~k~5) .cse15) (and .cse2 .cse17 .cse13 .cse4 (<= 35 ULTIMATE.start_main_~k~5)) (and .cse2 .cse4 .cse18 .cse10 (<= 49 ULTIMATE.start_main_~k~5)) (and .cse2 .cse19 .cse13 .cse4 (<= 33 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 7 ULTIMATE.start_main_~k~5) .cse20 .cse4 .cse12) (and .cse2 (<= 32 ULTIMATE.start_main_~k~5) .cse13 .cse4 .cse21) (and .cse2 .cse4 .cse10 (<= 9 ULTIMATE.start_main_~k~5) .cse12) (and (and .cse0 .cse22) (<= 94 ULTIMATE.start_main_~k~5)) (and .cse2 .cse23 (<= 51 ULTIMATE.start_main_~k~5) .cse24) (and .cse2 .cse8 .cse4 (<= 4 ULTIMATE.start_main_~k~5) .cse12) (and .cse2 (<= 3 ULTIMATE.start_main_~k~5) .cse19 .cse4 .cse12) (and .cse2 .cse25 (<= 6 ULTIMATE.start_main_~k~5) .cse4 .cse12) (and .cse2 (<= 41 ULTIMATE.start_main_~k~5) .cse11 .cse4 .cse18) (and .cse2 .cse20 .cse4 (<= 17 ULTIMATE.start_main_~k~5) .cse5) (and .cse2 .cse26 (<= 88 ULTIMATE.start_main_~k~5) .cse16) (and .cse2 (<= 2 ULTIMATE.start_main_~k~5) .cse4 .cse21 .cse12) (and .cse2 .cse9 .cse4 (<= 22 ULTIMATE.start_main_~k~5) .cse21) (and .cse2 .cse27 .cse15 (<= 75 ULTIMATE.start_main_~k~5)) (and .cse2 .cse23 .cse27 (<= 55 ULTIMATE.start_main_~k~5)) (and .cse28 (and .cse0 .cse29)) (and (and .cse0 .cse24) (<= 91 ULTIMATE.start_main_~k~5)) (and .cse2 .cse26 .cse30 (<= 87 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 29 ULTIMATE.start_main_~k~5) .cse9 .cse4 .cse10) (and .cse2 (<= 54 ULTIMATE.start_main_~k~5) .cse23 .cse22) (and .cse2 .cse9 (<= 25 ULTIMATE.start_main_~k~5) .cse17 .cse4) (and .cse2 (<= 12 ULTIMATE.start_main_~k~5) .cse4 .cse5 .cse21) (and .cse2 (<= 45 ULTIMATE.start_main_~k~5) .cse17 .cse4 .cse18) (and .cse2 .cse22 (<= 64 ULTIMATE.start_main_~k~5) .cse7) (and .cse2 .cse19 (<= 13 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse2 (<= 71 ULTIMATE.start_main_~k~5) .cse24 .cse15) (and .cse2 .cse25 .cse9 (<= 26 ULTIMATE.start_main_~k~5) .cse4) (and (<= 74 ULTIMATE.start_main_~k~5) .cse2 .cse22 .cse15) (and .cse2 .cse8 .cse18 .cse4 (<= 44 ULTIMATE.start_main_~k~5)) (and .cse2 .cse31 .cse18 .cse4 .cse32) (and .cse2 .cse33 (<= 48 ULTIMATE.start_main_~k~5) .cse4 .cse18) (and .cse2 .cse20 (<= 47 ULTIMATE.start_main_~k~5) .cse18 .cse4) (and .cse2 .cse34 .cse29 .cse7) (and .cse2 .cse9 .cse4 .cse35) (and .cse2 .cse16 .cse7 (<= 68 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 42 ULTIMATE.start_main_~k~5) .cse18 .cse4 .cse21) (and .cse2 .cse26 (<= 81 ULTIMATE.start_main_~k~5) .cse24) (and (and .cse0 .cse30) (<= 97 ULTIMATE.start_main_~k~5)) (and (<= 95 ULTIMATE.start_main_~k~5) (and .cse0 .cse27)) (and .cse2 (<= 18 ULTIMATE.start_main_~k~5) .cse33 .cse4 .cse5) (and .cse2 .cse7 .cse1 (<= 63 ULTIMATE.start_main_~k~5)) (and .cse2 .cse36 .cse18 .cse4) (and .cse2 .cse8 (<= 14 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse2 (<= 77 ULTIMATE.start_main_~k~5) .cse30 .cse15) (and .cse2 .cse9 (<= 21 ULTIMATE.start_main_~k~5) .cse11 .cse4) (and .cse2 (<= 11 ULTIMATE.start_main_~k~5) .cse11 .cse4 .cse5) (and .cse2 .cse26 .cse28 .cse4) (and (and .cse0 .cse37) (<= 92 ULTIMATE.start_main_~k~5)) (and .cse2 .cse29 .cse36 .cse23) (and .cse2 .cse17 .cse4 (<= 5 ULTIMATE.start_main_~k~5) .cse12) (and .cse2 .cse26 (<= 89 ULTIMATE.start_main_~k~5) .cse38) (and .cse2 .cse26 .cse37 (<= 82 ULTIMATE.start_main_~k~5)) (and .cse2 .cse3 .cse9 .cse4 .cse32) (and .cse2 .cse26 .cse29 .cse14) (and .cse2 (<= 72 ULTIMATE.start_main_~k~5) .cse37 .cse15) (and .cse2 .cse33 .cse4 (<= 8 ULTIMATE.start_main_~k~5) .cse12) (and .cse2 .cse25 (<= 16 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse2 .cse26 .cse39 (<= 86 ULTIMATE.start_main_~k~5)) (and .cse2 .cse31 .cse13 .cse4) (and (<= 98 ULTIMATE.start_main_~k~5) (and .cse0 .cse16)) (and .cse2 (<= 79 ULTIMATE.start_main_~k~5) .cse38 .cse15) (and .cse2 .cse23 .cse37 (<= 52 ULTIMATE.start_main_~k~5)) (and .cse2 .cse26 .cse27 (<= 85 ULTIMATE.start_main_~k~5)) (and (and .cse0 .cse38) (<= 99 ULTIMATE.start_main_~k~5)) (and .cse2 .cse17 (<= 15 ULTIMATE.start_main_~k~5) .cse4 .cse5) (and .cse2 .cse9 (<= 27 ULTIMATE.start_main_~k~5) .cse20 .cse4) (and .cse2 (<= 46 ULTIMATE.start_main_~k~5) .cse25 .cse4 .cse18) (and .cse2 (<= 0 ULTIMATE.start_main_~k~5) .cse4 .cse32 .cse12) (and .cse2 .cse6 .cse29 .cse15) (and .cse2 .cse9 .cse33 (<= 28 ULTIMATE.start_main_~k~5) .cse4) (and .cse2 (<= 61 ULTIMATE.start_main_~k~5) .cse24 .cse7) (and .cse2 .cse39 (<= 66 ULTIMATE.start_main_~k~5) .cse7) (and .cse2 .cse13 .cse20 .cse4 (<= 37 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 53 ULTIMATE.start_main_~k~5) .cse23 .cse1) (and .cse2 .cse4 .cse23 .cse34) (and .cse2 .cse33 (<= 38 ULTIMATE.start_main_~k~5) .cse13 .cse4) (and .cse2 .cse13 .cse4 .cse32 .cse35) (and .cse2 .cse19 (<= 43 ULTIMATE.start_main_~k~5) .cse4 .cse18) (and .cse2 .cse8 (<= 34 ULTIMATE.start_main_~k~5) .cse13 .cse4) (and .cse2 .cse26 .cse1 (<= 83 ULTIMATE.start_main_~k~5)) (and .cse2 .cse23 (<= 59 ULTIMATE.start_main_~k~5) .cse38) (and .cse2 .cse25 .cse13 (<= 36 ULTIMATE.start_main_~k~5) .cse4) (and .cse2 .cse23 (<= 57 ULTIMATE.start_main_~k~5) .cse30) (and .cse2 .cse26 (<= 84 ULTIMATE.start_main_~k~5) .cse22) (and .cse2 .cse37 .cse7 (<= 62 ULTIMATE.start_main_~k~5)) (and .cse2 (<= 56 ULTIMATE.start_main_~k~5) .cse23 .cse39) (and .cse2 .cse40 .cse4 .cse32 .cse5) (and .cse2 .cse9 .cse19 (<= 23 ULTIMATE.start_main_~k~5) .cse4) (and .cse2 .cse39 (<= 76 ULTIMATE.start_main_~k~5) .cse15) (and (and .cse0 .cse39) (<= 96 ULTIMATE.start_main_~k~5)) (and .cse2 .cse1 (<= 73 ULTIMATE.start_main_~k~5) .cse15) (and .cse2 .cse23 .cse16 (<= 58 ULTIMATE.start_main_~k~5)) (and .cse2 .cse30 .cse7 (<= 67 ULTIMATE.start_main_~k~5)) (and .cse2 .cse40 .cse4 .cse12) (and .cse2 (<= 69 ULTIMATE.start_main_~k~5) .cse38 .cse7) (and (<= 100 ULTIMATE.start_main_~k~5) (and .cse0 .cse4)) (and .cse2 (<= 65 ULTIMATE.start_main_~k~5) .cse27 .cse7) (and .cse2 .cse13 .cse11 .cse4 (<= 31 ULTIMATE.start_main_~k~5))))) [2018-10-01 00:59:25,150 INFO L422 ceAbstractionStarter]: At program point L34(lines 34 45) the Hoare annotation is: (let ((.cse0 (<= 10 ULTIMATE.start_main_~n~5)) (.cse1 (<= 10 ULTIMATE.start_main_~m~5))) (or (and .cse0 (<= 0 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 0)) (and .cse0 (<= 60 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 6)) (and .cse0 (<= 50 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 5) .cse1) (and (<= 100 ULTIMATE.start_main_~k~5) .cse1) (and .cse0 (<= 20 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 2) .cse1) (and .cse0 (<= 90 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 9) .cse1) (and .cse0 (<= ULTIMATE.start_main_~i~5 8) .cse1 (<= 80 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 40 ULTIMATE.start_main_~k~5) (<= ULTIMATE.start_main_~i~5 4) .cse1) (and .cse0 (<= 70 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 7)) (and .cse0 (<= ULTIMATE.start_main_~i~5 3) .cse1 (<= 30 ULTIMATE.start_main_~k~5)) (and .cse0 (<= 10 ULTIMATE.start_main_~k~5) .cse1 (<= ULTIMATE.start_main_~i~5 1)))) [2018-10-01 00:59:25,194 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:59:25 BoogieIcfgContainer [2018-10-01 00:59:25,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:59:25,195 INFO L168 Benchmark]: Toolchain (without parser) took 331307.10 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 776.5 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 469.4 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-10-01 00:59:25,197 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:59:25,197 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.13 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:59:25,198 INFO L168 Benchmark]: Boogie Preprocessor took 20.60 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:59:25,198 INFO L168 Benchmark]: RCFGBuilder took 275.43 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 00:59:25,199 INFO L168 Benchmark]: TraceAbstraction took 330961.07 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 776.5 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 448.3 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-10-01 00:59:25,203 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.24 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.13 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.60 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 275.43 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 330961.07 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 776.5 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 448.3 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: 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: 53]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 93 <= main_~k~5) || (((10 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 70 <= main_~k~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && main_~i~5 <= 2) && 24 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 19 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && 1 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 9) && 39 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 80 <= main_~k~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5) && 78 <= main_~k~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && main_~i~5 <= 3) && 10 <= main_~m~5) && 35 <= main_~k~5)) || ((((10 <= main_~n~5 && 10 <= main_~m~5) && main_~i~5 <= 4) && main_~j~5 <= 9) && 49 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && main_~i~5 <= 3) && 10 <= main_~m~5) && 33 <= main_~k~5)) || ((((10 <= main_~n~5 && 7 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 32 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 2)) || ((((10 <= main_~n~5 && 10 <= main_~m~5) && main_~j~5 <= 9) && 9 <= main_~k~5) && main_~i~5 <= 0)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 94 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 51 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 10 <= main_~m~5) && 4 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 <= 3) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 6 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 41 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 88 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 2 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 2) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 22 <= main_~k~5) && main_~j~5 <= 2)) || (((10 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 7) && 75 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && main_~j~5 <= 5 && 10 <= main_~m~5) && 55 <= main_~k~5)) || (90 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 1 && 10 <= main_~m~5) && 91 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 7 && 10 <= main_~m~5) && 87 <= main_~k~5)) || ((((10 <= main_~n~5 && 29 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 9)) || (((10 <= main_~n~5 && 54 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 25 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 12 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 2)) || ((((10 <= main_~n~5 && 45 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 64 <= main_~k~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 13 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 71 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && main_~i~5 <= 2) && 26 <= main_~k~5) && 10 <= main_~m~5)) || (((74 <= main_~k~5 && 10 <= main_~n~5) && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && main_~i~5 <= 4) && 10 <= main_~m~5) && 44 <= main_~k~5)) || ((((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5) && main_~j~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 48 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 47 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 6) && 68 <= main_~k~5)) || ((((10 <= main_~n~5 && 42 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5) && main_~j~5 <= 2)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 81 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && 97 <= main_~k~5)) || (95 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 18 <= main_~k~5) && main_~j~5 <= 8) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 6) && main_~j~5 <= 3 && 10 <= main_~m~5) && 63 <= main_~k~5)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 14 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 77 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 21 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 11 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 90 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && 92 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0) && 50 <= main_~k~5) && main_~i~5 <= 5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 10 <= main_~m~5) && 5 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 89 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5 && main_~j~5 <= 2) && 82 <= main_~k~5)) || ((((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5 && main_~j~5 <= 0) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 72 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 10 <= main_~m~5) && 8 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 16 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 6 && 10 <= main_~m~5) && 86 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || (98 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 79 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 2) && 52 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 5 && 10 <= main_~m~5) && 85 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 99 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 15 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 27 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 46 <= main_~k~5) && main_~j~5 <= 6) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 8) && 28 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 61 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 66 <= main_~k~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 7) && 10 <= main_~m~5) && 37 <= main_~k~5)) || (((10 <= main_~n~5 && 53 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 3 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && main_~i~5 <= 5) && 60 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 38 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 0) && 30 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 43 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 34 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 3 && 10 <= main_~m~5) && 83 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 59 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && main_~i~5 <= 3) && 36 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 57 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 84 <= main_~k~5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 6) && 62 <= main_~k~5)) || (((10 <= main_~n~5 && 56 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 6 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 3) && 23 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 76 <= main_~k~5) && main_~i~5 <= 7)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 96 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 73 <= main_~k~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && main_~j~5 <= 8 && 10 <= main_~m~5) && 58 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 6) && 67 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 69 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 6)) || (100 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 65 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 1) && 10 <= main_~m~5) && 31 <= main_~k~5) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 93 <= main_~k~5) || (((10 <= main_~n~5 && 20 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 70 <= main_~k~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && main_~i~5 <= 2) && 24 <= main_~k~5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 19 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && 1 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 9) && 39 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && 80 <= main_~k~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5) && 78 <= main_~k~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && main_~i~5 <= 3) && 10 <= main_~m~5) && 35 <= main_~k~5)) || ((((10 <= main_~n~5 && 10 <= main_~m~5) && main_~i~5 <= 4) && main_~j~5 <= 9) && 49 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && main_~i~5 <= 3) && 10 <= main_~m~5) && 33 <= main_~k~5)) || ((((10 <= main_~n~5 && 7 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 32 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 2)) || ((((10 <= main_~n~5 && 10 <= main_~m~5) && main_~j~5 <= 9) && 9 <= main_~k~5) && main_~i~5 <= 0)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 94 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 51 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 10 <= main_~m~5) && 4 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 3 <= main_~k~5) && main_~j~5 <= 3) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 6 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && 41 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 10 <= main_~m~5) && 17 <= main_~k~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 88 <= main_~k~5) && main_~j~5 <= 8 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 2 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 2) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 22 <= main_~k~5) && main_~j~5 <= 2)) || (((10 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 7) && 75 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && main_~j~5 <= 5 && 10 <= main_~m~5) && 55 <= main_~k~5)) || (90 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 1 && 10 <= main_~m~5) && 91 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 7 && 10 <= main_~m~5) && 87 <= main_~k~5)) || ((((10 <= main_~n~5 && 29 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 9)) || (((10 <= main_~n~5 && 54 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 25 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 12 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) && main_~j~5 <= 2)) || ((((10 <= main_~n~5 && 45 <= main_~k~5) && main_~j~5 <= 5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || (((10 <= main_~n~5 && main_~j~5 <= 4 && 10 <= main_~m~5) && 64 <= main_~k~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 13 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 71 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && main_~i~5 <= 2) && 26 <= main_~k~5) && 10 <= main_~m~5)) || (((74 <= main_~k~5 && 10 <= main_~n~5) && main_~j~5 <= 4 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && main_~i~5 <= 4) && 10 <= main_~m~5) && 44 <= main_~k~5)) || ((((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5) && main_~j~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 48 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 7) && 47 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~i~5 <= 2) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5) && main_~i~5 <= 6) && 68 <= main_~k~5)) || ((((10 <= main_~n~5 && 42 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5) && main_~j~5 <= 2)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 81 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && 97 <= main_~k~5)) || (95 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 5 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 18 <= main_~k~5) && main_~j~5 <= 8) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 6) && main_~j~5 <= 3 && 10 <= main_~m~5) && 63 <= main_~k~5)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 14 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && 77 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 21 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 11 <= main_~k~5) && main_~j~5 <= 1) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 90 <= main_~k~5) && 10 <= main_~m~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && 92 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 0) && 50 <= main_~k~5) && main_~i~5 <= 5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 10 <= main_~m~5) && 5 <= main_~k~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 89 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5 && main_~j~5 <= 2) && 82 <= main_~k~5)) || ((((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5) && main_~j~5 <= 0)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5 && main_~j~5 <= 0) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 72 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 10 <= main_~m~5) && 8 <= main_~k~5) && main_~i~5 <= 0)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && 16 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 6 && 10 <= main_~m~5) && 86 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || (98 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 8 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 79 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 10 <= main_~m~5 && main_~j~5 <= 2) && 52 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 5 && 10 <= main_~m~5) && 85 <= main_~k~5)) || ((main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 9) && 99 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 5) && 15 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && 27 <= main_~k~5) && main_~j~5 <= 7) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 46 <= main_~k~5) && main_~j~5 <= 6) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 0) && main_~i~5 <= 7)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 8) && 28 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 61 <= main_~k~5) && main_~j~5 <= 1 && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 66 <= main_~k~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 7) && 10 <= main_~m~5) && 37 <= main_~k~5)) || (((10 <= main_~n~5 && 53 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 3 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5) && main_~i~5 <= 5) && 60 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 8) && 38 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && main_~j~5 <= 0) && 30 <= main_~k~5)) || ((((10 <= main_~n~5 && main_~j~5 <= 3) && 43 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 4)) || ((((10 <= main_~n~5 && main_~j~5 <= 4) && 34 <= main_~k~5) && main_~i~5 <= 3) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && main_~j~5 <= 3 && 10 <= main_~m~5) && 83 <= main_~k~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 59 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9)) || ((((10 <= main_~n~5 && main_~j~5 <= 6) && main_~i~5 <= 3) && 36 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && 57 <= main_~k~5) && main_~j~5 <= 7 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 84 <= main_~k~5) && main_~j~5 <= 4 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 10 <= main_~m~5 && main_~j~5 <= 2) && main_~i~5 <= 6) && 62 <= main_~k~5)) || (((10 <= main_~n~5 && 56 <= main_~k~5) && main_~i~5 <= 5) && main_~j~5 <= 6 && 10 <= main_~m~5)) || ((((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~j~5 <= 0) && main_~i~5 <= 1)) || ((((10 <= main_~n~5 && main_~i~5 <= 2) && main_~j~5 <= 3) && 23 <= main_~k~5) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 76 <= main_~k~5) && main_~i~5 <= 7)) || ((main_~i~5 + 1 <= main_~n~5 && main_~j~5 <= 6 && 10 <= main_~m~5) && 96 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 3 && 10 <= main_~m~5) && 73 <= main_~k~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 5) && main_~j~5 <= 8 && 10 <= main_~m~5) && 58 <= main_~k~5)) || (((10 <= main_~n~5 && main_~j~5 <= 7 && 10 <= main_~m~5) && main_~i~5 <= 6) && 67 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0)) || (((10 <= main_~n~5 && 69 <= main_~k~5) && 10 <= main_~m~5 && main_~j~5 <= 9) && main_~i~5 <= 6)) || (100 <= main_~k~5 && main_~i~5 + 1 <= main_~n~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 65 <= main_~k~5) && main_~j~5 <= 5 && 10 <= main_~m~5) && main_~i~5 <= 6)) || ((((10 <= main_~n~5 && main_~i~5 <= 3) && main_~j~5 <= 1) && 10 <= main_~m~5) && 31 <= main_~k~5) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5)) || (100 <= main_~k~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 90 <= main_~k~5) && main_~i~5 <= 9) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((((((((10 <= main_~n~5 && 0 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 0) || (((10 <= main_~n~5 && 60 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 6)) || (((10 <= main_~n~5 && 50 <= main_~k~5) && main_~i~5 <= 5) && 10 <= main_~m~5)) || (100 <= main_~k~5 && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 20 <= main_~k~5) && main_~i~5 <= 2) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 90 <= main_~k~5) && main_~i~5 <= 9) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && main_~i~5 <= 8) && 10 <= main_~m~5) && 80 <= main_~k~5)) || (((10 <= main_~n~5 && 40 <= main_~k~5) && main_~i~5 <= 4) && 10 <= main_~m~5)) || (((10 <= main_~n~5 && 70 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 7)) || (((10 <= main_~n~5 && main_~i~5 <= 3) && 10 <= main_~m~5) && 30 <= main_~k~5)) || (((10 <= main_~n~5 && 10 <= main_~k~5) && 10 <= main_~m~5) && main_~i~5 <= 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. SAFE Result, 330.8s OverallTime, 18 OverallIterations, 110 TraceHistogramMax, 10.5s AutomataDifference, 0.0s DeadEndRemovalTime, 306.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 476 SDtfs, 769 SDslu, 1058 SDs, 0 SdLazy, 699 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1681 GetRequests, 1305 SyntacticMatches, 0 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245occurred in iteration=17, 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, 18 MinimizatonAttempts, 168 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10237 NumberOfFragments, 3839 HoareAnnotationTreeSize, 5 FomulaSimplifications, 6668782 FormulaSimplificationTreeSizeReduction, 145.2s HoareSimplificationTime, 5 FomulaSimplificationsInter, 252714 FormulaSimplificationTreeSizeReductionInter, 161.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 3048 NumberOfCodeBlocks, 2904 NumberOfCodeBlocksAsserted, 178 NumberOfCheckSat, 3015 ConstructedInterpolants, 0 QuantifiedInterpolants, 2256565 SizeOfPredicates, 30 NumberOfNonLiveVariables, 3673 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 33 InterpolantComputations, 3 PerfectInterpolantSequences, 29572/87282 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.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-59-25-223.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested.i_4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-59-25-223.csv Received shutdown request...