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/002c-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:08:04,885 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:08:04,888 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:08:04,904 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:08:04,905 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:08:04,906 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:08:04,907 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:08:04,910 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:08:04,912 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:08:04,913 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:08:04,914 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:08:04,914 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:08:04,915 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:08:04,917 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:08:04,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:08:04,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:08:04,928 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:08:04,931 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:08:04,934 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:08:04,935 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:08:04,936 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:08:04,938 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:08:04,938 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:08:04,939 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:08:04,944 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:08:04,945 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:08:04,946 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:08:04,947 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:08:04,947 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:08:04,950 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:08:04,951 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:08:04,952 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:08:04,952 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:08:04,953 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:08:04,953 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:08:04,954 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:08:04,978 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:08:04,979 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:08:04,979 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:08:04,979 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:08:04,980 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:08:04,980 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:08:04,981 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:08:04,981 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:08:04,982 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:08:04,982 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:08:04,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:08:04,982 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:08:04,982 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:08:04,983 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:08:04,983 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:08:04,983 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:08:04,983 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:08:04,983 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:08:04,984 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:08:04,986 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:08:04,986 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:08:05,026 INFO ]: Repository-Root is: /tmp [2018-06-22 11:08:05,043 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:08:05,050 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:08:05,052 INFO ]: Initializing SmtParser... [2018-06-22 11:08:05,052 INFO ]: SmtParser initialized [2018-06-22 11:08:05,053 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/002c-horn.smt2 [2018-06-22 11:08:05,055 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:08:05,150 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/002c-horn.smt2 unknown [2018-06-22 11:08:05,392 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/002c-horn.smt2 [2018-06-22 11:08:05,398 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:08:05,405 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:08:05,405 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:08:05,405 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:08:05,406 INFO ]: ChcToBoogie initialized [2018-06-22 11:08:05,411 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:08:05" (1/1) ... [2018-06-22 11:08:05,452 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:05 Unit [2018-06-22 11:08:05,452 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:08:05,452 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:08:05,453 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:08:05,453 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:08:05,474 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:05" (1/1) ... [2018-06-22 11:08:05,474 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:05" (1/1) ... [2018-06-22 11:08:05,481 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:05" (1/1) ... [2018-06-22 11:08:05,482 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:05" (1/1) ... [2018-06-22 11:08:05,486 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:05" (1/1) ... [2018-06-22 11:08:05,488 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:05" (1/1) ... [2018-06-22 11:08:05,489 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:05" (1/1) ... [2018-06-22 11:08:05,492 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:08:05,493 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:08:05,493 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:08:05,493 INFO ]: RCFGBuilder initialized [2018-06-22 11:08:05,495 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:05" (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:08:05,509 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:08:05,509 INFO ]: Found specification of procedure False [2018-06-22 11:08:05,509 INFO ]: Found implementation of procedure False [2018-06-22 11:08:05,509 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:08:05,509 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:08:05,509 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:08:05,509 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:08:05,509 INFO ]: Found specification of procedure REC__f [2018-06-22 11:08:05,509 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:08:05,509 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:08:05,510 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:08:05,510 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:08:05,510 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:08:05,510 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:08:05,510 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:08:05,971 INFO ]: Using library mode [2018-06-22 11:08:05,971 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:08:05 BoogieIcfgContainer [2018-06-22 11:08:05,971 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:08:05,982 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:08:05,982 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:08:05,985 INFO ]: TraceAbstraction initialized [2018-06-22 11:08:05,986 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:08:05" (1/3) ... [2018-06-22 11:08:05,987 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f46a849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:08:05, skipping insertion in model container [2018-06-22 11:08:05,987 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:08:05" (2/3) ... [2018-06-22 11:08:05,987 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f46a849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:08:05, skipping insertion in model container [2018-06-22 11:08:05,987 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:08:05" (3/3) ... [2018-06-22 11:08:05,989 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:08:06,000 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:08:06,013 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:08:06,058 INFO ]: Using default assertion order modulation [2018-06-22 11:08:06,059 INFO ]: Interprodecural is true [2018-06-22 11:08:06,059 INFO ]: Hoare is false [2018-06-22 11:08:06,059 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:08:06,059 INFO ]: Backedges is TWOTRACK [2018-06-22 11:08:06,059 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:08:06,059 INFO ]: Difference is false [2018-06-22 11:08:06,059 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:08:06,059 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:08:06,073 INFO ]: Start isEmpty. Operand 29 states. [2018-06-22 11:08:06,085 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:08:06,085 INFO ]: Found error trace [2018-06-22 11:08:06,086 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:08:06,086 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:06,090 INFO ]: Analyzing trace with hash 133636364, now seen corresponding path program 1 times [2018-06-22 11:08:06,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:06,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:06,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:06,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:06,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:06,141 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:06,164 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:08:06,166 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:06,166 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:08:06,168 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:08:06,179 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:08:06,180 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:08:06,182 INFO ]: Start difference. First operand 29 states. Second operand 2 states. [2018-06-22 11:08:06,204 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:06,204 INFO ]: Finished difference Result 25 states and 44 transitions. [2018-06-22 11:08:06,204 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:08:06,205 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:08:06,205 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:06,221 INFO ]: With dead ends: 25 [2018-06-22 11:08:06,221 INFO ]: Without dead ends: 25 [2018-06-22 11:08:06,224 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:08:06,238 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:08:06,264 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-22 11:08:06,265 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:08:06,266 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. [2018-06-22 11:08:06,267 INFO ]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 5 [2018-06-22 11:08:06,267 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:06,267 INFO ]: Abstraction has 25 states and 44 transitions. [2018-06-22 11:08:06,267 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:08:06,267 INFO ]: Start isEmpty. Operand 25 states and 44 transitions. [2018-06-22 11:08:06,270 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:08:06,270 INFO ]: Found error trace [2018-06-22 11:08:06,270 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:06,270 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:06,270 INFO ]: Analyzing trace with hash -2022419729, now seen corresponding path program 1 times [2018-06-22 11:08:06,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:06,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:06,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:06,271 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:06,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:06,296 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:06,361 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:08:06,361 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:06,361 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:06,363 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:06,363 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:06,363 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:06,363 INFO ]: Start difference. First operand 25 states and 44 transitions. Second operand 4 states. [2018-06-22 11:08:06,457 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:06,457 INFO ]: Finished difference Result 29 states and 52 transitions. [2018-06-22 11:08:06,457 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:06,457 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:08:06,458 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:06,459 INFO ]: With dead ends: 29 [2018-06-22 11:08:06,459 INFO ]: Without dead ends: 29 [2018-06-22 11:08:06,459 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:08:06,460 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:08:06,470 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-22 11:08:06,470 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:08:06,471 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 50 transitions. [2018-06-22 11:08:06,472 INFO ]: Start accepts. Automaton has 27 states and 50 transitions. Word has length 9 [2018-06-22 11:08:06,472 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:06,472 INFO ]: Abstraction has 27 states and 50 transitions. [2018-06-22 11:08:06,472 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:06,472 INFO ]: Start isEmpty. Operand 27 states and 50 transitions. [2018-06-22 11:08:06,473 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:08:06,473 INFO ]: Found error trace [2018-06-22 11:08:06,473 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:06,473 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:06,473 INFO ]: Analyzing trace with hash -2032656528, now seen corresponding path program 1 times [2018-06-22 11:08:06,473 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:06,473 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:06,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:06,474 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:06,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:06,483 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:06,593 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:08:06,593 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:06,593 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:06,594 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:06,594 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:06,594 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:06,594 INFO ]: Start difference. First operand 27 states and 50 transitions. Second operand 4 states. [2018-06-22 11:08:06,681 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:06,681 INFO ]: Finished difference Result 31 states and 54 transitions. [2018-06-22 11:08:06,683 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:06,683 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:08:06,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:06,684 INFO ]: With dead ends: 31 [2018-06-22 11:08:06,684 INFO ]: Without dead ends: 31 [2018-06-22 11:08:06,684 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:08:06,685 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:08:06,692 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 11:08:06,692 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:08:06,696 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 52 transitions. [2018-06-22 11:08:06,696 INFO ]: Start accepts. Automaton has 29 states and 52 transitions. Word has length 9 [2018-06-22 11:08:06,697 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:06,697 INFO ]: Abstraction has 29 states and 52 transitions. [2018-06-22 11:08:06,697 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:06,697 INFO ]: Start isEmpty. Operand 29 states and 52 transitions. [2018-06-22 11:08:06,699 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:08:06,699 INFO ]: Found error trace [2018-06-22 11:08:06,699 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:06,699 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:06,700 INFO ]: Analyzing trace with hash -1918139924, now seen corresponding path program 1 times [2018-06-22 11:08:06,700 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:06,700 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:06,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:06,701 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:06,701 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:06,710 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:06,804 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:08:06,804 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:06,804 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:06,804 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:06,804 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:06,804 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:06,804 INFO ]: Start difference. First operand 29 states and 52 transitions. Second operand 4 states. [2018-06-22 11:08:06,856 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:06,856 INFO ]: Finished difference Result 33 states and 56 transitions. [2018-06-22 11:08:06,856 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:06,856 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:08:06,856 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:06,858 INFO ]: With dead ends: 33 [2018-06-22 11:08:06,858 INFO ]: Without dead ends: 33 [2018-06-22 11:08:06,858 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:08:06,858 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:08:06,865 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-06-22 11:08:06,865 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:08:06,866 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 52 transitions. [2018-06-22 11:08:06,866 INFO ]: Start accepts. Automaton has 29 states and 52 transitions. Word has length 9 [2018-06-22 11:08:06,866 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:06,866 INFO ]: Abstraction has 29 states and 52 transitions. [2018-06-22 11:08:06,866 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:06,866 INFO ]: Start isEmpty. Operand 29 states and 52 transitions. [2018-06-22 11:08:06,867 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:08:06,867 INFO ]: Found error trace [2018-06-22 11:08:06,868 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:06,868 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:06,868 INFO ]: Analyzing trace with hash 1718356899, now seen corresponding path program 1 times [2018-06-22 11:08:06,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:06,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:06,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:06,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:06,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:06,882 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:06,921 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:08:06,921 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:06,921 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:06,921 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:06,921 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:06,921 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:06,921 INFO ]: Start difference. First operand 29 states and 52 transitions. Second operand 4 states. [2018-06-22 11:08:07,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:07,068 INFO ]: Finished difference Result 33 states and 56 transitions. [2018-06-22 11:08:07,068 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:07,068 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:08:07,068 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:07,069 INFO ]: With dead ends: 33 [2018-06-22 11:08:07,069 INFO ]: Without dead ends: 33 [2018-06-22 11:08:07,070 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:08:07,070 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:08:07,080 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-06-22 11:08:07,080 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:08:07,084 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 52 transitions. [2018-06-22 11:08:07,084 INFO ]: Start accepts. Automaton has 29 states and 52 transitions. Word has length 9 [2018-06-22 11:08:07,085 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:07,085 INFO ]: Abstraction has 29 states and 52 transitions. [2018-06-22 11:08:07,085 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:07,085 INFO ]: Start isEmpty. Operand 29 states and 52 transitions. [2018-06-22 11:08:07,086 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:08:07,086 INFO ]: Found error trace [2018-06-22 11:08:07,086 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:07,086 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:07,086 INFO ]: Analyzing trace with hash -435983086, now seen corresponding path program 1 times [2018-06-22 11:08:07,086 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:07,086 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:07,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:07,089 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:07,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:07,099 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:08:07,272 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:08:07,272 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:08:07,272 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:08:07,272 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:08:07,272 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:08:07,272 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:07,273 INFO ]: Start difference. First operand 29 states and 52 transitions. Second operand 4 states. [2018-06-22 11:08:07,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:08:07,390 INFO ]: Finished difference Result 31 states and 53 transitions. [2018-06-22 11:08:07,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:08:07,392 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:08:07,392 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:08:07,393 INFO ]: With dead ends: 31 [2018-06-22 11:08:07,393 INFO ]: Without dead ends: 31 [2018-06-22 11:08:07,393 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:08:07,393 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:08:07,404 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 11:08:07,404 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:08:07,405 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 51 transitions. [2018-06-22 11:08:07,405 INFO ]: Start accepts. Automaton has 29 states and 51 transitions. Word has length 9 [2018-06-22 11:08:07,405 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:08:07,405 INFO ]: Abstraction has 29 states and 51 transitions. [2018-06-22 11:08:07,405 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:08:07,405 INFO ]: Start isEmpty. Operand 29 states and 51 transitions. [2018-06-22 11:08:07,406 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:08:07,406 INFO ]: Found error trace [2018-06-22 11:08:07,406 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:08:07,406 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:08:07,406 INFO ]: Analyzing trace with hash -1851357229, now seen corresponding path program 1 times [2018-06-22 11:08:07,406 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:08:07,406 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:08:07,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:07,407 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:08:07,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:08:07,413 INFO ]: Conjunction of SSA is sat [2018-06-22 11:08:07,414 INFO ]: Counterexample might be feasible [2018-06-22 11:08:07,430 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:08:07 BoogieIcfgContainer [2018-06-22 11:08:07,430 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:08:07,431 INFO ]: Toolchain (without parser) took 2032.92 ms. Allocated memory is still 302.5 MB. Free memory was 255.9 MB in the beginning and 189.9 MB in the end (delta: 66.0 MB). Peak memory consumption was 66.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:08:07,437 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.5 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:08:07,437 INFO ]: ChcToBoogie took 46.80 ms. Allocated memory is still 302.5 MB. Free memory was 255.9 MB in the beginning and 253.9 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:08:07,438 INFO ]: Boogie Preprocessor took 39.74 ms. Allocated memory is still 302.5 MB. Free memory was 253.9 MB in the beginning and 252.9 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:08:07,439 INFO ]: RCFGBuilder took 478.64 ms. Allocated memory is still 302.5 MB. Free memory was 252.9 MB in the beginning and 239.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:08:07,439 INFO ]: TraceAbstraction took 1448.85 ms. Allocated memory is still 302.5 MB. Free memory was 239.9 MB in the beginning and 189.9 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:08:07,445 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 302.5 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 46.80 ms. Allocated memory is still 302.5 MB. Free memory was 255.9 MB in the beginning and 253.9 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.74 ms. Allocated memory is still 302.5 MB. Free memory was 253.9 MB in the beginning and 252.9 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 478.64 ms. Allocated memory is still 302.5 MB. Free memory was 252.9 MB in the beginning and 239.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 1448.85 ms. Allocated memory is still 302.5 MB. Free memory was 239.9 MB in the beginning and 189.9 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call False(); [L0] assume (((((((!(hbv_False_2_Int == 0) && hbv_False_1_Int + -2 == 0) && hbv_False_2_Int + -1 == hbv_False_5_Int) && hbv_False_3_Int == hbv_False_6_Int) && !(hbv_False_7_Int == hbv_False_6_Int)) && !(hbv_False_1_Int == 0)) && hbv_False_2_Int == hbv_False_1_Int) && hbv_False_3_Int + 1 == hbv_False_4_Int) && !(hbv_False_1_Int + -1 == 0); [L0] CALL call REC_f_(hbv_False_5_Int, hbv_False_4_Int, hbv_False_7_Int); [L0] assume (!(hhv_REC_f__0_Int == 0) && hhv_REC_f__0_Int + -1 == hbv_REC_f__1_Int) && hhv_REC_f__1_Int + 1 == hbv_REC_f__2_Int; [L0] CALL call REC_f_(hbv_REC_f__1_Int, hbv_REC_f__2_Int, hhv_REC_f__2_Int); [L0] assume hhv_REC_f__2_Int == hhv_REC_f__1_Int && hhv_REC_f__0_Int == 0; [L0] RET call REC_f_(hbv_REC_f__1_Int, hbv_REC_f__2_Int, hhv_REC_f__2_Int); [L0] RET call REC_f_(hbv_False_5_Int, hbv_False_4_Int, hbv_False_7_Int); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. UNSAFE Result, 1.3s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 264 SDtfs, 5 SDslu, 369 SDs, 0 SdLazy, 80 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, 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, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 944 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/002c-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-08-07-469.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/002c-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-08-07-469.csv Received shutdown request...