java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/014-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:17:10,788 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:17:10,790 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:17:10,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:17:10,801 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:17:10,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:17:10,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:17:10,810 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:17:10,812 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:17:10,812 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:17:10,815 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:17:10,815 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:17:10,816 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:17:10,817 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:17:10,818 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:17:10,818 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:17:10,821 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:17:10,823 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:17:10,832 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:17:10,833 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:17:10,834 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:17:10,836 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:17:10,836 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:17:10,836 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:17:10,839 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:17:10,840 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:17:10,841 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:17:10,841 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:17:10,842 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:17:10,842 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:17:10,843 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:17:10,844 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:17:10,844 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:17:10,845 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:17:10,845 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:17:10,845 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:17:10,858 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:17:10,858 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:17:10,858 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:17:10,859 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:17:10,859 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:17:10,860 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:17:10,860 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:17:10,860 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:17:10,860 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:17:10,860 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:17:10,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:17:10,861 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:17:10,861 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:17:10,861 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:17:10,861 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:17:10,861 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:17:10,861 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:17:10,862 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:17:10,862 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:17:10,863 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:17:10,863 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:17:10,912 INFO ]: Repository-Root is: /tmp [2018-06-22 11:17:10,930 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:17:10,935 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:17:10,937 INFO ]: Initializing SmtParser... [2018-06-22 11:17:10,937 INFO ]: SmtParser initialized [2018-06-22 11:17:10,937 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/014-horn.smt2 [2018-06-22 11:17:10,939 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:17:11,025 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014-horn.smt2 unknown [2018-06-22 11:17:11,203 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/014-horn.smt2 [2018-06-22 11:17:11,213 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:17:11,219 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:17:11,219 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:17:11,220 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:17:11,220 INFO ]: ChcToBoogie initialized [2018-06-22 11:17:11,223 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:17:11" (1/1) ... [2018-06-22 11:17:11,263 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:11 Unit [2018-06-22 11:17:11,263 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:17:11,264 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:17:11,264 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:17:11,264 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:17:11,288 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:11" (1/1) ... [2018-06-22 11:17:11,288 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:11" (1/1) ... [2018-06-22 11:17:11,295 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:11" (1/1) ... [2018-06-22 11:17:11,295 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:11" (1/1) ... [2018-06-22 11:17:11,297 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:11" (1/1) ... [2018-06-22 11:17:11,300 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:11" (1/1) ... [2018-06-22 11:17:11,301 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:11" (1/1) ... [2018-06-22 11:17:11,304 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:17:11,304 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:17:11,304 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:17:11,304 INFO ]: RCFGBuilder initialized [2018-06-22 11:17:11,305 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:11" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:17:11,321 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:17:11,321 INFO ]: Found specification of procedure False [2018-06-22 11:17:11,321 INFO ]: Found implementation of procedure False [2018-06-22 11:17:11,321 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:17:11,321 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:17:11,321 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:17:11,321 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:17:11,321 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:17:11,321 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:17:11,321 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:17:11,321 INFO ]: Found specification of procedure REC__f [2018-06-22 11:17:11,321 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:17:11,321 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:17:11,321 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:17:11,321 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:17:11,790 INFO ]: Using library mode [2018-06-22 11:17:11,791 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:17:11 BoogieIcfgContainer [2018-06-22 11:17:11,791 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:17:11,792 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:17:11,792 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:17:11,795 INFO ]: TraceAbstraction initialized [2018-06-22 11:17:11,795 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:17:11" (1/3) ... [2018-06-22 11:17:11,797 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7292c3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:17:11, skipping insertion in model container [2018-06-22 11:17:11,797 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:11" (2/3) ... [2018-06-22 11:17:11,798 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7292c3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:17:11, skipping insertion in model container [2018-06-22 11:17:11,798 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:17:11" (3/3) ... [2018-06-22 11:17:11,799 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:17:11,809 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:17:11,815 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:17:11,852 INFO ]: Using default assertion order modulation [2018-06-22 11:17:11,853 INFO ]: Interprodecural is true [2018-06-22 11:17:11,853 INFO ]: Hoare is false [2018-06-22 11:17:11,853 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:17:11,853 INFO ]: Backedges is TWOTRACK [2018-06-22 11:17:11,853 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:17:11,853 INFO ]: Difference is false [2018-06-22 11:17:11,853 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:17:11,853 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:17:11,866 INFO ]: Start isEmpty. Operand 25 states. [2018-06-22 11:17:11,879 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:17:11,880 INFO ]: Found error trace [2018-06-22 11:17:11,880 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:17:11,881 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:11,885 INFO ]: Analyzing trace with hash 88883971, now seen corresponding path program 1 times [2018-06-22 11:17:11,886 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:11,887 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:11,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:11,928 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:11,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:11,942 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:11,962 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:11,963 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:11,963 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:17:11,964 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:17:11,975 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:17:11,976 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:17:11,978 INFO ]: Start difference. First operand 25 states. Second operand 2 states. [2018-06-22 11:17:11,999 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:11,999 INFO ]: Finished difference Result 22 states and 31 transitions. [2018-06-22 11:17:11,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:17:12,001 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:17:12,001 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:12,012 INFO ]: With dead ends: 22 [2018-06-22 11:17:12,012 INFO ]: Without dead ends: 22 [2018-06-22 11:17:12,013 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:17:12,028 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:17:12,059 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-22 11:17:12,060 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:17:12,061 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-06-22 11:17:12,062 INFO ]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 5 [2018-06-22 11:17:12,062 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:12,062 INFO ]: Abstraction has 22 states and 31 transitions. [2018-06-22 11:17:12,062 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:17:12,062 INFO ]: Start isEmpty. Operand 22 states and 31 transitions. [2018-06-22 11:17:12,064 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:17:12,064 INFO ]: Found error trace [2018-06-22 11:17:12,064 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:12,064 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:12,064 INFO ]: Analyzing trace with hash -1073856975, now seen corresponding path program 1 times [2018-06-22 11:17:12,064 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:12,064 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:12,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:12,065 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:12,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:12,098 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:12,152 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:12,153 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:12,153 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:12,154 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:12,154 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:12,155 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:12,155 INFO ]: Start difference. First operand 22 states and 31 transitions. Second operand 4 states. [2018-06-22 11:17:12,199 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:12,200 INFO ]: Finished difference Result 26 states and 35 transitions. [2018-06-22 11:17:12,200 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:12,200 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:17:12,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:12,201 INFO ]: With dead ends: 26 [2018-06-22 11:17:12,201 INFO ]: Without dead ends: 26 [2018-06-22 11:17:12,202 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:12,202 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:17:12,208 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-06-22 11:17:12,209 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:17:12,210 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-06-22 11:17:12,210 INFO ]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 9 [2018-06-22 11:17:12,211 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:12,211 INFO ]: Abstraction has 24 states and 33 transitions. [2018-06-22 11:17:12,211 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:12,211 INFO ]: Start isEmpty. Operand 24 states and 33 transitions. [2018-06-22 11:17:12,212 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:17:12,212 INFO ]: Found error trace [2018-06-22 11:17:12,212 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:12,212 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:12,212 INFO ]: Analyzing trace with hash -1182168541, now seen corresponding path program 1 times [2018-06-22 11:17:12,212 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:12,212 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:12,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:12,214 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:12,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:12,221 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:12,287 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:12,287 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:12,287 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:12,288 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:12,288 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:12,288 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:12,288 INFO ]: Start difference. First operand 24 states and 33 transitions. Second operand 4 states. [2018-06-22 11:17:12,328 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:12,328 INFO ]: Finished difference Result 28 states and 38 transitions. [2018-06-22 11:17:12,329 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:12,329 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:17:12,329 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:12,330 INFO ]: With dead ends: 28 [2018-06-22 11:17:12,330 INFO ]: Without dead ends: 28 [2018-06-22 11:17:12,330 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:12,330 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:17:12,336 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-06-22 11:17:12,337 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:17:12,337 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2018-06-22 11:17:12,338 INFO ]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 9 [2018-06-22 11:17:12,338 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:12,338 INFO ]: Abstraction has 26 states and 36 transitions. [2018-06-22 11:17:12,338 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:12,338 INFO ]: Start isEmpty. Operand 26 states and 36 transitions. [2018-06-22 11:17:12,339 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:12,339 INFO ]: Found error trace [2018-06-22 11:17:12,339 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:12,339 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:12,339 INFO ]: Analyzing trace with hash 1760339025, now seen corresponding path program 1 times [2018-06-22 11:17:12,339 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:12,339 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:12,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:12,340 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:12,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:12,353 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:12,583 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:12,583 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:12,583 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:17:12,583 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:17:12,583 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:17:12,583 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:17:12,583 INFO ]: Start difference. First operand 26 states and 36 transitions. Second operand 6 states. [2018-06-22 11:17:12,952 WARN ]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 11:17:13,092 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:13,092 INFO ]: Finished difference Result 32 states and 43 transitions. [2018-06-22 11:17:13,094 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:17:13,094 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:17:13,094 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:13,095 INFO ]: With dead ends: 32 [2018-06-22 11:17:13,095 INFO ]: Without dead ends: 32 [2018-06-22 11:17:13,096 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:17:13,096 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:17:13,103 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-06-22 11:17:13,103 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:17:13,104 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2018-06-22 11:17:13,104 INFO ]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 13 [2018-06-22 11:17:13,104 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:13,104 INFO ]: Abstraction has 26 states and 36 transitions. [2018-06-22 11:17:13,104 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:17:13,105 INFO ]: Start isEmpty. Operand 26 states and 36 transitions. [2018-06-22 11:17:13,105 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:13,105 INFO ]: Found error trace [2018-06-22 11:17:13,105 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:13,106 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:13,106 INFO ]: Analyzing trace with hash -1526428449, now seen corresponding path program 1 times [2018-06-22 11:17:13,106 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:13,106 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:13,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:13,106 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:13,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:13,115 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:13,202 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:13,203 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:13,203 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:17:13,209 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:13,231 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:13,237 INFO ]: Computing forward predicates... [2018-06-22 11:17:13,390 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:13,415 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:13,415 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:17:13,415 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:17:13,415 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:17:13,415 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:17:13,415 INFO ]: Start difference. First operand 26 states and 36 transitions. Second operand 8 states. [2018-06-22 11:17:13,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:13,554 INFO ]: Finished difference Result 36 states and 47 transitions. [2018-06-22 11:17:13,554 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:17:13,554 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:17:13,554 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:13,555 INFO ]: With dead ends: 36 [2018-06-22 11:17:13,555 INFO ]: Without dead ends: 36 [2018-06-22 11:17:13,556 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:17:13,556 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:17:13,561 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-06-22 11:17:13,561 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:17:13,562 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2018-06-22 11:17:13,562 INFO ]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 13 [2018-06-22 11:17:13,562 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:13,563 INFO ]: Abstraction has 28 states and 38 transitions. [2018-06-22 11:17:13,563 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:17:13,563 INFO ]: Start isEmpty. Operand 28 states and 38 transitions. [2018-06-22 11:17:13,563 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:13,563 INFO ]: Found error trace [2018-06-22 11:17:13,563 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:13,564 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:13,564 INFO ]: Analyzing trace with hash 784686213, now seen corresponding path program 1 times [2018-06-22 11:17:13,564 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:13,564 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:13,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:13,565 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:13,565 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:13,570 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:13,591 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:13,591 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:13,591 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:13,591 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:13,592 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:13,592 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:13,592 INFO ]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2018-06-22 11:17:13,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:13,605 INFO ]: Finished difference Result 28 states and 37 transitions. [2018-06-22 11:17:13,606 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:13,606 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:17:13,606 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:13,607 INFO ]: With dead ends: 28 [2018-06-22 11:17:13,607 INFO ]: Without dead ends: 27 [2018-06-22 11:17:13,607 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:13,607 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:17:13,611 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 11:17:13,611 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:17:13,612 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-06-22 11:17:13,612 INFO ]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 13 [2018-06-22 11:17:13,612 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:13,612 INFO ]: Abstraction has 27 states and 35 transitions. [2018-06-22 11:17:13,612 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:13,612 INFO ]: Start isEmpty. Operand 27 states and 35 transitions. [2018-06-22 11:17:13,613 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:13,613 INFO ]: Found error trace [2018-06-22 11:17:13,613 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:13,613 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:13,613 INFO ]: Analyzing trace with hash -407121153, now seen corresponding path program 1 times [2018-06-22 11:17:13,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:13,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:13,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:13,615 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:13,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:13,645 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:14,220 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:14,220 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:14,220 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:17:14,229 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:14,244 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:14,248 INFO ]: Computing forward predicates... [2018-06-22 11:17:14,460 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:14,486 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:14,486 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:17:14,486 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:17:14,486 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:17:14,486 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:17:14,486 INFO ]: Start difference. First operand 27 states and 35 transitions. Second operand 14 states. [2018-06-22 11:17:15,034 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:15,034 INFO ]: Finished difference Result 35 states and 44 transitions. [2018-06-22 11:17:15,034 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:17:15,034 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 11:17:15,035 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:15,035 INFO ]: With dead ends: 35 [2018-06-22 11:17:15,035 INFO ]: Without dead ends: 35 [2018-06-22 11:17:15,036 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:17:15,036 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:17:15,040 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-06-22 11:17:15,040 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:17:15,041 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-06-22 11:17:15,041 INFO ]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 17 [2018-06-22 11:17:15,042 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:15,042 INFO ]: Abstraction has 29 states and 37 transitions. [2018-06-22 11:17:15,042 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:17:15,042 INFO ]: Start isEmpty. Operand 29 states and 37 transitions. [2018-06-22 11:17:15,042 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:15,042 INFO ]: Found error trace [2018-06-22 11:17:15,042 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:15,042 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:15,043 INFO ]: Analyzing trace with hash 2105266189, now seen corresponding path program 2 times [2018-06-22 11:17:15,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:15,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:15,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:15,043 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:15,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:15,060 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:15,150 INFO ]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:17:15,150 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:15,150 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:17:15,164 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:17:15,186 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:17:15,186 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:15,188 INFO ]: Computing forward predicates... [2018-06-22 11:17:15,262 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:15,284 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:15,284 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:17:15,285 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:17:15,285 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:17:15,285 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:17:15,285 INFO ]: Start difference. First operand 29 states and 37 transitions. Second operand 11 states. [2018-06-22 11:17:15,579 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:15,579 INFO ]: Finished difference Result 43 states and 52 transitions. [2018-06-22 11:17:15,579 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:17:15,579 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:17:15,579 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:15,580 INFO ]: With dead ends: 43 [2018-06-22 11:17:15,580 INFO ]: Without dead ends: 26 [2018-06-22 11:17:15,580 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:17:15,580 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:17:15,584 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-06-22 11:17:15,584 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:17:15,584 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-06-22 11:17:15,584 INFO ]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17 [2018-06-22 11:17:15,584 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:15,584 INFO ]: Abstraction has 24 states and 28 transitions. [2018-06-22 11:17:15,584 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:17:15,584 INFO ]: Start isEmpty. Operand 24 states and 28 transitions. [2018-06-22 11:17:15,585 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:15,585 INFO ]: Found error trace [2018-06-22 11:17:15,585 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:15,585 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:15,585 INFO ]: Analyzing trace with hash -1706602957, now seen corresponding path program 1 times [2018-06-22 11:17:15,585 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:15,585 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:15,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:15,586 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:15,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:15,591 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:15,640 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:15,640 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:15,640 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:17:15,640 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:17:15,640 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:17:15,640 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:17:15,640 INFO ]: Start difference. First operand 24 states and 28 transitions. Second operand 6 states. [2018-06-22 11:17:15,679 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:15,680 INFO ]: Finished difference Result 26 states and 30 transitions. [2018-06-22 11:17:15,680 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:17:15,680 INFO ]: Start accepts. Automaton has 6 states. Word has length 17 [2018-06-22 11:17:15,680 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:15,681 INFO ]: With dead ends: 26 [2018-06-22 11:17:15,681 INFO ]: Without dead ends: 26 [2018-06-22 11:17:15,681 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:17:15,681 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:17:15,684 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-06-22 11:17:15,684 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:17:15,685 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-06-22 11:17:15,685 INFO ]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17 [2018-06-22 11:17:15,685 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:15,685 INFO ]: Abstraction has 24 states and 28 transitions. [2018-06-22 11:17:15,685 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:17:15,685 INFO ]: Start isEmpty. Operand 24 states and 28 transitions. [2018-06-22 11:17:15,686 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:17:15,686 INFO ]: Found error trace [2018-06-22 11:17:15,686 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:15,686 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:15,686 INFO ]: Analyzing trace with hash 27882593, now seen corresponding path program 1 times [2018-06-22 11:17:15,686 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:15,686 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:15,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:15,687 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:15,687 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:15,696 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:15,898 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:17:15,898 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:15,898 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:17:15,899 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:17:15,899 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:17:15,899 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:17:15,899 INFO ]: Start difference. First operand 24 states and 28 transitions. Second operand 7 states. [2018-06-22 11:17:15,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:15,992 INFO ]: Finished difference Result 28 states and 32 transitions. [2018-06-22 11:17:15,993 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:17:15,993 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:17:15,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:15,993 INFO ]: With dead ends: 28 [2018-06-22 11:17:15,993 INFO ]: Without dead ends: 21 [2018-06-22 11:17:15,993 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:17:15,993 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:17:15,995 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 11:17:15,995 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:17:15,995 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-22 11:17:15,995 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 21 [2018-06-22 11:17:15,995 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:15,995 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-22 11:17:15,995 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:17:15,995 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-22 11:17:15,996 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:17:15,996 INFO ]: Found error trace [2018-06-22 11:17:15,996 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:15,996 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:15,996 INFO ]: Analyzing trace with hash 592047579, now seen corresponding path program 2 times [2018-06-22 11:17:15,996 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:15,996 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:15,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:15,999 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:15,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:16,014 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:16,494 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:17:16,494 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:16,494 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-22 11:17:16,501 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:17:16,517 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:17:16,517 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:16,520 INFO ]: Computing forward predicates... [2018-06-22 11:17:16,779 INFO ]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:17:16,800 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:16,800 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-06-22 11:17:16,800 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:17:16,801 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:17:16,801 INFO ]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:17:16,801 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 21 states. [2018-06-22 11:17:17,259 WARN ]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2018-06-22 11:17:17,531 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:17,531 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-22 11:17:17,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:17:17,531 INFO ]: Start accepts. Automaton has 21 states. Word has length 25 [2018-06-22 11:17:17,531 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:17,531 INFO ]: With dead ends: 19 [2018-06-22 11:17:17,531 INFO ]: Without dead ends: 0 [2018-06-22 11:17:17,532 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:17:17,532 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:17:17,532 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:17:17,532 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:17:17,532 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:17:17,532 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-06-22 11:17:17,532 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:17,532 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:17:17,532 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:17:17,532 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:17:17,532 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:17:17,536 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:17:17 BoogieIcfgContainer [2018-06-22 11:17:17,536 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:17:17,537 INFO ]: Toolchain (without parser) took 6323.73 ms. Allocated memory was 304.1 MB in the beginning and 367.0 MB in the end (delta: 62.9 MB). Free memory was 259.5 MB in the beginning and 288.1 MB in the end (delta: -28.6 MB). Peak memory consumption was 34.3 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:17,538 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:17:17,538 INFO ]: ChcToBoogie took 44.48 ms. Allocated memory is still 304.1 MB. Free memory was 259.5 MB in the beginning and 257.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:17,538 INFO ]: Boogie Preprocessor took 39.39 ms. Allocated memory is still 304.1 MB. Free memory was 257.5 MB in the beginning and 256.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 11:17:17,539 INFO ]: RCFGBuilder took 486.35 ms. Allocated memory is still 304.1 MB. Free memory was 256.5 MB in the beginning and 247.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:17,540 INFO ]: TraceAbstraction took 5744.68 ms. Allocated memory was 304.1 MB in the beginning and 367.0 MB in the end (delta: 62.9 MB). Free memory was 246.5 MB in the beginning and 288.1 MB in the end (delta: -41.6 MB). Peak memory consumption was 21.3 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:17,543 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 304.1 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 44.48 ms. Allocated memory is still 304.1 MB. Free memory was 259.5 MB in the beginning and 257.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.39 ms. Allocated memory is still 304.1 MB. Free memory was 257.5 MB in the beginning and 256.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 486.35 ms. Allocated memory is still 304.1 MB. Free memory was 256.5 MB in the beginning and 247.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 5744.68 ms. Allocated memory was 304.1 MB in the beginning and 367.0 MB in the end (delta: 62.9 MB). Free memory was 246.5 MB in the beginning and 288.1 MB in the end (delta: -41.6 MB). Peak memory consumption was 21.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. SAFE Result, 5.6s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 305 SDtfs, 53 SDslu, 1039 SDs, 0 SdLazy, 494 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 24544 SizeOfPredicates, 44 NumberOfNonLiveVariables, 320 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 37/86 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/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-17-17-554.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/014-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-17-17-554.csv Received shutdown request...