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_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/002d-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:19:31,645 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:19:31,647 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:19:31,659 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:19:31,660 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:19:31,660 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:19:31,662 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:19:31,666 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:19:31,668 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:19:31,669 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:19:31,669 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:19:31,671 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:19:31,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:19:31,673 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:19:31,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:19:31,675 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:19:31,677 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:19:31,681 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:19:31,682 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:19:31,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:19:31,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:19:31,699 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:19:31,699 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:19:31,699 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:19:31,700 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:19:31,701 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:19:31,701 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:19:31,702 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:19:31,708 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:19:31,708 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:19:31,709 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:19:31,710 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:19:31,710 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:19:31,710 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:19:31,711 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:19:31,711 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:19:31,730 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:19:31,730 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:19:31,731 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:19:31,731 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:19:31,732 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:19:31,732 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:19:31,732 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:19:31,732 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:19:31,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:19:31,733 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:19:31,733 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:19:31,733 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:19:31,733 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:19:31,734 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:19:31,734 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:19:31,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:19:31,734 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:19:31,739 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:19:31,739 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:19:31,787 INFO ]: Repository-Root is: /tmp [2018-06-22 01:19:31,803 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:19:31,808 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:19:31,810 INFO ]: Initializing SmtParser... [2018-06-22 01:19:31,810 INFO ]: SmtParser initialized [2018-06-22 01:19:31,811 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/002d-horn.smt2 [2018-06-22 01:19:31,812 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 01:19:31,899 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/002d-horn.smt2 unknown [2018-06-22 01:19:32,151 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/002d-horn.smt2 [2018-06-22 01:19:32,158 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:19:32,164 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:19:32,165 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:19:32,165 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:19:32,165 INFO ]: ChcToBoogie initialized [2018-06-22 01:19:32,170 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:19:32" (1/1) ... [2018-06-22 01:19:32,241 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:32 Unit [2018-06-22 01:19:32,242 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:19:32,243 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:19:32,243 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:19:32,243 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:19:32,266 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:32" (1/1) ... [2018-06-22 01:19:32,267 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:32" (1/1) ... [2018-06-22 01:19:32,274 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:32" (1/1) ... [2018-06-22 01:19:32,274 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:32" (1/1) ... [2018-06-22 01:19:32,287 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:32" (1/1) ... [2018-06-22 01:19:32,290 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:32" (1/1) ... [2018-06-22 01:19:32,292 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:32" (1/1) ... [2018-06-22 01:19:32,294 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:19:32,295 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:19:32,295 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:19:32,295 INFO ]: RCFGBuilder initialized [2018-06-22 01:19:32,296 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:32" (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 01:19:32,311 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:19:32,312 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:19:32,312 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:19:32,312 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:19:32,312 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:19:32,312 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 01:19:32,815 INFO ]: Using library mode [2018-06-22 01:19:32,816 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:19:32 BoogieIcfgContainer [2018-06-22 01:19:32,816 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:19:32,817 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:19:32,817 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:19:32,821 INFO ]: TraceAbstraction initialized [2018-06-22 01:19:32,821 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:19:32" (1/3) ... [2018-06-22 01:19:32,822 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516227df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:19:32, skipping insertion in model container [2018-06-22 01:19:32,822 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:32" (2/3) ... [2018-06-22 01:19:32,822 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516227df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:19:32, skipping insertion in model container [2018-06-22 01:19:32,822 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:19:32" (3/3) ... [2018-06-22 01:19:32,824 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:19:32,834 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:19:32,844 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:19:32,889 INFO ]: Using default assertion order modulation [2018-06-22 01:19:32,889 INFO ]: Interprodecural is true [2018-06-22 01:19:32,889 INFO ]: Hoare is false [2018-06-22 01:19:32,889 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:19:32,889 INFO ]: Backedges is TWOTRACK [2018-06-22 01:19:32,889 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:19:32,889 INFO ]: Difference is false [2018-06-22 01:19:32,889 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:19:32,889 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:19:32,903 INFO ]: Start isEmpty. Operand 12 states. [2018-06-22 01:19:32,913 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-22 01:19:32,913 INFO ]: Found error trace [2018-06-22 01:19:32,914 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-22 01:19:32,914 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:32,919 INFO ]: Analyzing trace with hash -1202708976, now seen corresponding path program 1 times [2018-06-22 01:19:32,921 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:32,922 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:32,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:32,958 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:32,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:32,995 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:33,035 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:33,037 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:33,038 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:19:33,040 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:19:33,058 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:19:33,059 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:19:33,061 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-22 01:19:33,083 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:33,083 INFO ]: Finished difference Result 10 states and 22 transitions. [2018-06-22 01:19:33,083 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:19:33,085 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-22 01:19:33,085 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:33,096 INFO ]: With dead ends: 10 [2018-06-22 01:19:33,096 INFO ]: Without dead ends: 10 [2018-06-22 01:19:33,097 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 01:19:33,111 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:19:33,125 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:19:33,127 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:19:33,127 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2018-06-22 01:19:33,128 INFO ]: Start accepts. Automaton has 10 states and 22 transitions. Word has length 6 [2018-06-22 01:19:33,129 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:33,129 INFO ]: Abstraction has 10 states and 22 transitions. [2018-06-22 01:19:33,129 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:19:33,129 INFO ]: Start isEmpty. Operand 10 states and 22 transitions. [2018-06-22 01:19:33,129 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:19:33,129 INFO ]: Found error trace [2018-06-22 01:19:33,129 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:33,129 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:33,129 INFO ]: Analyzing trace with hash 1379003738, now seen corresponding path program 1 times [2018-06-22 01:19:33,129 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:33,129 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:33,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:33,130 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:33,130 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:33,143 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:33,205 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:33,205 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:33,205 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:33,206 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:33,206 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:33,207 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:33,207 INFO ]: Start difference. First operand 10 states and 22 transitions. Second operand 3 states. [2018-06-22 01:19:33,271 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:33,271 INFO ]: Finished difference Result 11 states and 23 transitions. [2018-06-22 01:19:33,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:33,272 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:19:33,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:33,273 INFO ]: With dead ends: 11 [2018-06-22 01:19:33,273 INFO ]: Without dead ends: 11 [2018-06-22 01:19:33,274 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:33,274 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:19:33,276 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:19:33,276 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:19:33,277 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-06-22 01:19:33,277 INFO ]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 7 [2018-06-22 01:19:33,277 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:33,277 INFO ]: Abstraction has 11 states and 23 transitions. [2018-06-22 01:19:33,277 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:33,277 INFO ]: Start isEmpty. Operand 11 states and 23 transitions. [2018-06-22 01:19:33,277 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:19:33,277 INFO ]: Found error trace [2018-06-22 01:19:33,277 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:33,277 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:33,278 INFO ]: Analyzing trace with hash 1382697822, now seen corresponding path program 1 times [2018-06-22 01:19:33,278 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:33,278 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:33,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:33,279 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:33,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:33,292 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:33,350 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:33,350 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:33,350 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:33,350 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:33,350 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:33,350 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:33,350 INFO ]: Start difference. First operand 11 states and 23 transitions. Second operand 3 states. [2018-06-22 01:19:33,376 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:33,376 INFO ]: Finished difference Result 12 states and 24 transitions. [2018-06-22 01:19:33,376 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:33,376 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:19:33,376 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:33,376 INFO ]: With dead ends: 12 [2018-06-22 01:19:33,377 INFO ]: Without dead ends: 12 [2018-06-22 01:19:33,377 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:33,377 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:19:33,379 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-22 01:19:33,379 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:19:33,379 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-06-22 01:19:33,379 INFO ]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 7 [2018-06-22 01:19:33,379 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:33,379 INFO ]: Abstraction has 11 states and 23 transitions. [2018-06-22 01:19:33,379 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:33,379 INFO ]: Start isEmpty. Operand 11 states and 23 transitions. [2018-06-22 01:19:33,380 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:19:33,380 INFO ]: Found error trace [2018-06-22 01:19:33,380 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:33,380 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:33,380 INFO ]: Analyzing trace with hash 1386183369, now seen corresponding path program 1 times [2018-06-22 01:19:33,380 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:33,380 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:33,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:33,381 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:33,381 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:33,390 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:33,430 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:33,430 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:33,430 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:33,430 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:33,431 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:33,431 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:33,431 INFO ]: Start difference. First operand 11 states and 23 transitions. Second operand 3 states. [2018-06-22 01:19:33,493 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:33,493 INFO ]: Finished difference Result 14 states and 25 transitions. [2018-06-22 01:19:33,494 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:33,494 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:19:33,494 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:33,496 INFO ]: With dead ends: 14 [2018-06-22 01:19:33,496 INFO ]: Without dead ends: 14 [2018-06-22 01:19:33,497 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:33,497 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:19:33,502 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-22 01:19:33,502 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:19:33,503 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2018-06-22 01:19:33,503 INFO ]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 7 [2018-06-22 01:19:33,505 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:33,505 INFO ]: Abstraction has 11 states and 21 transitions. [2018-06-22 01:19:33,505 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:33,505 INFO ]: Start isEmpty. Operand 11 states and 21 transitions. [2018-06-22 01:19:33,506 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:19:33,506 INFO ]: Found error trace [2018-06-22 01:19:33,506 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:33,506 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:33,506 INFO ]: Analyzing trace with hash 1385736504, now seen corresponding path program 1 times [2018-06-22 01:19:33,506 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:33,506 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:33,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:33,507 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:33,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:33,528 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:33,597 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:33,597 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:33,597 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:33,598 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:33,598 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:33,598 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:33,598 INFO ]: Start difference. First operand 11 states and 21 transitions. Second operand 3 states. [2018-06-22 01:19:33,633 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:33,634 INFO ]: Finished difference Result 14 states and 24 transitions. [2018-06-22 01:19:33,634 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:33,634 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:19:33,634 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:33,635 INFO ]: With dead ends: 14 [2018-06-22 01:19:33,635 INFO ]: Without dead ends: 14 [2018-06-22 01:19:33,635 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:33,635 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:19:33,637 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-22 01:19:33,637 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:19:33,637 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2018-06-22 01:19:33,637 INFO ]: Start accepts. Automaton has 11 states and 20 transitions. Word has length 7 [2018-06-22 01:19:33,637 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:33,638 INFO ]: Abstraction has 11 states and 20 transitions. [2018-06-22 01:19:33,638 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:33,638 INFO ]: Start isEmpty. Operand 11 states and 20 transitions. [2018-06-22 01:19:33,638 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:19:33,638 INFO ]: Found error trace [2018-06-22 01:19:33,638 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:33,638 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:33,638 INFO ]: Analyzing trace with hash 1385647131, now seen corresponding path program 1 times [2018-06-22 01:19:33,638 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:33,638 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:33,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:33,639 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:33,639 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:33,648 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:33,710 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:33,710 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:33,710 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:33,710 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:33,711 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:33,711 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:33,711 INFO ]: Start difference. First operand 11 states and 20 transitions. Second operand 3 states. [2018-06-22 01:19:33,729 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:33,729 INFO ]: Finished difference Result 14 states and 22 transitions. [2018-06-22 01:19:33,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:33,730 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:19:33,730 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:33,730 INFO ]: With dead ends: 14 [2018-06-22 01:19:33,730 INFO ]: Without dead ends: 14 [2018-06-22 01:19:33,730 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:33,730 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:19:33,732 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-22 01:19:33,732 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:19:33,732 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2018-06-22 01:19:33,732 INFO ]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 7 [2018-06-22 01:19:33,732 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:33,732 INFO ]: Abstraction has 11 states and 18 transitions. [2018-06-22 01:19:33,732 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:33,732 INFO ]: Start isEmpty. Operand 11 states and 18 transitions. [2018-06-22 01:19:33,733 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:19:33,733 INFO ]: Found error trace [2018-06-22 01:19:33,733 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:33,733 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:33,733 INFO ]: Analyzing trace with hash -202439483, now seen corresponding path program 1 times [2018-06-22 01:19:33,733 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:33,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:33,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:33,734 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:33,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:33,750 INFO ]: Conjunction of SSA is sat [2018-06-22 01:19:33,751 INFO ]: Counterexample might be feasible [2018-06-22 01:19:33,769 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:19:33 BoogieIcfgContainer [2018-06-22 01:19:33,769 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:19:33,770 INFO ]: Toolchain (without parser) took 1611.93 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 213.1 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:19:33,772 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:19:33,772 INFO ]: ChcToBoogie took 77.39 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 260.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:19:33,773 INFO ]: Boogie Preprocessor took 51.92 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 258.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:19:33,774 INFO ]: RCFGBuilder took 520.64 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 246.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:19:33,774 INFO ]: TraceAbstraction took 952.18 ms. Allocated memory is still 308.8 MB. Free memory was 245.2 MB in the beginning and 213.1 MB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:19:33,779 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 77.39 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 260.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 51.92 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 258.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 520.64 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 246.2 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 952.18 ms. Allocated memory is still 308.8 MB. Free memory was 245.2 MB in the beginning and 213.1 MB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 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 gotoProc(0, 0, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [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] hhv_REC_f__0_Int, hhv_REC_f__1_Int, hhv_REC_f__2_Int := hbv_False_5_Int, hbv_False_4_Int, hbv_False_7_Int; [L0] havoc hbv_False_6_Int, hbv_False_3_Int, hbv_False_2_Int, hbv_False_5_Int, hbv_False_7_Int, hbv_False_1_Int, hbv_False_4_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] hhv_REC_f__0_Int, hhv_REC_f__1_Int, hhv_REC_f__2_Int := hbv_REC_f__1_Int, hbv_REC_f__2_Int, hhv_REC_f__2_Int; [L0] havoc hbv_REC_f__1_Int, hbv_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 gotoProc(0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. UNSAFE Result, 0.8s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 115 SDtfs, 32 SDslu, 58 SDs, 0 SdLazy, 29 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred 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, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 331 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/002d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-19-33-799.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/002d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-19-33-799.csv Received shutdown request...