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/022d-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:32:39,927 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:32:39,929 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:32:39,946 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:32:39,947 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:32:39,947 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:32:39,949 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:32:39,950 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:32:39,952 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:32:39,952 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:32:39,954 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:32:39,954 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:32:39,955 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:32:39,956 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:32:39,956 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:32:39,957 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:32:39,961 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:32:39,963 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:32:39,976 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:32:39,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:32:39,978 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:32:39,979 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:32:39,979 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:32:39,979 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:32:39,980 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:32:39,981 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:32:39,982 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:32:39,982 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:32:39,983 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:32:39,983 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:32:39,984 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:32:39,985 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:32:39,985 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:32:39,986 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:32:39,986 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:32:39,986 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:32:39,999 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:32:40,000 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:32:40,000 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:32:40,000 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:32:40,001 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:32:40,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:32:40,002 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:32:40,002 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:32:40,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:32:40,002 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:32:40,002 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:32:40,003 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:32:40,003 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:32:40,003 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:32:40,004 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:32:40,004 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:32:40,004 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:32:40,006 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:32:40,007 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:32:40,062 INFO ]: Repository-Root is: /tmp [2018-06-22 01:32:40,081 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:32:40,085 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:32:40,086 INFO ]: Initializing SmtParser... [2018-06-22 01:32:40,086 INFO ]: SmtParser initialized [2018-06-22 01:32:40,087 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/022d-horn.smt2 [2018-06-22 01:32:40,088 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:32:40,185 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/022d-horn.smt2 unknown [2018-06-22 01:32:40,430 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/022d-horn.smt2 [2018-06-22 01:32:40,435 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:32:40,441 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:32:40,441 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:32:40,441 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:32:40,441 INFO ]: ChcToBoogie initialized [2018-06-22 01:32:40,444 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:32:40" (1/1) ... [2018-06-22 01:32:40,508 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:40 Unit [2018-06-22 01:32:40,508 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:32:40,509 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:32:40,509 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:32:40,509 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:32:40,530 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:40" (1/1) ... [2018-06-22 01:32:40,530 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:40" (1/1) ... [2018-06-22 01:32:40,539 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:40" (1/1) ... [2018-06-22 01:32:40,540 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:40" (1/1) ... [2018-06-22 01:32:40,553 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:40" (1/1) ... [2018-06-22 01:32:40,556 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:40" (1/1) ... [2018-06-22 01:32:40,558 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:40" (1/1) ... [2018-06-22 01:32:40,560 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:32:40,563 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:32:40,564 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:32:40,564 INFO ]: RCFGBuilder initialized [2018-06-22 01:32:40,570 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:40" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:32:40,583 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:32:40,583 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:32:40,583 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:32:40,583 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:32:40,583 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:32:40,583 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:32:41,046 INFO ]: Using library mode [2018-06-22 01:32:41,046 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:32:41 BoogieIcfgContainer [2018-06-22 01:32:41,046 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:32:41,048 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:32:41,048 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:32:41,051 INFO ]: TraceAbstraction initialized [2018-06-22 01:32:41,051 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:32:40" (1/3) ... [2018-06-22 01:32:41,052 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ba10dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:32:41, skipping insertion in model container [2018-06-22 01:32:41,052 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:40" (2/3) ... [2018-06-22 01:32:41,052 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ba10dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:32:41, skipping insertion in model container [2018-06-22 01:32:41,052 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:32:41" (3/3) ... [2018-06-22 01:32:41,054 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:32:41,063 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:32:41,069 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:32:41,104 INFO ]: Using default assertion order modulation [2018-06-22 01:32:41,104 INFO ]: Interprodecural is true [2018-06-22 01:32:41,104 INFO ]: Hoare is false [2018-06-22 01:32:41,104 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:32:41,104 INFO ]: Backedges is TWOTRACK [2018-06-22 01:32:41,104 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:32:41,104 INFO ]: Difference is false [2018-06-22 01:32:41,104 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:32:41,104 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:32:41,118 INFO ]: Start isEmpty. Operand 31 states. [2018-06-22 01:32:41,134 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:32:41,134 INFO ]: Found error trace [2018-06-22 01:32:41,135 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:41,136 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:41,141 INFO ]: Analyzing trace with hash 575438904, now seen corresponding path program 1 times [2018-06-22 01:32:41,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:41,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:41,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:41,174 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:41,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:41,221 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:41,297 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:32:41,299 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:41,299 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:32:41,301 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:32:41,312 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:32:41,312 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:32:41,314 INFO ]: Start difference. First operand 31 states. Second operand 4 states. [2018-06-22 01:32:42,056 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:42,056 INFO ]: Finished difference Result 55 states and 89 transitions. [2018-06-22 01:32:42,057 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:32:42,058 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:32:42,058 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:42,068 INFO ]: With dead ends: 55 [2018-06-22 01:32:42,068 INFO ]: Without dead ends: 55 [2018-06-22 01:32:42,070 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:42,086 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 01:32:42,119 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-06-22 01:32:42,122 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 01:32:42,125 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 89 transitions. [2018-06-22 01:32:42,126 INFO ]: Start accepts. Automaton has 55 states and 89 transitions. Word has length 8 [2018-06-22 01:32:42,127 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:42,127 INFO ]: Abstraction has 55 states and 89 transitions. [2018-06-22 01:32:42,127 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:32:42,127 INFO ]: Start isEmpty. Operand 55 states and 89 transitions. [2018-06-22 01:32:42,130 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:32:42,130 INFO ]: Found error trace [2018-06-22 01:32:42,130 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:42,130 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:42,131 INFO ]: Analyzing trace with hash 578209467, now seen corresponding path program 1 times [2018-06-22 01:32:42,131 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:42,131 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:42,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:42,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:42,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:42,143 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:42,195 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:32:42,196 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:42,196 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:32:42,197 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:32:42,197 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:32:42,197 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:32:42,197 INFO ]: Start difference. First operand 55 states and 89 transitions. Second operand 4 states. [2018-06-22 01:32:42,730 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:42,730 INFO ]: Finished difference Result 81 states and 132 transitions. [2018-06-22 01:32:42,731 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:32:42,731 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:32:42,731 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:42,736 INFO ]: With dead ends: 81 [2018-06-22 01:32:42,736 INFO ]: Without dead ends: 81 [2018-06-22 01:32:42,737 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:42,738 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-22 01:32:42,757 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-06-22 01:32:42,757 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-22 01:32:42,764 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 132 transitions. [2018-06-22 01:32:42,764 INFO ]: Start accepts. Automaton has 81 states and 132 transitions. Word has length 8 [2018-06-22 01:32:42,764 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:42,764 INFO ]: Abstraction has 81 states and 132 transitions. [2018-06-22 01:32:42,764 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:32:42,764 INFO ]: Start isEmpty. Operand 81 states and 132 transitions. [2018-06-22 01:32:42,768 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:32:42,768 INFO ]: Found error trace [2018-06-22 01:32:42,768 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:42,768 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:42,768 INFO ]: Analyzing trace with hash 782289457, now seen corresponding path program 1 times [2018-06-22 01:32:42,768 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:42,768 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:42,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:42,769 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:42,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:42,787 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:42,812 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:32:42,813 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:42,813 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:32:42,813 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:32:42,813 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:32:42,813 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:32:42,813 INFO ]: Start difference. First operand 81 states and 132 transitions. Second operand 3 states. [2018-06-22 01:32:42,921 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:42,921 INFO ]: Finished difference Result 141 states and 237 transitions. [2018-06-22 01:32:42,921 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:32:42,921 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:32:42,921 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:42,929 INFO ]: With dead ends: 141 [2018-06-22 01:32:42,929 INFO ]: Without dead ends: 141 [2018-06-22 01:32:42,930 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:32:42,930 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 01:32:42,946 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 84. [2018-06-22 01:32:42,946 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-22 01:32:42,949 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 141 transitions. [2018-06-22 01:32:42,949 INFO ]: Start accepts. Automaton has 84 states and 141 transitions. Word has length 9 [2018-06-22 01:32:42,949 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:42,949 INFO ]: Abstraction has 84 states and 141 transitions. [2018-06-22 01:32:42,949 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:32:42,949 INFO ]: Start isEmpty. Operand 84 states and 141 transitions. [2018-06-22 01:32:42,955 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:32:42,956 INFO ]: Found error trace [2018-06-22 01:32:42,956 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:42,956 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:42,956 INFO ]: Analyzing trace with hash -1850011073, now seen corresponding path program 1 times [2018-06-22 01:32:42,956 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:42,956 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:42,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:42,957 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:42,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:42,979 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:43,121 INFO ]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:32:43,122 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:43,122 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:32:43,123 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:32:43,123 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:32:43,123 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:43,123 INFO ]: Start difference. First operand 84 states and 141 transitions. Second operand 5 states. [2018-06-22 01:32:43,810 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:43,810 INFO ]: Finished difference Result 187 states and 425 transitions. [2018-06-22 01:32:43,811 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:32:43,811 INFO ]: Start accepts. Automaton has 5 states. Word has length 19 [2018-06-22 01:32:43,811 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:43,820 INFO ]: With dead ends: 187 [2018-06-22 01:32:43,820 INFO ]: Without dead ends: 172 [2018-06-22 01:32:43,820 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:32:43,820 INFO ]: Start minimizeSevpa. Operand 172 states. [2018-06-22 01:32:43,852 INFO ]: Finished minimizeSevpa. Reduced states from 172 to 107. [2018-06-22 01:32:43,852 INFO ]: Start removeUnreachable. Operand 107 states. [2018-06-22 01:32:43,856 INFO ]: Finished removeUnreachable. Reduced from 107 states to 107 states and 201 transitions. [2018-06-22 01:32:43,856 INFO ]: Start accepts. Automaton has 107 states and 201 transitions. Word has length 19 [2018-06-22 01:32:43,856 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:43,856 INFO ]: Abstraction has 107 states and 201 transitions. [2018-06-22 01:32:43,856 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:32:43,856 INFO ]: Start isEmpty. Operand 107 states and 201 transitions. [2018-06-22 01:32:43,860 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:32:43,860 INFO ]: Found error trace [2018-06-22 01:32:43,860 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:43,861 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:43,861 INFO ]: Analyzing trace with hash 782662979, now seen corresponding path program 1 times [2018-06-22 01:32:43,861 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:43,861 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:43,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:43,862 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:43,862 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:43,880 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:43,941 INFO ]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 01:32:43,941 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:43,941 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:32:43,941 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:32:43,941 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:32:43,941 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:43,942 INFO ]: Start difference. First operand 107 states and 201 transitions. Second operand 5 states. [2018-06-22 01:32:44,757 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:44,757 INFO ]: Finished difference Result 335 states and 1108 transitions. [2018-06-22 01:32:44,757 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:32:44,757 INFO ]: Start accepts. Automaton has 5 states. Word has length 19 [2018-06-22 01:32:44,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:44,790 INFO ]: With dead ends: 335 [2018-06-22 01:32:44,790 INFO ]: Without dead ends: 335 [2018-06-22 01:32:44,790 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:32:44,791 INFO ]: Start minimizeSevpa. Operand 335 states. [2018-06-22 01:32:44,882 INFO ]: Finished minimizeSevpa. Reduced states from 335 to 108. [2018-06-22 01:32:44,882 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 01:32:44,887 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 204 transitions. [2018-06-22 01:32:44,887 INFO ]: Start accepts. Automaton has 108 states and 204 transitions. Word has length 19 [2018-06-22 01:32:44,887 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:44,887 INFO ]: Abstraction has 108 states and 204 transitions. [2018-06-22 01:32:44,887 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:32:44,887 INFO ]: Start isEmpty. Operand 108 states and 204 transitions. [2018-06-22 01:32:44,890 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:32:44,890 INFO ]: Found error trace [2018-06-22 01:32:44,890 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:44,890 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:44,890 INFO ]: Analyzing trace with hash -872242097, now seen corresponding path program 1 times [2018-06-22 01:32:44,890 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:44,890 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:44,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:44,891 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:44,891 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:44,937 INFO ]: Conjunction of SSA is sat [2018-06-22 01:32:44,945 INFO ]: Counterexample might be feasible [2018-06-22 01:32:44,966 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:32:44 BoogieIcfgContainer [2018-06-22 01:32:44,967 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:32:44,967 INFO ]: Toolchain (without parser) took 4531.70 ms. Allocated memory was 308.3 MB in the beginning and 342.4 MB in the end (delta: 34.1 MB). Free memory was 258.8 MB in the beginning and 262.1 MB in the end (delta: -3.3 MB). Peak memory consumption was 30.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:44,969 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.3 MB. Free memory is still 272.9 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:32:44,969 INFO ]: ChcToBoogie took 67.51 ms. Allocated memory is still 308.3 MB. Free memory was 258.8 MB in the beginning and 256.8 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:32:44,970 INFO ]: Boogie Preprocessor took 51.26 ms. Allocated memory is still 308.3 MB. Free memory was 256.8 MB in the beginning and 254.8 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:32:44,970 INFO ]: RCFGBuilder took 482.86 ms. Allocated memory is still 308.3 MB. Free memory was 254.8 MB in the beginning and 234.9 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:44,971 INFO ]: TraceAbstraction took 3918.76 ms. Allocated memory was 308.3 MB in the beginning and 342.4 MB in the end (delta: 34.1 MB). Free memory was 234.9 MB in the beginning and 262.1 MB in the end (delta: -27.2 MB). Peak memory consumption was 6.9 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:44,974 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 308.3 MB. Free memory is still 272.9 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 67.51 ms. Allocated memory is still 308.3 MB. Free memory was 258.8 MB in the beginning and 256.8 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.26 ms. Allocated memory is still 308.3 MB. Free memory was 256.8 MB in the beginning and 254.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 482.86 ms. Allocated memory is still 308.3 MB. Free memory was 254.8 MB in the beginning and 234.9 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3918.76 ms. Allocated memory was 308.3 MB in the beginning and 342.4 MB in the end (delta: 34.1 MB). Free memory was 234.9 MB in the beginning and 262.1 MB in the end (delta: -27.2 MB). Peak memory consumption was 6.9 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, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 4) [L0] COND FALSE !(gotoSwitch == 1) [L0] assume (((hbv_False_5_Int == hbv_False_6_Int && !(hbv_False_7_Int - hbv_False_8_Int + -1 >= 0)) && !(hbv_False_9_Int == hbv_False_10_Int)) && !(hbv_False_3_Int - hbv_False_4_Int + -1 >= 0)) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hbv_False_7_Int, hbv_False_9_Int, hbv_False_8_Int, hbv_False_3_Int, hbv_False_10_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_1_Int, hbv_False_6_Int, hbv_False_2_Int; [L0] havoc hbv_False_5_Int, hbv_False_4_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_6_Int, hbv_False_8_Int, hbv_False_1_Int, hbv_False_7_Int, hbv_False_9_Int, hbv_False_10_Int; [L0] assume ((((!(hhv_INV1_2_Int - hhv_INV1_0_Int + -1 >= 0) && !(hhv_INV1_5_Int - hhv_INV1_3_Int + -1 >= 0)) && hhv_INV1_7_Int == hhv_INV1_9_Int) && hhv_INV1_6_Int == hhv_INV1_8_Int) && hbv_INV1_1_Int - hbv_INV1_2_Int + -1 >= 0) && hbv_INV1_3_Int - hbv_INV1_4_Int + -1 >= 0; [L0] CALL call gotoProc(1, hbv_INV1_1_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_3_Int, hbv_INV1_6_Int, hbv_INV1_4_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 4) [L0] COND TRUE gotoSwitch == 1 [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := gpav_0_Int, gpav_1_Int, gpav_2_Int, gpav_3_Int, gpav_4_Int, gpav_5_Int, gpav_6_Int, gpav_7_Int, gpav_8_Int, gpav_9_Int; [L0] assume ((((((-1 * hhv_INV1_2_Int == 0 && -1 * hhv_INV1_5_Int == 0) && hhv_INV1_6_Int == hhv_INV1_0_Int) && hhv_INV1_1_Int == hhv_INV1_4_Int) && hhv_INV1_9_Int == hhv_INV1_4_Int) && hhv_INV1_0_Int == hhv_INV1_3_Int) && hhv_INV1_8_Int == hhv_INV1_3_Int) && hhv_INV1_7_Int == hhv_INV1_1_Int; [L0] RET call gotoProc(1, hbv_INV1_1_Int, hbv_INV1_5_Int, hbv_INV1_2_Int, hbv_INV1_3_Int, hbv_INV1_6_Int, hbv_INV1_4_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int); [L0] hhv_INV2_0_Int, hhv_INV2_1_Int, hhv_INV2_2_Int, hhv_INV2_3_Int, hhv_INV2_4_Int, hhv_INV2_5_Int, hhv_INV2_6_Int, hhv_INV2_7_Int, hhv_INV2_8_Int, hhv_INV2_9_Int := hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int; [L0] havoc hbv_INV1_4_Int, hbv_INV1_2_Int, hbv_INV1_6_Int, hbv_INV1_1_Int, hbv_INV1_5_Int, hbv_INV1_3_Int; [L0] assume ((((((hhv_INV2_0_Int - hbv_INV2_2_Int + -1 >= 0 && hhv_INV2_3_Int - hbv_INV2_1_Int + -1 >= 0) && hbv_INV2_2_Int + 1 == hhv_INV2_2_Int) && hhv_INV2_6_Int == hhv_INV2_8_Int) && hbv_INV2_4_Int + -2 + 1 == hhv_INV2_1_Int) && hbv_INV2_3_Int + -2 == hhv_INV2_4_Int) && hbv_INV2_1_Int + 1 == hhv_INV2_5_Int) && hhv_INV2_7_Int == hhv_INV2_9_Int; [L0] hhv_INV1_0_Int, hhv_INV1_1_Int, hhv_INV1_2_Int, hhv_INV1_3_Int, hhv_INV1_4_Int, hhv_INV1_5_Int, hhv_INV1_6_Int, hhv_INV1_7_Int, hhv_INV1_8_Int, hhv_INV1_9_Int := hhv_INV2_0_Int, hbv_INV2_4_Int, hbv_INV2_2_Int, hhv_INV2_3_Int, hbv_INV2_3_Int, hbv_INV2_1_Int, hhv_INV2_6_Int, hhv_INV2_7_Int, hhv_INV2_8_Int, hhv_INV2_9_Int; [L0] havoc hbv_INV2_4_Int, hbv_INV2_3_Int, hbv_INV2_1_Int, hbv_INV2_2_Int; [L0] assume ((((((-1 * hhv_INV1_2_Int == 0 && -1 * hhv_INV1_5_Int == 0) && hhv_INV1_6_Int == hhv_INV1_0_Int) && hhv_INV1_1_Int == hhv_INV1_4_Int) && hhv_INV1_9_Int == hhv_INV1_4_Int) && hhv_INV1_0_Int == hhv_INV1_3_Int) && hhv_INV1_8_Int == hhv_INV1_3_Int) && hhv_INV1_7_Int == hhv_INV1_1_Int; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. UNSAFE Result, 3.8s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 380 SDtfs, 275 SDslu, 389 SDs, 0 SdLazy, 462 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=5, 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.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 349 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 1834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 16/16 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/022d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-32-44-984.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/022d-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-32-44-984.csv Received shutdown request...