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/vmt-chc-benchmarks/lustre/_6counters_e8_371_e7_304.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 15:50:45,804 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 15:50:45,806 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 15:50:45,816 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 15:50:45,816 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 15:50:45,817 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 15:50:45,818 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 15:50:45,820 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 15:50:45,822 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 15:50:45,822 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 15:50:45,823 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 15:50:45,823 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 15:50:45,824 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 15:50:45,827 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 15:50:45,827 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 15:50:45,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 15:50:45,829 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 15:50:45,830 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 15:50:45,831 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 15:50:45,832 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 15:50:45,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 15:50:45,836 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 15:50:45,836 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 15:50:45,836 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 15:50:45,837 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 15:50:45,838 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 15:50:45,839 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 15:50:45,840 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 15:50:45,841 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 15:50:45,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 15:50:45,841 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 15:50:45,842 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 15:50:45,842 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 15:50:45,843 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 15:50:45,844 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 15:50:45,844 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 15:50:45,858 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 15:50:45,858 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 15:50:45,858 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 15:50:45,859 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 15:50:45,860 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 15:50:45,860 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 15:50:45,860 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 15:50:45,860 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 15:50:45,861 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 15:50:45,861 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 15:50:45,861 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 15:50:45,862 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 15:50:45,862 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 15:50:45,862 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 15:50:45,862 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 15:50:45,862 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 15:50:45,863 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 15:50:45,863 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 15:50:45,863 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 15:50:45,864 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 15:50:45,865 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 15:50:45,898 INFO ]: Repository-Root is: /tmp [2018-06-22 15:50:45,914 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 15:50:45,919 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 15:50:45,920 INFO ]: Initializing SmtParser... [2018-06-22 15:50:45,921 INFO ]: SmtParser initialized [2018-06-22 15:50:45,922 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters_e8_371_e7_304.smt2 [2018-06-22 15:50:45,923 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 15:50:46,066 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters_e8_371_e7_304.smt2 unknown [2018-06-22 15:50:46,310 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/_6counters_e8_371_e7_304.smt2 [2018-06-22 15:50:46,315 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 15:50:46,323 INFO ]: Walking toolchain with 4 elements. [2018-06-22 15:50:46,324 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 15:50:46,324 INFO ]: Initializing ChcToBoogie... [2018-06-22 15:50:46,324 INFO ]: ChcToBoogie initialized [2018-06-22 15:50:46,328 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 03:50:46" (1/1) ... [2018-06-22 15:50:46,378 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:46 Unit [2018-06-22 15:50:46,379 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 15:50:46,380 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 15:50:46,380 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 15:50:46,380 INFO ]: Boogie Preprocessor initialized [2018-06-22 15:50:46,402 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:46" (1/1) ... [2018-06-22 15:50:46,402 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:46" (1/1) ... [2018-06-22 15:50:46,410 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:46" (1/1) ... [2018-06-22 15:50:46,410 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:46" (1/1) ... [2018-06-22 15:50:46,412 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:46" (1/1) ... [2018-06-22 15:50:46,414 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:46" (1/1) ... [2018-06-22 15:50:46,415 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:46" (1/1) ... [2018-06-22 15:50:46,423 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 15:50:46,427 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 15:50:46,427 INFO ]: Initializing RCFGBuilder... [2018-06-22 15:50:46,427 INFO ]: RCFGBuilder initialized [2018-06-22 15:50:46,428 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:46" (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 15:50:46,445 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 15:50:46,445 INFO ]: Found specification of procedure False [2018-06-22 15:50:46,445 INFO ]: Found implementation of procedure False [2018-06-22 15:50:46,445 INFO ]: Specification and implementation of procedure state given in one single declaration [2018-06-22 15:50:46,445 INFO ]: Found specification of procedure state [2018-06-22 15:50:46,445 INFO ]: Found implementation of procedure state [2018-06-22 15:50:46,445 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 15:50:46,445 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 15:50:46,445 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 15:50:46,686 INFO ]: Using library mode [2018-06-22 15:50:46,691 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:50:46 BoogieIcfgContainer [2018-06-22 15:50:46,691 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 15:50:46,698 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 15:50:46,698 INFO ]: Initializing TraceAbstraction... [2018-06-22 15:50:46,701 INFO ]: TraceAbstraction initialized [2018-06-22 15:50:46,701 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 03:50:46" (1/3) ... [2018-06-22 15:50:46,702 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37077be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 03:50:46, skipping insertion in model container [2018-06-22 15:50:46,702 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 03:50:46" (2/3) ... [2018-06-22 15:50:46,702 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37077be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 03:50:46, skipping insertion in model container [2018-06-22 15:50:46,702 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 03:50:46" (3/3) ... [2018-06-22 15:50:46,704 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 15:50:46,712 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 15:50:46,719 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 15:50:46,758 INFO ]: Using default assertion order modulation [2018-06-22 15:50:46,758 INFO ]: Interprodecural is true [2018-06-22 15:50:46,758 INFO ]: Hoare is false [2018-06-22 15:50:46,758 INFO ]: Compute interpolants for FPandBP [2018-06-22 15:50:46,758 INFO ]: Backedges is TWOTRACK [2018-06-22 15:50:46,759 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 15:50:46,759 INFO ]: Difference is false [2018-06-22 15:50:46,759 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 15:50:46,759 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 15:50:46,772 INFO ]: Start isEmpty. Operand 13 states. [2018-06-22 15:50:46,783 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 15:50:46,783 INFO ]: Found error trace [2018-06-22 15:50:46,784 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:46,784 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:46,789 INFO ]: Analyzing trace with hash -683425083, now seen corresponding path program 1 times [2018-06-22 15:50:46,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:46,791 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:46,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:46,823 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:50:46,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:46,862 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:47,062 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 15:50:47,065 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 15:50:47,065 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 15:50:47,066 INFO ]: Interpolant automaton has 4 states [2018-06-22 15:50:47,077 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 15:50:47,077 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 15:50:47,079 INFO ]: Start difference. First operand 13 states. Second operand 4 states. [2018-06-22 15:50:47,146 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:50:47,146 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-22 15:50:47,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 15:50:47,148 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 15:50:47,148 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:50:47,158 INFO ]: With dead ends: 13 [2018-06-22 15:50:47,158 INFO ]: Without dead ends: 13 [2018-06-22 15:50:47,159 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 15:50:47,171 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 15:50:47,191 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 15:50:47,192 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 15:50:47,193 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-22 15:50:47,194 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2018-06-22 15:50:47,194 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:50:47,194 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-22 15:50:47,194 INFO ]: Interpolant automaton has 4 states. [2018-06-22 15:50:47,194 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-22 15:50:47,195 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 15:50:47,196 INFO ]: Found error trace [2018-06-22 15:50:47,196 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:47,197 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:47,197 INFO ]: Analyzing trace with hash 204343015, now seen corresponding path program 1 times [2018-06-22 15:50:47,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:47,197 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:47,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:47,198 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:50:47,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:47,224 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:47,481 WARN ]: Spent 149.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-06-22 15:50:47,688 WARN ]: Spent 175.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-06-22 15:50:47,691 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 15:50:47,691 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:50:47,691 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 15:50:47,698 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:50:47,747 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:47,756 INFO ]: Computing forward predicates... [2018-06-22 15:50:48,231 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 15:50:48,260 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:50:48,260 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 15:50:48,260 INFO ]: Interpolant automaton has 8 states [2018-06-22 15:50:48,260 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 15:50:48,260 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 15:50:48,261 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 8 states. [2018-06-22 15:50:48,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:50:48,559 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-22 15:50:48,559 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 15:50:48,559 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 15:50:48,559 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:50:48,560 INFO ]: With dead ends: 15 [2018-06-22 15:50:48,560 INFO ]: Without dead ends: 15 [2018-06-22 15:50:48,561 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-22 15:50:48,561 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 15:50:48,564 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 15:50:48,564 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 15:50:48,564 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-22 15:50:48,565 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-22 15:50:48,565 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:50:48,565 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-22 15:50:48,565 INFO ]: Interpolant automaton has 8 states. [2018-06-22 15:50:48,565 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-22 15:50:48,565 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 15:50:48,565 INFO ]: Found error trace [2018-06-22 15:50:48,565 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:48,566 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:48,566 INFO ]: Analyzing trace with hash -1649658231, now seen corresponding path program 2 times [2018-06-22 15:50:48,566 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:48,566 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:48,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:48,567 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 15:50:48,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:48,643 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:49,169 WARN ]: Spent 198.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 6 [2018-06-22 15:50:49,171 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 15:50:49,171 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:50:49,171 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 15:50:49,193 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 15:50:49,257 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 15:50:49,257 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:49,260 INFO ]: Computing forward predicates... [2018-06-22 15:50:49,501 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 15:50:49,524 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:50:49,524 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 15:50:49,524 INFO ]: Interpolant automaton has 12 states [2018-06-22 15:50:49,524 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 15:50:49,525 INFO ]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 15:50:49,525 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2018-06-22 15:50:49,837 WARN ]: Spent 273.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-06-22 15:50:50,055 WARN ]: Spent 140.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-06-22 15:50:50,086 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:50:50,086 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-22 15:50:50,086 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 15:50:50,087 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 15:50:50,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:50:50,087 INFO ]: With dead ends: 17 [2018-06-22 15:50:50,087 INFO ]: Without dead ends: 17 [2018-06-22 15:50:50,088 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-06-22 15:50:50,088 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 15:50:50,091 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 15:50:50,091 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 15:50:50,091 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-22 15:50:50,091 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 17 [2018-06-22 15:50:50,091 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:50:50,091 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-22 15:50:50,092 INFO ]: Interpolant automaton has 12 states. [2018-06-22 15:50:50,092 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-22 15:50:50,092 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 15:50:50,092 INFO ]: Found error trace [2018-06-22 15:50:50,092 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:50,092 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:50,092 INFO ]: Analyzing trace with hash 2119922091, now seen corresponding path program 3 times [2018-06-22 15:50:50,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:50,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:50,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:50,096 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 15:50:50,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:50,119 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:50,346 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 15:50:50,346 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:50:50,346 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 15:50:50,354 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 15:50:50,459 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 15:50:50,459 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:50,462 INFO ]: Computing forward predicates... [2018-06-22 15:50:50,832 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 15:50:50,861 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:50:50,861 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-22 15:50:50,861 INFO ]: Interpolant automaton has 16 states [2018-06-22 15:50:50,861 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 15:50:50,862 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-22 15:50:50,862 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 16 states. [2018-06-22 15:50:51,232 WARN ]: Spent 141.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 19 [2018-06-22 15:50:51,366 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:50:51,366 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-22 15:50:51,367 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 15:50:51,367 INFO ]: Start accepts. Automaton has 16 states. Word has length 21 [2018-06-22 15:50:51,367 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:50:51,367 INFO ]: With dead ends: 19 [2018-06-22 15:50:51,367 INFO ]: Without dead ends: 19 [2018-06-22 15:50:51,368 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-06-22 15:50:51,368 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 15:50:51,370 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 15:50:51,371 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 15:50:51,371 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-22 15:50:51,371 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 21 [2018-06-22 15:50:51,372 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:50:51,372 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-22 15:50:51,372 INFO ]: Interpolant automaton has 16 states. [2018-06-22 15:50:51,372 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-22 15:50:51,372 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 15:50:51,372 INFO ]: Found error trace [2018-06-22 15:50:51,372 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:51,373 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:51,373 INFO ]: Analyzing trace with hash 1762711629, now seen corresponding path program 4 times [2018-06-22 15:50:51,373 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:51,373 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:51,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:51,374 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 15:50:51,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:51,403 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:51,610 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 15:50:51,610 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 15:50:51,610 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 15:50:51,623 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 15:50:51,677 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 15:50:51,677 INFO ]: Conjunction of SSA is unsat [2018-06-22 15:50:51,681 INFO ]: Computing forward predicates... [2018-06-22 15:50:52,023 WARN ]: Spent 134.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-06-22 15:50:52,193 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 15:50:52,214 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 15:50:52,214 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-22 15:50:52,214 INFO ]: Interpolant automaton has 20 states [2018-06-22 15:50:52,215 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 15:50:52,215 INFO ]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-06-22 15:50:52,215 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 20 states. [2018-06-22 15:50:52,527 WARN ]: Spent 259.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2018-06-22 15:50:52,701 WARN ]: Spent 145.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 27 [2018-06-22 15:50:53,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 15:50:53,063 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-22 15:50:53,063 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 15:50:53,063 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-22 15:50:53,063 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 15:50:53,064 INFO ]: With dead ends: 21 [2018-06-22 15:50:53,064 INFO ]: Without dead ends: 21 [2018-06-22 15:50:53,065 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2018-06-22 15:50:53,065 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 15:50:53,067 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 15:50:53,067 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 15:50:53,068 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-22 15:50:53,068 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 25 [2018-06-22 15:50:53,068 INFO ]: Finished accepts. word is rejected. [2018-06-22 15:50:53,068 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-22 15:50:53,068 INFO ]: Interpolant automaton has 20 states. [2018-06-22 15:50:53,069 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-22 15:50:53,069 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 15:50:53,069 INFO ]: Found error trace [2018-06-22 15:50:53,069 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 15:50:53,070 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 15:50:53,070 INFO ]: Analyzing trace with hash 853117551, now seen corresponding path program 5 times [2018-06-22 15:50:53,070 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 15:50:53,070 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 15:50:53,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:53,070 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 15:50:53,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 15:50:53,097 INFO ]: Conjunction of SSA is sat [2018-06-22 15:50:53,100 INFO ]: Counterexample might be feasible [2018-06-22 15:50:53,124 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 03:50:53 BoogieIcfgContainer [2018-06-22 15:50:53,124 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 15:50:53,125 INFO ]: Toolchain (without parser) took 6808.87 ms. Allocated memory was 298.8 MB in the beginning and 382.7 MB in the end (delta: 83.9 MB). Free memory was 253.2 MB in the beginning and 183.0 MB in the end (delta: 70.2 MB). Peak memory consumption was 154.1 MB. Max. memory is 3.6 GB. [2018-06-22 15:50:53,125 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 298.8 MB. Free memory is still 264.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 15:50:53,126 INFO ]: ChcToBoogie took 55.41 ms. Allocated memory is still 298.8 MB. Free memory was 252.2 MB in the beginning and 250.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 15:50:53,126 INFO ]: Boogie Preprocessor took 43.06 ms. Allocated memory is still 298.8 MB. Free memory was 250.2 MB in the beginning and 249.2 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-22 15:50:53,127 INFO ]: RCFGBuilder took 264.26 ms. Allocated memory is still 298.8 MB. Free memory was 249.2 MB in the beginning and 239.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-22 15:50:53,127 INFO ]: TraceAbstraction took 6425.90 ms. Allocated memory was 298.8 MB in the beginning and 382.7 MB in the end (delta: 83.9 MB). Free memory was 239.3 MB in the beginning and 183.0 MB in the end (delta: 56.3 MB). Peak memory consumption was 140.2 MB. Max. memory is 3.6 GB. [2018-06-22 15:50:53,131 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 298.8 MB. Free memory is still 264.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 55.41 ms. Allocated memory is still 298.8 MB. Free memory was 252.2 MB in the beginning and 250.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 43.06 ms. Allocated memory is still 298.8 MB. Free memory was 250.2 MB in the beginning and 249.2 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 264.26 ms. Allocated memory is still 298.8 MB. Free memory was 249.2 MB in the beginning and 239.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 6425.90 ms. Allocated memory was 298.8 MB in the beginning and 382.7 MB in the end (delta: 83.9 MB). Free memory was 239.3 MB in the beginning and 183.0 MB in the end (delta: 56.3 MB). Peak memory consumption was 140.2 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_1_Bool; [L0] CALL call state(hbv_False_2_Bool, hbv_False_3_Bool, hbv_False_4_Bool, hbv_False_5_Int, hbv_False_6_Bool, hbv_False_7_Bool, hbv_False_8_Bool, hbv_False_9_Bool, hbv_False_10_Int, hbv_False_11_Bool, hbv_False_12_Bool, hbv_False_13_Bool, hbv_False_1_Bool, hbv_False_14_Bool, hbv_False_15_Int); [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume ((((((((((((((((((((((!((hbv_state_5_Bool || hbv_state_7_Bool) && (!hbv_state_5_Bool || !hbv_state_7_Bool)) && !((!hbv_state_9_Bool || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_9_Bool))) && !((hbv_state_6_Bool || hbv_state_12_Bool) && (!hbv_state_12_Bool || !hbv_state_6_Bool))) && !((((!hbv_state_9_Bool && !hbv_state_7_Bool) || hbv_state_13_Bool) || (hbv_state_9_Bool && hbv_state_7_Bool)) && (!hbv_state_13_Bool || ((hbv_state_9_Bool || hbv_state_7_Bool) && (!hbv_state_9_Bool || !hbv_state_7_Bool))))) && hhv_state_8_Int == hhv_state_3_Int) && !(((hhv_state_12_Bool || (!hhv_state_11_Bool && !hhv_state_10_Bool)) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((!hhv_state_11_Bool || !hhv_state_10_Bool) && (hhv_state_11_Bool || hhv_state_10_Bool))))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_10_Bool || !hhv_state_7_Bool))) && !((!(hbv_state_1_Int == 5) || !hbv_state_2_Bool) && (hbv_state_2_Bool || hbv_state_1_Int == 5))) && !(((!hhv_state_6_Bool || !hhv_state_4_Bool) || !hhv_state_7_Bool) && ((hhv_state_6_Bool && hhv_state_4_Bool) || hhv_state_7_Bool))) && !((hhv_state_6_Bool || hhv_state_2_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && hbv_state_11_Int == hbv_state_1_Int) && hhv_state_3_Int == hhv_state_14_Int) && !((hbv_state_3_Bool || hbv_state_10_Bool) && (!hbv_state_3_Bool || !hbv_state_10_Bool))) && !((hhv_state_2_Bool || !hbv_state_4_Bool) && (!hhv_state_2_Bool || hbv_state_4_Bool))) && !(!(hbv_state_1_Int == 5) && !(hbv_state_1_Int + -1 * hhv_state_14_Int == -1))) && !((hbv_state_8_Bool || hbv_state_4_Bool) && (!hbv_state_8_Bool || !hbv_state_4_Bool))) && !((hhv_state_11_Bool || hhv_state_9_Bool) && (!hhv_state_11_Bool || !hhv_state_9_Bool))) && !((!hhv_state_4_Bool || !hhv_state_0_Bool) && (hhv_state_4_Bool || hhv_state_0_Bool))) && !((((!hbv_state_3_Bool || hhv_state_1_Bool) || (hbv_state_6_Bool && !hbv_state_4_Bool)) || (hbv_state_4_Bool && !hbv_state_6_Bool)) && ((((hbv_state_6_Bool || !hbv_state_4_Bool) && hbv_state_3_Bool) && (!hbv_state_6_Bool || hbv_state_4_Bool)) || !hhv_state_1_Bool))) && !((hbv_state_5_Bool || (hbv_state_3_Bool && hbv_state_4_Bool)) && ((!hbv_state_3_Bool || !hbv_state_5_Bool) || !hbv_state_4_Bool))) && !((!hhv_state_9_Bool || !(hhv_state_8_Int == 5)) && (hhv_state_8_Int == 5 || hhv_state_9_Bool))) && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_5_Bool || !hhv_state_1_Bool))) && !(hbv_state_1_Int == 5 && !(hhv_state_14_Int == 1)); [L0] CALL call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] assume (((((((((((!hhv_state_2_Bool && !((hhv_state_5_Bool || hhv_state_1_Bool) && (!hhv_state_1_Bool || !hhv_state_5_Bool))) && !((hhv_state_4_Bool || hhv_state_0_Bool) && (!hhv_state_4_Bool || !hhv_state_0_Bool))) && !hhv_state_0_Bool) && !((hhv_state_7_Bool || (hhv_state_4_Bool && hhv_state_6_Bool)) && ((!hhv_state_4_Bool || !hhv_state_7_Bool) || !hhv_state_6_Bool))) && hhv_state_3_Int == hhv_state_8_Int) && !((!(hhv_state_8_Int == 5) || !hhv_state_9_Bool) && (hhv_state_9_Bool || hhv_state_8_Int == 5))) && !((hhv_state_7_Bool || hhv_state_10_Bool) && (!hhv_state_7_Bool || !hhv_state_10_Bool))) && hhv_state_3_Int == 0) && !((((!hhv_state_11_Bool && !hhv_state_10_Bool) || hhv_state_12_Bool) || (hhv_state_11_Bool && hhv_state_10_Bool)) && (!hhv_state_12_Bool || ((hhv_state_11_Bool || hhv_state_10_Bool) && (!hhv_state_11_Bool || !hhv_state_10_Bool))))) && !hhv_state_1_Bool) && !((hhv_state_2_Bool || hhv_state_6_Bool) && (!hhv_state_2_Bool || !hhv_state_6_Bool))) && !((!hhv_state_11_Bool || !hhv_state_9_Bool) && (hhv_state_9_Bool || hhv_state_11_Bool)); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_state_10_Bool, hbv_state_12_Bool, hbv_state_8_Bool, hbv_state_11_Int, hbv_state_3_Bool, hbv_state_6_Bool, hbv_state_4_Bool, hbv_state_5_Bool, hbv_state_1_Int, hbv_state_2_Bool, hbv_state_7_Bool, hbv_state_9_Bool, hbv_state_13_Bool, hbv_state_14_Bool, hbv_state_15_Int); [L0] RET call state(hbv_False_2_Bool, hbv_False_3_Bool, hbv_False_4_Bool, hbv_False_5_Int, hbv_False_6_Bool, hbv_False_7_Bool, hbv_False_8_Bool, hbv_False_9_Bool, hbv_False_10_Int, hbv_False_11_Bool, hbv_False_12_Bool, hbv_False_13_Bool, hbv_False_1_Bool, hbv_False_14_Bool, hbv_False_15_Int); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. UNSAFE Result, 6.3s OverallTime, 6 OverallIterations, 6 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 84 SDslu, 229 SDs, 0 SdLazy, 177 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred 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.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 13280 SizeOfPredicates, 73 NumberOfNonLiveVariables, 674 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 40/140 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/_6counters_e8_371_e7_304.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_15-50-53-201.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/_6counters_e8_371_e7_304.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_15-50-53-201.csv Received shutdown request...