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/hopv/lia/termination/CE-Jones_Bohr04.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:55:40,843 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:55:40,846 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:55:40,862 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:55:40,862 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:55:40,863 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:55:40,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:55:40,869 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:55:40,871 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:55:40,873 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:55:40,874 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:55:40,874 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:55:40,877 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:55:40,878 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:55:40,879 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:55:40,880 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:55:40,889 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:55:40,891 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:55:40,892 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:55:40,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:55:40,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:55:40,901 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:55:40,901 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:55:40,902 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:55:40,903 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:55:40,908 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:55:40,908 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:55:40,909 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:55:40,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:55:40,915 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:55:40,916 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:55:40,916 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:55:40,916 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:55:40,917 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:55:40,919 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:55:40,920 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:55:40,944 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:55:40,944 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:55:40,944 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:55:40,945 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:55:40,946 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:55:40,947 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:55:40,947 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:55:40,947 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:55:40,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:55:40,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:55:40,948 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:55:40,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:55:40,948 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:55:40,948 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:55:40,949 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:55:40,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:55:40,949 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:55:40,950 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:55:40,951 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:55:41,000 INFO ]: Repository-Root is: /tmp [2018-06-22 01:55:41,018 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:55:41,022 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:55:41,024 INFO ]: Initializing SmtParser... [2018-06-22 01:55:41,024 INFO ]: SmtParser initialized [2018-06-22 01:55:41,025 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/termination/CE-Jones_Bohr04.smt2 [2018-06-22 01:55:41,026 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:55:41,146 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/termination/CE-Jones_Bohr04.smt2 unknown [2018-06-22 01:55:42,387 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/termination/CE-Jones_Bohr04.smt2 [2018-06-22 01:55:42,392 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:55:42,399 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:55:42,399 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:55:42,399 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:55:42,399 INFO ]: ChcToBoogie initialized [2018-06-22 01:55:42,403 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:55:42" (1/1) ... [2018-06-22 01:55:42,480 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:55:42 Unit [2018-06-22 01:55:42,480 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:55:42,480 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:55:42,481 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:55:42,481 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:55:42,505 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:55:42" (1/1) ... [2018-06-22 01:55:42,505 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:55:42" (1/1) ... [2018-06-22 01:55:42,526 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:55:42" (1/1) ... [2018-06-22 01:55:42,526 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:55:42" (1/1) ... [2018-06-22 01:55:42,536 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:55:42" (1/1) ... [2018-06-22 01:55:42,548 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:55:42" (1/1) ... [2018-06-22 01:55:42,551 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:55:42" (1/1) ... [2018-06-22 01:55:42,556 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:55:42,557 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:55:42,557 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:55:42,557 INFO ]: RCFGBuilder initialized [2018-06-22 01:55:42,558 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:55:42" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 01:55:42,578 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:55:42,578 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:55:42,578 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:55:42,578 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:55:42,578 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:55:42,578 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:55:43,983 INFO ]: Using library mode [2018-06-22 01:55:43,984 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:55:43 BoogieIcfgContainer [2018-06-22 01:55:43,984 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:55:43,985 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:55:43,985 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:55:43,989 INFO ]: TraceAbstraction initialized [2018-06-22 01:55:43,989 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:55:42" (1/3) ... [2018-06-22 01:55:43,990 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f36dc83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:55:43, skipping insertion in model container [2018-06-22 01:55:43,990 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:55:42" (2/3) ... [2018-06-22 01:55:43,990 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f36dc83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:55:43, skipping insertion in model container [2018-06-22 01:55:43,990 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:55:43" (3/3) ... [2018-06-22 01:55:43,992 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:55:44,002 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:55:44,011 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:55:44,056 INFO ]: Using default assertion order modulation [2018-06-22 01:55:44,056 INFO ]: Interprodecural is true [2018-06-22 01:55:44,057 INFO ]: Hoare is false [2018-06-22 01:55:44,057 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:55:44,057 INFO ]: Backedges is TWOTRACK [2018-06-22 01:55:44,057 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:55:44,057 INFO ]: Difference is false [2018-06-22 01:55:44,057 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:55:44,057 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:55:44,072 INFO ]: Start isEmpty. Operand 49 states. [2018-06-22 01:55:44,091 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 01:55:44,091 INFO ]: Found error trace [2018-06-22 01:55:44,092 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:55:44,092 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:55:44,098 INFO ]: Analyzing trace with hash 275371346, now seen corresponding path program 1 times [2018-06-22 01:55:44,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:55:44,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:55:44,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:44,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:44,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:44,176 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:55:44,212 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:55:44,215 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:55:44,215 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:55:44,217 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:55:44,234 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:55:44,234 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:55:44,237 INFO ]: Start difference. First operand 49 states. Second operand 2 states. [2018-06-22 01:55:44,270 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:55:44,270 INFO ]: Finished difference Result 47 states and 69 transitions. [2018-06-22 01:55:44,270 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:55:44,271 INFO ]: Start accepts. Automaton has 2 states. Word has length 13 [2018-06-22 01:55:44,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:55:44,288 INFO ]: With dead ends: 47 [2018-06-22 01:55:44,288 INFO ]: Without dead ends: 38 [2018-06-22 01:55:44,290 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:55:44,310 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 01:55:44,355 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 01:55:44,357 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 01:55:44,365 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2018-06-22 01:55:44,366 INFO ]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 13 [2018-06-22 01:55:44,366 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:55:44,366 INFO ]: Abstraction has 38 states and 53 transitions. [2018-06-22 01:55:44,366 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:55:44,366 INFO ]: Start isEmpty. Operand 38 states and 53 transitions. [2018-06-22 01:55:44,369 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:55:44,369 INFO ]: Found error trace [2018-06-22 01:55:44,369 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:55:44,370 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:55:44,372 INFO ]: Analyzing trace with hash 365087062, now seen corresponding path program 1 times [2018-06-22 01:55:44,372 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:55:44,372 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:55:44,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:44,373 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:44,373 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:44,391 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-22 01:55:44,392 INFO ]: Advancing trace checker [2018-06-22 01:55:44,392 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-22 01:55:44,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:44,458 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:55:44,471 INFO ]: Computing forward predicates... [2018-06-22 01:55:44,649 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:55:44,682 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:55:44,683 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:55:44,684 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:55:44,684 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:55:44,685 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:55:44,685 INFO ]: Start difference. First operand 38 states and 53 transitions. Second operand 4 states. [2018-06-22 01:55:45,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:55:45,750 INFO ]: Finished difference Result 54 states and 75 transitions. [2018-06-22 01:55:45,751 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:55:45,751 INFO ]: Start accepts. Automaton has 4 states. Word has length 14 [2018-06-22 01:55:45,751 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:55:45,758 INFO ]: With dead ends: 54 [2018-06-22 01:55:45,758 INFO ]: Without dead ends: 54 [2018-06-22 01:55:45,759 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:55:45,759 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 01:55:45,767 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-06-22 01:55:45,767 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 01:55:45,769 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 75 transitions. [2018-06-22 01:55:45,769 INFO ]: Start accepts. Automaton has 54 states and 75 transitions. Word has length 14 [2018-06-22 01:55:45,769 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:55:45,769 INFO ]: Abstraction has 54 states and 75 transitions. [2018-06-22 01:55:45,769 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:55:45,769 INFO ]: Start isEmpty. Operand 54 states and 75 transitions. [2018-06-22 01:55:45,771 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-22 01:55:45,771 INFO ]: Found error trace [2018-06-22 01:55:45,771 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:55:45,772 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:55:45,772 INFO ]: Analyzing trace with hash -1881826809, now seen corresponding path program 1 times [2018-06-22 01:55:45,772 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:55:45,772 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:55:45,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:45,773 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:45,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:45,798 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:55:45,827 INFO ]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-06-22 01:55:45,827 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:55:45,827 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 01:55:45,839 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:45,917 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:55:45,921 INFO ]: Computing forward predicates... [2018-06-22 01:55:46,002 INFO ]: Checked inductivity of 23 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:55:46,029 INFO ]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:55:46,029 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-06-22 01:55:46,029 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:55:46,029 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:55:46,029 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:55:46,030 INFO ]: Start difference. First operand 54 states and 75 transitions. Second operand 4 states. [2018-06-22 01:55:46,301 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:55:46,301 INFO ]: Finished difference Result 70 states and 97 transitions. [2018-06-22 01:55:46,302 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:55:46,302 INFO ]: Start accepts. Automaton has 4 states. Word has length 38 [2018-06-22 01:55:46,302 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:55:46,304 INFO ]: With dead ends: 70 [2018-06-22 01:55:46,304 INFO ]: Without dead ends: 70 [2018-06-22 01:55:46,305 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 36 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:55:46,305 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 01:55:46,312 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-06-22 01:55:46,312 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 01:55:46,314 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2018-06-22 01:55:46,314 INFO ]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 38 [2018-06-22 01:55:46,314 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:55:46,314 INFO ]: Abstraction has 70 states and 97 transitions. [2018-06-22 01:55:46,314 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:55:46,314 INFO ]: Start isEmpty. Operand 70 states and 97 transitions. [2018-06-22 01:55:46,317 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-22 01:55:46,317 INFO ]: Found error trace [2018-06-22 01:55:46,317 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:55:46,317 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:55:46,317 INFO ]: Analyzing trace with hash 224646783, now seen corresponding path program 1 times [2018-06-22 01:55:46,317 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:55:46,317 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:55:46,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:46,318 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:46,318 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:46,340 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-22 01:55:46,340 INFO ]: Advancing trace checker [2018-06-22 01:55:46,340 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 (exit command is (exit), workingDir is null) [2018-06-22 01:55:46,376 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-22 01:55:46,490 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:55:46,494 INFO ]: Computing forward predicates... [2018-06-22 01:55:46,557 INFO ]: Checked inductivity of 23 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:55:46,579 INFO ]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:55:46,580 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-06-22 01:55:46,580 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:55:46,580 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:55:46,580 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:55:46,580 INFO ]: Start difference. First operand 70 states and 97 transitions. Second operand 4 states. [2018-06-22 01:55:46,775 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:55:46,776 INFO ]: Finished difference Result 78 states and 106 transitions. [2018-06-22 01:55:46,776 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:55:46,776 INFO ]: Start accepts. Automaton has 4 states. Word has length 40 [2018-06-22 01:55:46,777 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:55:46,778 INFO ]: With dead ends: 78 [2018-06-22 01:55:46,779 INFO ]: Without dead ends: 70 [2018-06-22 01:55:46,779 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 38 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:55:46,779 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 01:55:46,785 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-06-22 01:55:46,785 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 01:55:46,787 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2018-06-22 01:55:46,787 INFO ]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 40 [2018-06-22 01:55:46,787 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:55:46,787 INFO ]: Abstraction has 70 states and 94 transitions. [2018-06-22 01:55:46,787 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:55:46,787 INFO ]: Start isEmpty. Operand 70 states and 94 transitions. [2018-06-22 01:55:46,789 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:55:46,790 INFO ]: Found error trace [2018-06-22 01:55:46,790 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:55:46,790 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:55:46,790 INFO ]: Analyzing trace with hash 1357528305, now seen corresponding path program 1 times [2018-06-22 01:55:46,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:55:46,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:55:46,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:46,791 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:46,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:46,810 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-22 01:55:46,810 INFO ]: Advancing trace checker [2018-06-22 01:55:46,810 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-22 01:55:46,832 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:46,878 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:55:46,881 INFO ]: Computing forward predicates... [2018-06-22 01:55:47,213 INFO ]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 01:55:47,243 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:55:47,243 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 01:55:47,243 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:55:47,243 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:55:47,243 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:55:47,244 INFO ]: Start difference. First operand 70 states and 94 transitions. Second operand 7 states. [2018-06-22 01:55:47,860 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:55:47,860 INFO ]: Finished difference Result 143 states and 237 transitions. [2018-06-22 01:55:47,860 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 01:55:47,860 INFO ]: Start accepts. Automaton has 7 states. Word has length 30 [2018-06-22 01:55:47,860 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:55:47,864 INFO ]: With dead ends: 143 [2018-06-22 01:55:47,864 INFO ]: Without dead ends: 95 [2018-06-22 01:55:47,865 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:55:47,865 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 01:55:47,883 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 79. [2018-06-22 01:55:47,883 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 01:55:47,884 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 105 transitions. [2018-06-22 01:55:47,884 INFO ]: Start accepts. Automaton has 79 states and 105 transitions. Word has length 30 [2018-06-22 01:55:47,885 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:55:47,885 INFO ]: Abstraction has 79 states and 105 transitions. [2018-06-22 01:55:47,885 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:55:47,885 INFO ]: Start isEmpty. Operand 79 states and 105 transitions. [2018-06-22 01:55:47,887 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:55:47,887 INFO ]: Found error trace [2018-06-22 01:55:47,887 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:55:47,887 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:55:47,887 INFO ]: Analyzing trace with hash 794481837, now seen corresponding path program 1 times [2018-06-22 01:55:47,887 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:55:47,887 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:55:47,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:47,888 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:47,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:47,905 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-22 01:55:47,905 INFO ]: Advancing trace checker [2018-06-22 01:55:47,905 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-22 01:55:47,924 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:47,995 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:55:47,999 INFO ]: Computing forward predicates... [2018-06-22 01:55:48,128 INFO ]: Checked inductivity of 29 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:55:48,162 INFO ]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:55:48,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-06-22 01:55:48,162 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:55:48,162 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:55:48,162 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:55:48,162 INFO ]: Start difference. First operand 79 states and 105 transitions. Second operand 4 states. [2018-06-22 01:55:48,332 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:55:48,332 INFO ]: Finished difference Result 106 states and 141 transitions. [2018-06-22 01:55:48,333 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:55:48,333 INFO ]: Start accepts. Automaton has 4 states. Word has length 44 [2018-06-22 01:55:48,334 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:55:48,335 INFO ]: With dead ends: 106 [2018-06-22 01:55:48,335 INFO ]: Without dead ends: 106 [2018-06-22 01:55:48,335 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:55:48,336 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-22 01:55:48,361 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-06-22 01:55:48,361 INFO ]: Start removeUnreachable. Operand 106 states. [2018-06-22 01:55:48,363 INFO ]: Finished removeUnreachable. Reduced from 106 states to 106 states and 141 transitions. [2018-06-22 01:55:48,364 INFO ]: Start accepts. Automaton has 106 states and 141 transitions. Word has length 44 [2018-06-22 01:55:48,376 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:55:48,376 INFO ]: Abstraction has 106 states and 141 transitions. [2018-06-22 01:55:48,376 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:55:48,376 INFO ]: Start isEmpty. Operand 106 states and 141 transitions. [2018-06-22 01:55:48,381 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:55:48,381 INFO ]: Found error trace [2018-06-22 01:55:48,381 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:55:48,382 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:55:48,382 INFO ]: Analyzing trace with hash -240735404, now seen corresponding path program 1 times [2018-06-22 01:55:48,382 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:55:48,382 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:55:48,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:48,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:48,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:48,439 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:55:48,478 INFO ]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2018-06-22 01:55:48,478 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:55:48,478 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 01:55:48,497 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:55:48,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:55:48,564 INFO ]: Computing forward predicates... [2018-06-22 01:55:48,611 INFO ]: Checked inductivity of 34 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:55:48,652 INFO ]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:55:48,652 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-06-22 01:55:48,683 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:55:48,683 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:55:48,683 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:55:48,683 INFO ]: Start difference. First operand 106 states and 141 transitions. Second operand 4 states. [2018-06-22 01:55:49,116 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:55:49,116 INFO ]: Finished difference Result 143 states and 191 transitions. [2018-06-22 01:55:49,116 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:55:49,116 INFO ]: Start accepts. Automaton has 4 states. Word has length 44 [2018-06-22 01:55:49,117 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:55:49,118 INFO ]: With dead ends: 143 [2018-06-22 01:55:49,118 INFO ]: Without dead ends: 104 [2018-06-22 01:55:49,118 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 42 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:55:49,118 INFO ]: Start minimizeSevpa. Operand 104 states. [2018-06-22 01:55:49,145 INFO ]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-06-22 01:55:49,145 INFO ]: Start removeUnreachable. Operand 104 states. [2018-06-22 01:55:49,147 INFO ]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions. [2018-06-22 01:55:49,152 INFO ]: Start accepts. Automaton has 104 states and 131 transitions. Word has length 44 [2018-06-22 01:55:49,152 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:55:49,152 INFO ]: Abstraction has 104 states and 131 transitions. [2018-06-22 01:55:49,152 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:55:49,152 INFO ]: Start isEmpty. Operand 104 states and 131 transitions. [2018-06-22 01:55:49,154 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-22 01:55:49,154 INFO ]: Found error trace [2018-06-22 01:55:49,158 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:55:49,159 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:55:49,159 INFO ]: Analyzing trace with hash 549143271, now seen corresponding path program 1 times [2018-06-22 01:55:49,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:55:49,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:55:49,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:49,160 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:49,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:49,177 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-22 01:55:49,177 INFO ]: Advancing trace checker [2018-06-22 01:55:49,177 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-22 01:55:49,193 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:49,281 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:55:49,286 INFO ]: Computing forward predicates... [2018-06-22 01:55:49,432 INFO ]: Checked inductivity of 61 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 01:55:49,466 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:55:49,466 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:55:49,467 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:55:49,467 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:55:49,467 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:55:49,467 INFO ]: Start difference. First operand 104 states and 131 transitions. Second operand 4 states. [2018-06-22 01:55:50,093 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:55:50,094 INFO ]: Finished difference Result 126 states and 159 transitions. [2018-06-22 01:55:50,094 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:55:50,094 INFO ]: Start accepts. Automaton has 4 states. Word has length 58 [2018-06-22 01:55:50,094 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:55:50,095 INFO ]: With dead ends: 126 [2018-06-22 01:55:50,095 INFO ]: Without dead ends: 95 [2018-06-22 01:55:50,095 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:55:50,096 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 01:55:50,101 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-06-22 01:55:50,101 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-22 01:55:50,102 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2018-06-22 01:55:50,102 INFO ]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 58 [2018-06-22 01:55:50,103 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:55:50,103 INFO ]: Abstraction has 95 states and 113 transitions. [2018-06-22 01:55:50,103 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:55:50,103 INFO ]: Start isEmpty. Operand 95 states and 113 transitions. [2018-06-22 01:55:50,111 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 01:55:50,111 INFO ]: Found error trace [2018-06-22 01:55:50,111 INFO ]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:55:50,111 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:55:50,111 INFO ]: Analyzing trace with hash 535219524, now seen corresponding path program 1 times [2018-06-22 01:55:50,111 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:55:50,111 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:55:50,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:50,112 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:50,112 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:50,128 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-22 01:55:50,128 INFO ]: Advancing trace checker [2018-06-22 01:55:50,128 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-22 01:55:50,146 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:50,246 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:55:50,253 INFO ]: Computing forward predicates... [2018-06-22 01:55:50,314 INFO ]: Checked inductivity of 151 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-06-22 01:55:50,348 INFO ]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:55:50,348 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-06-22 01:55:50,349 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:55:50,349 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:55:50,349 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:55:50,349 INFO ]: Start difference. First operand 95 states and 113 transitions. Second operand 4 states. [2018-06-22 01:55:50,672 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:55:50,672 INFO ]: Finished difference Result 120 states and 145 transitions. [2018-06-22 01:55:50,673 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:55:50,673 INFO ]: Start accepts. Automaton has 4 states. Word has length 85 [2018-06-22 01:55:50,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:55:50,675 INFO ]: With dead ends: 120 [2018-06-22 01:55:50,675 INFO ]: Without dead ends: 120 [2018-06-22 01:55:50,675 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 83 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:55:50,675 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-22 01:55:50,685 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-06-22 01:55:50,685 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-22 01:55:50,687 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 145 transitions. [2018-06-22 01:55:50,687 INFO ]: Start accepts. Automaton has 120 states and 145 transitions. Word has length 85 [2018-06-22 01:55:50,687 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:55:50,687 INFO ]: Abstraction has 120 states and 145 transitions. [2018-06-22 01:55:50,687 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:55:50,687 INFO ]: Start isEmpty. Operand 120 states and 145 transitions. [2018-06-22 01:55:50,689 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 01:55:50,690 INFO ]: Found error trace [2018-06-22 01:55:50,690 INFO ]: trace histogram [8, 8, 8, 8, 8, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:55:50,690 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:55:50,690 INFO ]: Analyzing trace with hash 2049756674, now seen corresponding path program 1 times [2018-06-22 01:55:50,690 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:55:50,690 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:55:50,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:50,691 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:50,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:50,719 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-22 01:55:50,719 INFO ]: Advancing trace checker [2018-06-22 01:55:50,719 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-22 01:55:50,731 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:50,881 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:55:50,887 INFO ]: Computing forward predicates... [2018-06-22 01:55:51,012 INFO ]: Checked inductivity of 269 backedges. 64 proven. 19 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-06-22 01:55:51,047 INFO ]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:55:51,047 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-06-22 01:55:51,048 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:55:51,048 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:55:51,048 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:55:51,048 INFO ]: Start difference. First operand 120 states and 145 transitions. Second operand 4 states. [2018-06-22 01:55:51,280 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:55:51,280 INFO ]: Finished difference Result 141 states and 170 transitions. [2018-06-22 01:55:51,280 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:55:51,280 INFO ]: Start accepts. Automaton has 4 states. Word has length 109 [2018-06-22 01:55:51,281 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:55:51,298 INFO ]: With dead ends: 141 [2018-06-22 01:55:51,298 INFO ]: Without dead ends: 141 [2018-06-22 01:55:51,299 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 107 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:55:51,299 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 01:55:51,309 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-06-22 01:55:51,309 INFO ]: Start removeUnreachable. Operand 141 states. [2018-06-22 01:55:51,310 INFO ]: Finished removeUnreachable. Reduced from 141 states to 141 states and 170 transitions. [2018-06-22 01:55:51,310 INFO ]: Start accepts. Automaton has 141 states and 170 transitions. Word has length 109 [2018-06-22 01:55:51,311 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:55:51,311 INFO ]: Abstraction has 141 states and 170 transitions. [2018-06-22 01:55:51,311 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:55:51,311 INFO ]: Start isEmpty. Operand 141 states and 170 transitions. [2018-06-22 01:55:51,313 INFO ]: Finished isEmpty. Found accepting run of length 124 [2018-06-22 01:55:51,313 INFO ]: Found error trace [2018-06-22 01:55:51,314 INFO ]: trace histogram [9, 9, 9, 9, 9, 8, 7, 6, 5, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:55:51,314 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:55:51,314 INFO ]: Analyzing trace with hash -1648416522, now seen corresponding path program 1 times [2018-06-22 01:55:51,314 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:55:51,314 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:55:51,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:51,315 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:51,315 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:55:51,329 ERROR]: Caught known exception: Unsupported non-linear arithmetic [2018-06-22 01:55:51,329 INFO ]: Advancing trace checker [2018-06-22 01:55:51,329 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-06-22 01:55:51,342 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:55:51,493 INFO ]: Conjunction of SSA is sat [2018-06-22 01:55:51,518 INFO ]: Counterexample might be feasible [2018-06-22 01:55:51,555 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:55:51 BoogieIcfgContainer [2018-06-22 01:55:51,555 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:55:51,557 INFO ]: Toolchain (without parser) took 9163.42 ms. Allocated memory was 308.8 MB in the beginning and 397.9 MB in the end (delta: 89.1 MB). Free memory was 212.3 MB in the beginning and 327.2 MB in the end (delta: -114.9 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:55:51,558 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:55:51,558 INFO ]: ChcToBoogie took 80.98 ms. Allocated memory is still 308.8 MB. Free memory was 212.3 MB in the beginning and 207.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:55:51,559 INFO ]: Boogie Preprocessor took 75.63 ms. Allocated memory is still 308.8 MB. Free memory was 207.3 MB in the beginning and 204.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:55:51,559 INFO ]: RCFGBuilder took 1427.44 ms. Allocated memory was 308.8 MB in the beginning and 329.3 MB in the end (delta: 20.4 MB). Free memory was 204.3 MB in the beginning and 267.5 MB in the end (delta: -63.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:55:51,559 INFO ]: TraceAbstraction took 7569.97 ms. Allocated memory was 329.3 MB in the beginning and 397.9 MB in the end (delta: 68.7 MB). Free memory was 265.9 MB in the beginning and 327.2 MB in the end (delta: -61.2 MB). Peak memory consumption was 7.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:55:51,561 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 80.98 ms. Allocated memory is still 308.8 MB. Free memory was 212.3 MB in the beginning and 207.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 75.63 ms. Allocated memory is still 308.8 MB. Free memory was 207.3 MB in the beginning and 204.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1427.44 ms. Allocated memory was 308.8 MB in the beginning and 329.3 MB in the end (delta: 20.4 MB). Free memory was 204.3 MB in the beginning and 267.5 MB in the end (delta: -63.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 7569.97 ms. Allocated memory was 329.3 MB in the beginning and 397.9 MB in the end (delta: 68.7 MB). Free memory was 265.9 MB in the beginning and 327.2 MB in the end (delta: -61.2 MB). Peak memory consumption was 7.4 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, 0, 0, 0, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 12) [L0] COND FALSE !(gotoSwitch == 11) [L0] COND FALSE !(gotoSwitch == 9) [L0] COND FALSE !(gotoSwitch == 8) [L0] COND FALSE !(gotoSwitch == 6) [L0] COND FALSE !(gotoSwitch == 4) [L0] COND FALSE !(gotoSwitch == 2) [L0] assume true; [L0] hhv_failDLRunknownCLN153_0_Int := hbv_False_1_Int; [L0] havoc hbv_False_1_Int; [L0] assume (((((((((((((hbv_failDLRunknownCLN153_9_Int == -1 && hbv_failDLRunknownCLN153_13_Int == hbv_failDLRunknownCLN153_4_Int + hbv_failDLRunknownCLN153_5_Int) && hbv_failDLRunknownCLN153_1_Int == -1) && !((0 == hbv_failDLRunknownCLN153_12_Int || !(hbv_failDLRunknownCLN153_13_Int >= 0)) && (hbv_failDLRunknownCLN153_13_Int >= 0 || !(0 == hbv_failDLRunknownCLN153_12_Int)))) && !(0 == hbv_failDLRunknownCLN153_14_Int)) && hbv_failDLRunknownCLN153_5_Int == -hbv_failDLRunknownCLN153_6_Int) && 0 == hbv_failDLRunknownCLN153_11_Int) && hbv_failDLRunknownCLN153_2_Int == -hbv_failDLRunknownCLN153_15_Int) && hbv_failDLRunknownCLN153_3_Int == hbv_failDLRunknownCLN153_1_Int + hbv_failDLRunknownCLN153_2_Int) && hbv_failDLRunknownCLN153_4_Int == -1) && hbv_failDLRunknownCLN153_7_Int == hbv_failDLRunknownCLN153_9_Int + hbv_failDLRunknownCLN153_10_Int) && hbv_failDLRunknownCLN153_10_Int == -hbv_failDLRunknownCLN153_6_Int) && !(((0 == hbv_failDLRunknownCLN153_12_Int || 0 == hbv_failDLRunknownCLN153_8_Int) || 0 == hbv_failDLRunknownCLN153_11_Int) && (!(0 == hbv_failDLRunknownCLN153_11_Int) || (!(0 == hbv_failDLRunknownCLN153_8_Int) && !(0 == hbv_failDLRunknownCLN153_12_Int))))) && hhv_failDLRunknownCLN153_0_Int == 1) && !((!(hbv_failDLRunknownCLN153_3_Int > hbv_failDLRunknownCLN153_7_Int) || 0 == hbv_failDLRunknownCLN153_8_Int) && (!(0 == hbv_failDLRunknownCLN153_8_Int) || hbv_failDLRunknownCLN153_3_Int > hbv_failDLRunknownCLN153_7_Int)); [L0] hhv_f5_1044DLRunknownCLN110_0_Int, hhv_f5_1044DLRunknownCLN110_1_Int, hhv_f5_1044DLRunknownCLN110_2_Int, hhv_f5_1044DLRunknownCLN110_3_Int, hhv_f5_1044DLRunknownCLN110_4_Int, hhv_f5_1044DLRunknownCLN110_5_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int := hbv_failDLRunknownCLN153_15_Int, hbv_failDLRunknownCLN153_14_Int, hbv_failDLRunknownCLN153_6_Int, hbv_failDLRunknownCLN153_16_Int, hbv_failDLRunknownCLN153_17_Int, hbv_failDLRunknownCLN153_18_Int, hbv_failDLRunknownCLN153_19_Int, hbv_failDLRunknownCLN153_20_Int; [L0] havoc hbv_failDLRunknownCLN153_11_Int, hbv_failDLRunknownCLN153_14_Int, hbv_failDLRunknownCLN153_18_Int, hbv_failDLRunknownCLN153_5_Int, hbv_failDLRunknownCLN153_16_Int, hbv_failDLRunknownCLN153_12_Int, hbv_failDLRunknownCLN153_7_Int, hbv_failDLRunknownCLN153_8_Int, hbv_failDLRunknownCLN153_10_Int, hbv_failDLRunknownCLN153_2_Int, hbv_failDLRunknownCLN153_13_Int, hbv_failDLRunknownCLN153_19_Int, hbv_failDLRunknownCLN153_9_Int, hbv_failDLRunknownCLN153_20_Int, hbv_failDLRunknownCLN153_15_Int, hbv_failDLRunknownCLN153_17_Int, hbv_failDLRunknownCLN153_1_Int, hbv_failDLRunknownCLN153_3_Int, hbv_failDLRunknownCLN153_4_Int, hbv_failDLRunknownCLN153_6_Int; [L0] assume hbv_f5_1044DLRunknownCLN110_1_Int == 0; [L0] CALL call gotoProc(4, hhv_f5_1044DLRunknownCLN110_0_Int, hhv_f5_1044DLRunknownCLN110_1_Int, hhv_f5_1044DLRunknownCLN110_2_Int, hhv_f5_1044DLRunknownCLN110_3_Int, hhv_f5_1044DLRunknownCLN110_4_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, hbv_f5_1044DLRunknownCLN110_1_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, hhv_f5_1044DLRunknownCLN110_5_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 12) [L0] COND FALSE !(gotoSwitch == 11) [L0] COND FALSE !(gotoSwitch == 9) [L0] COND FALSE !(gotoSwitch == 8) [L0] COND FALSE !(gotoSwitch == 6) [L0] COND TRUE gotoSwitch == 4 [L0] hhv_f3_1038DLRunknownCLN74_0_Int, hhv_f3_1038DLRunknownCLN74_1_Int, hhv_f3_1038DLRunknownCLN74_2_Int, hhv_f3_1038DLRunknownCLN74_3_Int, hhv_f3_1038DLRunknownCLN74_4_Int, hhv_f3_1038DLRunknownCLN74_5_Int, hhv_f3_1038DLRunknownCLN74_6_Int, hhv_f3_1038DLRunknownCLN74_7_Int, hhv_f3_1038DLRunknownCLN74_8_Int, hhv_f3_1038DLRunknownCLN74_9_Int, hhv_f3_1038DLRunknownCLN74_10_Int, hhv_f3_1038DLRunknownCLN74_11_Int, hhv_f3_1038DLRunknownCLN74_12_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, gpav_10_Int, gpav_11_Int, gpav_12_Int; [L0] assume ((((hbv_f3_1038DLRunknownCLN74_3_Int == hbv_f3_1038DLRunknownCLN74_5_Int * hhv_f3_1038DLRunknownCLN74_7_Int && hbv_f3_1038DLRunknownCLN74_4_Int == hbv_f3_1038DLRunknownCLN74_3_Int + hbv_f3_1038DLRunknownCLN74_2_Int) && hbv_f3_1038DLRunknownCLN74_1_Int == 0) && hbv_f3_1038DLRunknownCLN74_2_Int == 0) && hbv_f3_1038DLRunknownCLN74_6_Int == 0) && hbv_f3_1038DLRunknownCLN74_5_Int == 0; [L0] CALL call gotoProc(6, hhv_f3_1038DLRunknownCLN74_0_Int, hhv_f3_1038DLRunknownCLN74_1_Int, hhv_f3_1038DLRunknownCLN74_2_Int, hhv_f3_1038DLRunknownCLN74_3_Int, hhv_f3_1038DLRunknownCLN74_4_Int, hhv_f3_1038DLRunknownCLN74_5_Int, hhv_f3_1038DLRunknownCLN74_6_Int, hbv_f3_1038DLRunknownCLN74_4_Int, hhv_f3_1038DLRunknownCLN74_5_Int, hhv_f3_1038DLRunknownCLN74_6_Int, hhv_f3_1038DLRunknownCLN74_10_Int, hhv_f3_1038DLRunknownCLN74_5_Int, hhv_f3_1038DLRunknownCLN74_6_Int, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 12) [L0] COND FALSE !(gotoSwitch == 11) [L0] COND FALSE !(gotoSwitch == 9) [L0] COND FALSE !(gotoSwitch == 8) [L0] COND TRUE gotoSwitch == 6 [L0] hhv_f2_1034DLRunknownCLN31_0_Int, hhv_f2_1034DLRunknownCLN31_1_Int, hhv_f2_1034DLRunknownCLN31_2_Int, hhv_f2_1034DLRunknownCLN31_3_Int, hhv_f2_1034DLRunknownCLN31_4_Int, hhv_f2_1034DLRunknownCLN31_5_Int, hhv_f2_1034DLRunknownCLN31_6_Int, hhv_f2_1034DLRunknownCLN31_7_Int, hhv_f2_1034DLRunknownCLN31_8_Int, hhv_f2_1034DLRunknownCLN31_9_Int, hhv_f2_1034DLRunknownCLN31_10_Int, hhv_f2_1034DLRunknownCLN31_11_Int, hhv_f2_1034DLRunknownCLN31_12_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, gpav_10_Int, gpav_11_Int, gpav_12_Int; [L0] assume (((((((hhv_f2_1034DLRunknownCLN31_3_Int == hhv_f2_1034DLRunknownCLN31_0_Int && hbv_f2_1034DLRunknownCLN31_3_Int == 0) && hhv_f2_1034DLRunknownCLN31_4_Int == hhv_f2_1034DLRunknownCLN31_1_Int) && hbv_f2_1034DLRunknownCLN31_4_Int == hbv_f2_1034DLRunknownCLN31_7_Int * hhv_f2_1034DLRunknownCLN31_7_Int) && hhv_f2_1034DLRunknownCLN31_2_Int == hbv_f2_1034DLRunknownCLN31_1_Int + hbv_f2_1034DLRunknownCLN31_2_Int) && hbv_f2_1034DLRunknownCLN31_5_Int == 0) && hbv_f2_1034DLRunknownCLN31_1_Int == hbv_f2_1034DLRunknownCLN31_5_Int * hbv_f2_1034DLRunknownCLN31_6_Int) && hbv_f2_1034DLRunknownCLN31_2_Int == hbv_f2_1034DLRunknownCLN31_4_Int + hbv_f2_1034DLRunknownCLN31_3_Int) && hbv_f2_1034DLRunknownCLN31_7_Int == 0; [L0] hhv_f2_1034DLRunknownCLN53_0_Int, hhv_f2_1034DLRunknownCLN53_1_Int, hhv_f2_1034DLRunknownCLN53_2_Int, hhv_f2_1034DLRunknownCLN53_3_Int, hhv_f2_1034DLRunknownCLN53_4_Int, hhv_f2_1034DLRunknownCLN53_5_Int, hhv_f2_1034DLRunknownCLN53_6_Int, hhv_f2_1034DLRunknownCLN53_7_Int, hhv_f2_1034DLRunknownCLN53_8_Int, hhv_f2_1034DLRunknownCLN53_9_Int, hhv_f2_1034DLRunknownCLN53_10_Int, hhv_f2_1034DLRunknownCLN53_11_Int, hhv_f2_1034DLRunknownCLN53_12_Int := hhv_f2_1034DLRunknownCLN31_0_Int, hhv_f2_1034DLRunknownCLN31_1_Int, hbv_f2_1034DLRunknownCLN31_6_Int, hbv_f2_1034DLRunknownCLN31_8_Int, hbv_f2_1034DLRunknownCLN31_9_Int, hhv_f2_1034DLRunknownCLN31_5_Int, hhv_f2_1034DLRunknownCLN31_6_Int, hhv_f2_1034DLRunknownCLN31_7_Int, hhv_f2_1034DLRunknownCLN31_8_Int, hhv_f2_1034DLRunknownCLN31_9_Int, hhv_f2_1034DLRunknownCLN31_10_Int, hhv_f2_1034DLRunknownCLN31_11_Int, hhv_f2_1034DLRunknownCLN31_12_Int; [L0] havoc hbv_f2_1034DLRunknownCLN31_6_Int, hbv_f2_1034DLRunknownCLN31_9_Int, hbv_f2_1034DLRunknownCLN31_5_Int, hbv_f2_1034DLRunknownCLN31_4_Int, hbv_f2_1034DLRunknownCLN31_3_Int, hbv_f2_1034DLRunknownCLN31_1_Int, hbv_f2_1034DLRunknownCLN31_7_Int, hbv_f2_1034DLRunknownCLN31_8_Int, hbv_f2_1034DLRunknownCLN31_2_Int; [L0] assume ((((((((((hhv_f2_1034DLRunknownCLN53_12_Int == hhv_f2_1034DLRunknownCLN53_6_Int && hbv_f2_1034DLRunknownCLN53_5_Int == hbv_f2_1034DLRunknownCLN53_3_Int * hbv_f2_1034DLRunknownCLN53_4_Int) && hhv_f2_1034DLRunknownCLN53_11_Int == hhv_f2_1034DLRunknownCLN53_5_Int) && hbv_f2_1034DLRunknownCLN53_3_Int == 0) && hbv_f2_1034DLRunknownCLN53_2_Int == 0) && hhv_f2_1034DLRunknownCLN53_8_Int == hhv_f2_1034DLRunknownCLN53_5_Int) && hbv_f2_1034DLRunknownCLN53_1_Int == 0) && hhv_f2_1034DLRunknownCLN53_9_Int == hhv_f2_1034DLRunknownCLN53_6_Int) && hbv_f2_1034DLRunknownCLN53_7_Int == hbv_f2_1034DLRunknownCLN53_8_Int * hbv_f2_1034DLRunknownCLN53_4_Int) && hbv_f2_1034DLRunknownCLN53_8_Int == 0) && hhv_f2_1034DLRunknownCLN53_7_Int == hbv_f2_1034DLRunknownCLN53_7_Int + hbv_f2_1034DLRunknownCLN53_2_Int) && hbv_f2_1034DLRunknownCLN53_6_Int == hbv_f2_1034DLRunknownCLN53_5_Int + hbv_f2_1034DLRunknownCLN53_1_Int; [L0] CALL call gotoProc(8, hhv_f2_1034DLRunknownCLN53_0_Int, hhv_f2_1034DLRunknownCLN53_1_Int, hhv_f2_1034DLRunknownCLN53_2_Int, hhv_f2_1034DLRunknownCLN53_3_Int, hhv_f2_1034DLRunknownCLN53_4_Int, hhv_f2_1034DLRunknownCLN53_5_Int, hhv_f2_1034DLRunknownCLN53_6_Int, hbv_f2_1034DLRunknownCLN53_6_Int, hhv_f2_1034DLRunknownCLN53_5_Int, hhv_f2_1034DLRunknownCLN53_6_Int, hhv_f2_1034DLRunknownCLN53_5_Int, hhv_f2_1034DLRunknownCLN53_6_Int, hbv_f2_1034DLRunknownCLN53_4_Int, hbv_f2_1034DLRunknownCLN53_9_Int, hbv_f2_1034DLRunknownCLN53_10_Int, hhv_f2_1034DLRunknownCLN53_10_Int, hbv_f2_1034DLRunknownCLN53_11_Int, hbv_f2_1034DLRunknownCLN53_12_Int); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 12) [L0] COND FALSE !(gotoSwitch == 11) [L0] COND FALSE !(gotoSwitch == 9) [L0] COND TRUE gotoSwitch == 8 [L0] hhv_f3_1038DLRunknownCLN79_0_Int, hhv_f3_1038DLRunknownCLN79_1_Int, hhv_f3_1038DLRunknownCLN79_2_Int, hhv_f3_1038DLRunknownCLN79_3_Int, hhv_f3_1038DLRunknownCLN79_4_Int, hhv_f3_1038DLRunknownCLN79_5_Int, hhv_f3_1038DLRunknownCLN79_6_Int, hhv_f3_1038DLRunknownCLN79_7_Int, hhv_f3_1038DLRunknownCLN79_8_Int, hhv_f3_1038DLRunknownCLN79_9_Int, hhv_f3_1038DLRunknownCLN79_10_Int, hhv_f3_1038DLRunknownCLN79_11_Int, hhv_f3_1038DLRunknownCLN79_12_Int, hhv_f3_1038DLRunknownCLN79_13_Int, hhv_f3_1038DLRunknownCLN79_14_Int, hhv_f3_1038DLRunknownCLN79_15_Int, hhv_f3_1038DLRunknownCLN79_16_Int, hhv_f3_1038DLRunknownCLN79_17_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, gpav_10_Int, gpav_11_Int, gpav_12_Int, gpav_13_Int, gpav_14_Int, gpav_15_Int, gpav_16_Int, gpav_17_Int; [L0] assume (((hhv_f3_1038DLRunknownCLN79_14_Int == hhv_f3_1038DLRunknownCLN79_11_Int && hhv_f3_1038DLRunknownCLN79_16_Int == hhv_f3_1038DLRunknownCLN79_10_Int) && hhv_f3_1038DLRunknownCLN79_12_Int == 0) && hhv_f3_1038DLRunknownCLN79_17_Int == hhv_f3_1038DLRunknownCLN79_11_Int) && hhv_f3_1038DLRunknownCLN79_13_Int == hhv_f3_1038DLRunknownCLN79_10_Int; [L0] CALL call gotoProc(9, hhv_f3_1038DLRunknownCLN79_0_Int, hhv_f3_1038DLRunknownCLN79_1_Int, hhv_f3_1038DLRunknownCLN79_2_Int, hhv_f3_1038DLRunknownCLN79_3_Int, hhv_f3_1038DLRunknownCLN79_4_Int, hhv_f3_1038DLRunknownCLN79_5_Int, hhv_f3_1038DLRunknownCLN79_6_Int, hhv_f3_1038DLRunknownCLN79_7_Int, hhv_f3_1038DLRunknownCLN79_8_Int, hhv_f3_1038DLRunknownCLN79_9_Int, hhv_f3_1038DLRunknownCLN79_15_Int, hhv_f3_1038DLRunknownCLN79_10_Int, hhv_f3_1038DLRunknownCLN79_11_Int, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 12) [L0] COND FALSE !(gotoSwitch == 11) [L0] COND TRUE gotoSwitch == 9 [L0] hhv_f5_1044DLRunknownCLN115_0_Int, hhv_f5_1044DLRunknownCLN115_1_Int, hhv_f5_1044DLRunknownCLN115_2_Int, hhv_f5_1044DLRunknownCLN115_3_Int, hhv_f5_1044DLRunknownCLN115_4_Int, hhv_f5_1044DLRunknownCLN115_5_Int, hhv_f5_1044DLRunknownCLN115_6_Int, hhv_f5_1044DLRunknownCLN115_7_Int, hhv_f5_1044DLRunknownCLN115_8_Int, hhv_f5_1044DLRunknownCLN115_9_Int, hhv_f5_1044DLRunknownCLN115_10_Int, hhv_f5_1044DLRunknownCLN115_11_Int, hhv_f5_1044DLRunknownCLN115_12_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, gpav_10_Int, gpav_11_Int, gpav_12_Int; [L0] assume hbv_f5_1044DLRunknownCLN115_1_Int == 1 && 0 == hhv_f5_1044DLRunknownCLN115_6_Int; [L0] CALL call gotoProc(2, hhv_f5_1044DLRunknownCLN115_5_Int, hhv_f5_1044DLRunknownCLN115_6_Int, hhv_f5_1044DLRunknownCLN115_7_Int, hhv_f5_1044DLRunknownCLN115_8_Int, hhv_f5_1044DLRunknownCLN115_9_Int, hhv_f5_1044DLRunknownCLN115_10_Int, hhv_f5_1044DLRunknownCLN115_11_Int, hhv_f5_1044DLRunknownCLN115_12_Int, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 12) [L0] COND FALSE !(gotoSwitch == 11) [L0] COND FALSE !(gotoSwitch == 9) [L0] COND FALSE !(gotoSwitch == 8) [L0] COND FALSE !(gotoSwitch == 6) [L0] COND FALSE !(gotoSwitch == 4) [L0] COND TRUE gotoSwitch == 2 [L0] hhv_f5_1044DLRunknownCLN110_0_Int, hhv_f5_1044DLRunknownCLN110_1_Int, hhv_f5_1044DLRunknownCLN110_2_Int, hhv_f5_1044DLRunknownCLN110_3_Int, hhv_f5_1044DLRunknownCLN110_4_Int, hhv_f5_1044DLRunknownCLN110_5_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_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; [L0] assume hbv_f5_1044DLRunknownCLN110_1_Int == 0; [L0] CALL call gotoProc(4, hhv_f5_1044DLRunknownCLN110_0_Int, hhv_f5_1044DLRunknownCLN110_1_Int, hhv_f5_1044DLRunknownCLN110_2_Int, hhv_f5_1044DLRunknownCLN110_3_Int, hhv_f5_1044DLRunknownCLN110_4_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, hbv_f5_1044DLRunknownCLN110_1_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, hhv_f5_1044DLRunknownCLN110_5_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 12) [L0] COND FALSE !(gotoSwitch == 11) [L0] COND FALSE !(gotoSwitch == 9) [L0] COND FALSE !(gotoSwitch == 8) [L0] COND FALSE !(gotoSwitch == 6) [L0] COND TRUE gotoSwitch == 4 [L0] hhv_f3_1038DLRunknownCLN74_0_Int, hhv_f3_1038DLRunknownCLN74_1_Int, hhv_f3_1038DLRunknownCLN74_2_Int, hhv_f3_1038DLRunknownCLN74_3_Int, hhv_f3_1038DLRunknownCLN74_4_Int, hhv_f3_1038DLRunknownCLN74_5_Int, hhv_f3_1038DLRunknownCLN74_6_Int, hhv_f3_1038DLRunknownCLN74_7_Int, hhv_f3_1038DLRunknownCLN74_8_Int, hhv_f3_1038DLRunknownCLN74_9_Int, hhv_f3_1038DLRunknownCLN74_10_Int, hhv_f3_1038DLRunknownCLN74_11_Int, hhv_f3_1038DLRunknownCLN74_12_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, gpav_10_Int, gpav_11_Int, gpav_12_Int; [L0] assume ((((((((((hhv_f3_1038DLRunknownCLN74_2_Int == hbv_f3_1038DLRunknownCLN74_4_Int + hbv_f3_1038DLRunknownCLN74_1_Int && hhv_f3_1038DLRunknownCLN74_5_Int == hhv_f3_1038DLRunknownCLN74_0_Int) && hbv_f3_1038DLRunknownCLN74_3_Int == 0) && hbv_f3_1038DLRunknownCLN74_7_Int == 0) && hbv_f3_1038DLRunknownCLN74_1_Int == 0) && hhv_f3_1038DLRunknownCLN74_6_Int == hhv_f3_1038DLRunknownCLN74_1_Int) && hhv_f3_1038DLRunknownCLN74_4_Int == hhv_f3_1038DLRunknownCLN74_1_Int) && hbv_f3_1038DLRunknownCLN74_5_Int == hbv_f3_1038DLRunknownCLN74_7_Int * hhv_f3_1038DLRunknownCLN74_7_Int) && hbv_f3_1038DLRunknownCLN74_6_Int == hbv_f3_1038DLRunknownCLN74_5_Int + hbv_f3_1038DLRunknownCLN74_2_Int) && hhv_f3_1038DLRunknownCLN74_3_Int == hhv_f3_1038DLRunknownCLN74_0_Int) && hbv_f3_1038DLRunknownCLN74_2_Int == 0) && hbv_f3_1038DLRunknownCLN74_4_Int == hbv_f3_1038DLRunknownCLN74_3_Int * hhv_f3_1038DLRunknownCLN74_7_Int; [L0] hhv_f3_1038DLRunknownCLN69_0_Int, hhv_f3_1038DLRunknownCLN69_1_Int, hhv_f3_1038DLRunknownCLN69_2_Int, hhv_f3_1038DLRunknownCLN69_3_Int, hhv_f3_1038DLRunknownCLN69_4_Int, hhv_f3_1038DLRunknownCLN69_5_Int, hhv_f3_1038DLRunknownCLN69_6_Int, hhv_f3_1038DLRunknownCLN69_7_Int := hhv_f3_1038DLRunknownCLN74_0_Int, hhv_f3_1038DLRunknownCLN74_1_Int, hhv_f3_1038DLRunknownCLN74_7_Int, hhv_f3_1038DLRunknownCLN74_8_Int, hhv_f3_1038DLRunknownCLN74_9_Int, hhv_f3_1038DLRunknownCLN74_10_Int, hhv_f3_1038DLRunknownCLN74_11_Int, hhv_f3_1038DLRunknownCLN74_12_Int; [L0] havoc hbv_f3_1038DLRunknownCLN74_4_Int, hbv_f3_1038DLRunknownCLN74_6_Int, hbv_f3_1038DLRunknownCLN74_1_Int, hbv_f3_1038DLRunknownCLN74_5_Int, hbv_f3_1038DLRunknownCLN74_3_Int, hbv_f3_1038DLRunknownCLN74_2_Int, hbv_f3_1038DLRunknownCLN74_7_Int; [L0] assume (((hhv_f3_1038DLRunknownCLN69_4_Int == hhv_f3_1038DLRunknownCLN69_1_Int && hhv_f3_1038DLRunknownCLN69_7_Int == hhv_f3_1038DLRunknownCLN69_1_Int) && hhv_f3_1038DLRunknownCLN69_2_Int == 0) && hhv_f3_1038DLRunknownCLN69_6_Int == hhv_f3_1038DLRunknownCLN69_0_Int) && hhv_f3_1038DLRunknownCLN69_3_Int == hhv_f3_1038DLRunknownCLN69_0_Int; [L0] hhv_main_1047DLRunknownCLN157_0_Int, hhv_main_1047DLRunknownCLN157_1_Int, hhv_main_1047DLRunknownCLN157_2_Int := hhv_f3_1038DLRunknownCLN69_5_Int, hhv_f3_1038DLRunknownCLN69_0_Int, hhv_f3_1038DLRunknownCLN69_1_Int; [L0] assume (hhv_main_1047DLRunknownCLN157_1_Int == 0 && hhv_main_1047DLRunknownCLN157_2_Int == 0) && hhv_main_1047DLRunknownCLN157_0_Int == 1; [L0] RET call gotoProc(4, hhv_f5_1044DLRunknownCLN110_0_Int, hhv_f5_1044DLRunknownCLN110_1_Int, hhv_f5_1044DLRunknownCLN110_2_Int, hhv_f5_1044DLRunknownCLN110_3_Int, hhv_f5_1044DLRunknownCLN110_4_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, hbv_f5_1044DLRunknownCLN110_1_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, hhv_f5_1044DLRunknownCLN110_5_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, 0, 0, 0, 0, 0); [L0] hhv_main_1047DLRunknownCLN157_0_Int, hhv_main_1047DLRunknownCLN157_1_Int, hhv_main_1047DLRunknownCLN157_2_Int := hhv_f5_1044DLRunknownCLN110_5_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int; [L0] havoc hbv_f5_1044DLRunknownCLN110_1_Int; [L0] assume (hhv_main_1047DLRunknownCLN157_1_Int == 0 && hhv_main_1047DLRunknownCLN157_2_Int == 0) && hhv_main_1047DLRunknownCLN157_0_Int == 1; [L0] RET call gotoProc(2, hhv_f5_1044DLRunknownCLN115_5_Int, hhv_f5_1044DLRunknownCLN115_6_Int, hhv_f5_1044DLRunknownCLN115_7_Int, hhv_f5_1044DLRunknownCLN115_8_Int, hhv_f5_1044DLRunknownCLN115_9_Int, hhv_f5_1044DLRunknownCLN115_10_Int, hhv_f5_1044DLRunknownCLN115_11_Int, hhv_f5_1044DLRunknownCLN115_12_Int, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] hhv_f5_without_checking_1690DLRunknownCLN140_0_Int, hhv_f5_without_checking_1690DLRunknownCLN140_1_Int, hhv_f5_without_checking_1690DLRunknownCLN140_2_Int, hhv_f5_without_checking_1690DLRunknownCLN140_3_Int, hhv_f5_without_checking_1690DLRunknownCLN140_4_Int, hhv_f5_without_checking_1690DLRunknownCLN140_5_Int, hhv_f5_without_checking_1690DLRunknownCLN140_6_Int, hhv_f5_without_checking_1690DLRunknownCLN140_7_Int, hhv_f5_without_checking_1690DLRunknownCLN140_8_Int, hhv_f5_without_checking_1690DLRunknownCLN140_9_Int, hhv_f5_without_checking_1690DLRunknownCLN140_10_Int, hhv_f5_without_checking_1690DLRunknownCLN140_11_Int, hhv_f5_without_checking_1690DLRunknownCLN140_12_Int := hhv_f5_1044DLRunknownCLN115_0_Int, hhv_f5_1044DLRunknownCLN115_1_Int, hhv_f5_1044DLRunknownCLN115_2_Int, hhv_f5_1044DLRunknownCLN115_3_Int, hhv_f5_1044DLRunknownCLN115_4_Int, hhv_f5_1044DLRunknownCLN115_5_Int, hhv_f5_1044DLRunknownCLN115_6_Int, hhv_f5_1044DLRunknownCLN115_7_Int, hhv_f5_1044DLRunknownCLN115_8_Int, hhv_f5_1044DLRunknownCLN115_9_Int, hhv_f5_1044DLRunknownCLN115_10_Int, hhv_f5_1044DLRunknownCLN115_11_Int, hhv_f5_1044DLRunknownCLN115_12_Int; [L0] havoc hbv_f5_1044DLRunknownCLN115_1_Int; [L0] assume ((((((hbv_f5_without_checking_1690DLRunknownCLN140_3_Int == 0 && hhv_f5_without_checking_1690DLRunknownCLN140_1_Int == 1) && hhv_f5_without_checking_1690DLRunknownCLN140_7_Int == hhv_f5_without_checking_1690DLRunknownCLN140_0_Int) && hbv_f5_without_checking_1690DLRunknownCLN140_2_Int == hbv_f5_without_checking_1690DLRunknownCLN140_1_Int * hhv_f5_without_checking_1690DLRunknownCLN140_0_Int) && hbv_f5_without_checking_1690DLRunknownCLN140_1_Int == 0) && hhv_f5_without_checking_1690DLRunknownCLN140_4_Int == hhv_f5_without_checking_1690DLRunknownCLN140_1_Int) && hhv_f5_without_checking_1690DLRunknownCLN140_2_Int == hbv_f5_without_checking_1690DLRunknownCLN140_2_Int + hbv_f5_without_checking_1690DLRunknownCLN140_3_Int) && hhv_f5_without_checking_1690DLRunknownCLN140_3_Int == hhv_f5_without_checking_1690DLRunknownCLN140_0_Int; [L0] hhv_f5_without_checking_1690DLRunknownCLN135_0_Int, hhv_f5_without_checking_1690DLRunknownCLN135_1_Int, hhv_f5_without_checking_1690DLRunknownCLN135_2_Int, hhv_f5_without_checking_1690DLRunknownCLN135_3_Int, hhv_f5_without_checking_1690DLRunknownCLN135_4_Int, hhv_f5_without_checking_1690DLRunknownCLN135_5_Int, hhv_f5_without_checking_1690DLRunknownCLN135_6_Int, hhv_f5_without_checking_1690DLRunknownCLN135_7_Int := hhv_f5_without_checking_1690DLRunknownCLN140_5_Int, hhv_f5_without_checking_1690DLRunknownCLN140_6_Int, hhv_f5_without_checking_1690DLRunknownCLN140_0_Int, hhv_f5_without_checking_1690DLRunknownCLN140_8_Int, hhv_f5_without_checking_1690DLRunknownCLN140_9_Int, hhv_f5_without_checking_1690DLRunknownCLN140_10_Int, hhv_f5_without_checking_1690DLRunknownCLN140_11_Int, hhv_f5_without_checking_1690DLRunknownCLN140_12_Int; [L0] havoc hbv_f5_without_checking_1690DLRunknownCLN140_3_Int, hbv_f5_without_checking_1690DLRunknownCLN140_2_Int, hbv_f5_without_checking_1690DLRunknownCLN140_1_Int; [L0] assume 0 == hhv_f5_without_checking_1690DLRunknownCLN135_1_Int && hbv_f5_without_checking_1690DLRunknownCLN135_1_Int == 1; [L0] hhv_f5_1044DLRunknownCLN110_0_Int, hhv_f5_1044DLRunknownCLN110_1_Int, hhv_f5_1044DLRunknownCLN110_2_Int, hhv_f5_1044DLRunknownCLN110_3_Int, hhv_f5_1044DLRunknownCLN110_4_Int, hhv_f5_1044DLRunknownCLN110_5_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int := hhv_f5_without_checking_1690DLRunknownCLN135_0_Int, hhv_f5_without_checking_1690DLRunknownCLN135_1_Int, hhv_f5_without_checking_1690DLRunknownCLN135_2_Int, hhv_f5_without_checking_1690DLRunknownCLN135_3_Int, hhv_f5_without_checking_1690DLRunknownCLN135_4_Int, hhv_f5_without_checking_1690DLRunknownCLN135_5_Int, hhv_f5_without_checking_1690DLRunknownCLN135_6_Int, hhv_f5_without_checking_1690DLRunknownCLN135_7_Int; [L0] havoc hbv_f5_without_checking_1690DLRunknownCLN135_1_Int; [L0] assume hbv_f5_1044DLRunknownCLN110_1_Int == 0; [L0] CALL call gotoProc(4, hhv_f5_1044DLRunknownCLN110_0_Int, hhv_f5_1044DLRunknownCLN110_1_Int, hhv_f5_1044DLRunknownCLN110_2_Int, hhv_f5_1044DLRunknownCLN110_3_Int, hhv_f5_1044DLRunknownCLN110_4_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, hbv_f5_1044DLRunknownCLN110_1_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, hhv_f5_1044DLRunknownCLN110_5_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 12) [L0] COND FALSE !(gotoSwitch == 11) [L0] COND FALSE !(gotoSwitch == 9) [L0] COND FALSE !(gotoSwitch == 8) [L0] COND FALSE !(gotoSwitch == 6) [L0] COND TRUE gotoSwitch == 4 [L0] hhv_f3_1038DLRunknownCLN74_0_Int, hhv_f3_1038DLRunknownCLN74_1_Int, hhv_f3_1038DLRunknownCLN74_2_Int, hhv_f3_1038DLRunknownCLN74_3_Int, hhv_f3_1038DLRunknownCLN74_4_Int, hhv_f3_1038DLRunknownCLN74_5_Int, hhv_f3_1038DLRunknownCLN74_6_Int, hhv_f3_1038DLRunknownCLN74_7_Int, hhv_f3_1038DLRunknownCLN74_8_Int, hhv_f3_1038DLRunknownCLN74_9_Int, hhv_f3_1038DLRunknownCLN74_10_Int, hhv_f3_1038DLRunknownCLN74_11_Int, hhv_f3_1038DLRunknownCLN74_12_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, gpav_10_Int, gpav_11_Int, gpav_12_Int; [L0] assume ((((((((((hhv_f3_1038DLRunknownCLN74_2_Int == hbv_f3_1038DLRunknownCLN74_4_Int + hbv_f3_1038DLRunknownCLN74_1_Int && hhv_f3_1038DLRunknownCLN74_5_Int == hhv_f3_1038DLRunknownCLN74_0_Int) && hbv_f3_1038DLRunknownCLN74_3_Int == 0) && hbv_f3_1038DLRunknownCLN74_7_Int == 0) && hbv_f3_1038DLRunknownCLN74_1_Int == 0) && hhv_f3_1038DLRunknownCLN74_6_Int == hhv_f3_1038DLRunknownCLN74_1_Int) && hhv_f3_1038DLRunknownCLN74_4_Int == hhv_f3_1038DLRunknownCLN74_1_Int) && hbv_f3_1038DLRunknownCLN74_5_Int == hbv_f3_1038DLRunknownCLN74_7_Int * hhv_f3_1038DLRunknownCLN74_7_Int) && hbv_f3_1038DLRunknownCLN74_6_Int == hbv_f3_1038DLRunknownCLN74_5_Int + hbv_f3_1038DLRunknownCLN74_2_Int) && hhv_f3_1038DLRunknownCLN74_3_Int == hhv_f3_1038DLRunknownCLN74_0_Int) && hbv_f3_1038DLRunknownCLN74_2_Int == 0) && hbv_f3_1038DLRunknownCLN74_4_Int == hbv_f3_1038DLRunknownCLN74_3_Int * hhv_f3_1038DLRunknownCLN74_7_Int; [L0] hhv_f3_1038DLRunknownCLN69_0_Int, hhv_f3_1038DLRunknownCLN69_1_Int, hhv_f3_1038DLRunknownCLN69_2_Int, hhv_f3_1038DLRunknownCLN69_3_Int, hhv_f3_1038DLRunknownCLN69_4_Int, hhv_f3_1038DLRunknownCLN69_5_Int, hhv_f3_1038DLRunknownCLN69_6_Int, hhv_f3_1038DLRunknownCLN69_7_Int := hhv_f3_1038DLRunknownCLN74_0_Int, hhv_f3_1038DLRunknownCLN74_1_Int, hhv_f3_1038DLRunknownCLN74_7_Int, hhv_f3_1038DLRunknownCLN74_8_Int, hhv_f3_1038DLRunknownCLN74_9_Int, hhv_f3_1038DLRunknownCLN74_10_Int, hhv_f3_1038DLRunknownCLN74_11_Int, hhv_f3_1038DLRunknownCLN74_12_Int; [L0] havoc hbv_f3_1038DLRunknownCLN74_4_Int, hbv_f3_1038DLRunknownCLN74_6_Int, hbv_f3_1038DLRunknownCLN74_1_Int, hbv_f3_1038DLRunknownCLN74_5_Int, hbv_f3_1038DLRunknownCLN74_3_Int, hbv_f3_1038DLRunknownCLN74_2_Int, hbv_f3_1038DLRunknownCLN74_7_Int; [L0] assume (((hhv_f3_1038DLRunknownCLN69_4_Int == hhv_f3_1038DLRunknownCLN69_1_Int && hhv_f3_1038DLRunknownCLN69_7_Int == hhv_f3_1038DLRunknownCLN69_1_Int) && hhv_f3_1038DLRunknownCLN69_2_Int == 0) && hhv_f3_1038DLRunknownCLN69_6_Int == hhv_f3_1038DLRunknownCLN69_0_Int) && hhv_f3_1038DLRunknownCLN69_3_Int == hhv_f3_1038DLRunknownCLN69_0_Int; [L0] hhv_main_1047DLRunknownCLN157_0_Int, hhv_main_1047DLRunknownCLN157_1_Int, hhv_main_1047DLRunknownCLN157_2_Int := hhv_f3_1038DLRunknownCLN69_5_Int, hhv_f3_1038DLRunknownCLN69_0_Int, hhv_f3_1038DLRunknownCLN69_1_Int; [L0] assume (hhv_main_1047DLRunknownCLN157_1_Int == 0 && hhv_main_1047DLRunknownCLN157_2_Int == 0) && hhv_main_1047DLRunknownCLN157_0_Int == 1; [L0] RET call gotoProc(4, hhv_f5_1044DLRunknownCLN110_0_Int, hhv_f5_1044DLRunknownCLN110_1_Int, hhv_f5_1044DLRunknownCLN110_2_Int, hhv_f5_1044DLRunknownCLN110_3_Int, hhv_f5_1044DLRunknownCLN110_4_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, hbv_f5_1044DLRunknownCLN110_1_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, hhv_f5_1044DLRunknownCLN110_5_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, 0, 0, 0, 0, 0); [L0] hhv_main_1047DLRunknownCLN157_0_Int, hhv_main_1047DLRunknownCLN157_1_Int, hhv_main_1047DLRunknownCLN157_2_Int := hhv_f5_1044DLRunknownCLN110_5_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int; [L0] havoc hbv_f5_1044DLRunknownCLN110_1_Int; [L0] assume (hhv_main_1047DLRunknownCLN157_1_Int == 0 && hhv_main_1047DLRunknownCLN157_2_Int == 0) && hhv_main_1047DLRunknownCLN157_0_Int == 1; [L0] RET call gotoProc(9, hhv_f3_1038DLRunknownCLN79_0_Int, hhv_f3_1038DLRunknownCLN79_1_Int, hhv_f3_1038DLRunknownCLN79_2_Int, hhv_f3_1038DLRunknownCLN79_3_Int, hhv_f3_1038DLRunknownCLN79_4_Int, hhv_f3_1038DLRunknownCLN79_5_Int, hhv_f3_1038DLRunknownCLN79_6_Int, hhv_f3_1038DLRunknownCLN79_7_Int, hhv_f3_1038DLRunknownCLN79_8_Int, hhv_f3_1038DLRunknownCLN79_9_Int, hhv_f3_1038DLRunknownCLN79_15_Int, hhv_f3_1038DLRunknownCLN79_10_Int, hhv_f3_1038DLRunknownCLN79_11_Int, 0, 0, 0, 0, 0); [L0] CALL call gotoProc(4, hhv_f3_1038DLRunknownCLN79_5_Int, hhv_f3_1038DLRunknownCLN79_6_Int, hhv_f3_1038DLRunknownCLN79_7_Int, hhv_f3_1038DLRunknownCLN79_8_Int, hhv_f3_1038DLRunknownCLN79_9_Int, hhv_f3_1038DLRunknownCLN79_10_Int, hhv_f3_1038DLRunknownCLN79_11_Int, hhv_f3_1038DLRunknownCLN79_12_Int, hhv_f3_1038DLRunknownCLN79_10_Int, hhv_f3_1038DLRunknownCLN79_11_Int, hhv_f3_1038DLRunknownCLN79_15_Int, hhv_f3_1038DLRunknownCLN79_10_Int, hhv_f3_1038DLRunknownCLN79_11_Int, 0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 12) [L0] COND FALSE !(gotoSwitch == 11) [L0] COND FALSE !(gotoSwitch == 9) [L0] COND FALSE !(gotoSwitch == 8) [L0] COND FALSE !(gotoSwitch == 6) [L0] COND TRUE gotoSwitch == 4 [L0] hhv_f3_1038DLRunknownCLN74_0_Int, hhv_f3_1038DLRunknownCLN74_1_Int, hhv_f3_1038DLRunknownCLN74_2_Int, hhv_f3_1038DLRunknownCLN74_3_Int, hhv_f3_1038DLRunknownCLN74_4_Int, hhv_f3_1038DLRunknownCLN74_5_Int, hhv_f3_1038DLRunknownCLN74_6_Int, hhv_f3_1038DLRunknownCLN74_7_Int, hhv_f3_1038DLRunknownCLN74_8_Int, hhv_f3_1038DLRunknownCLN74_9_Int, hhv_f3_1038DLRunknownCLN74_10_Int, hhv_f3_1038DLRunknownCLN74_11_Int, hhv_f3_1038DLRunknownCLN74_12_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, gpav_10_Int, gpav_11_Int, gpav_12_Int; [L0] assume ((((((((((hhv_f3_1038DLRunknownCLN74_2_Int == hbv_f3_1038DLRunknownCLN74_4_Int + hbv_f3_1038DLRunknownCLN74_1_Int && hhv_f3_1038DLRunknownCLN74_5_Int == hhv_f3_1038DLRunknownCLN74_0_Int) && hbv_f3_1038DLRunknownCLN74_3_Int == 0) && hbv_f3_1038DLRunknownCLN74_7_Int == 0) && hbv_f3_1038DLRunknownCLN74_1_Int == 0) && hhv_f3_1038DLRunknownCLN74_6_Int == hhv_f3_1038DLRunknownCLN74_1_Int) && hhv_f3_1038DLRunknownCLN74_4_Int == hhv_f3_1038DLRunknownCLN74_1_Int) && hbv_f3_1038DLRunknownCLN74_5_Int == hbv_f3_1038DLRunknownCLN74_7_Int * hhv_f3_1038DLRunknownCLN74_7_Int) && hbv_f3_1038DLRunknownCLN74_6_Int == hbv_f3_1038DLRunknownCLN74_5_Int + hbv_f3_1038DLRunknownCLN74_2_Int) && hhv_f3_1038DLRunknownCLN74_3_Int == hhv_f3_1038DLRunknownCLN74_0_Int) && hbv_f3_1038DLRunknownCLN74_2_Int == 0) && hbv_f3_1038DLRunknownCLN74_4_Int == hbv_f3_1038DLRunknownCLN74_3_Int * hhv_f3_1038DLRunknownCLN74_7_Int; [L0] hhv_f3_1038DLRunknownCLN69_0_Int, hhv_f3_1038DLRunknownCLN69_1_Int, hhv_f3_1038DLRunknownCLN69_2_Int, hhv_f3_1038DLRunknownCLN69_3_Int, hhv_f3_1038DLRunknownCLN69_4_Int, hhv_f3_1038DLRunknownCLN69_5_Int, hhv_f3_1038DLRunknownCLN69_6_Int, hhv_f3_1038DLRunknownCLN69_7_Int := hhv_f3_1038DLRunknownCLN74_0_Int, hhv_f3_1038DLRunknownCLN74_1_Int, hhv_f3_1038DLRunknownCLN74_7_Int, hhv_f3_1038DLRunknownCLN74_8_Int, hhv_f3_1038DLRunknownCLN74_9_Int, hhv_f3_1038DLRunknownCLN74_10_Int, hhv_f3_1038DLRunknownCLN74_11_Int, hhv_f3_1038DLRunknownCLN74_12_Int; [L0] havoc hbv_f3_1038DLRunknownCLN74_4_Int, hbv_f3_1038DLRunknownCLN74_6_Int, hbv_f3_1038DLRunknownCLN74_1_Int, hbv_f3_1038DLRunknownCLN74_5_Int, hbv_f3_1038DLRunknownCLN74_3_Int, hbv_f3_1038DLRunknownCLN74_2_Int, hbv_f3_1038DLRunknownCLN74_7_Int; [L0] assume (((hhv_f3_1038DLRunknownCLN69_4_Int == hhv_f3_1038DLRunknownCLN69_1_Int && hhv_f3_1038DLRunknownCLN69_7_Int == hhv_f3_1038DLRunknownCLN69_1_Int) && hhv_f3_1038DLRunknownCLN69_2_Int == 0) && hhv_f3_1038DLRunknownCLN69_6_Int == hhv_f3_1038DLRunknownCLN69_0_Int) && hhv_f3_1038DLRunknownCLN69_3_Int == hhv_f3_1038DLRunknownCLN69_0_Int; [L0] hhv_main_1047DLRunknownCLN157_0_Int, hhv_main_1047DLRunknownCLN157_1_Int, hhv_main_1047DLRunknownCLN157_2_Int := hhv_f3_1038DLRunknownCLN69_5_Int, hhv_f3_1038DLRunknownCLN69_0_Int, hhv_f3_1038DLRunknownCLN69_1_Int; [L0] assume (hhv_main_1047DLRunknownCLN157_1_Int == 0 && hhv_main_1047DLRunknownCLN157_2_Int == 0) && hhv_main_1047DLRunknownCLN157_0_Int == 1; [L0] RET call gotoProc(4, hhv_f3_1038DLRunknownCLN79_5_Int, hhv_f3_1038DLRunknownCLN79_6_Int, hhv_f3_1038DLRunknownCLN79_7_Int, hhv_f3_1038DLRunknownCLN79_8_Int, hhv_f3_1038DLRunknownCLN79_9_Int, hhv_f3_1038DLRunknownCLN79_10_Int, hhv_f3_1038DLRunknownCLN79_11_Int, hhv_f3_1038DLRunknownCLN79_12_Int, hhv_f3_1038DLRunknownCLN79_10_Int, hhv_f3_1038DLRunknownCLN79_11_Int, hhv_f3_1038DLRunknownCLN79_15_Int, hhv_f3_1038DLRunknownCLN79_10_Int, hhv_f3_1038DLRunknownCLN79_11_Int, 0, 0, 0, 0, 0); [L0] hhv_main_1047DLRunknownCLN157_0_Int, hhv_main_1047DLRunknownCLN157_1_Int, hhv_main_1047DLRunknownCLN157_2_Int := hhv_f3_1038DLRunknownCLN79_15_Int, hhv_f3_1038DLRunknownCLN79_10_Int, hhv_f3_1038DLRunknownCLN79_11_Int; [L0] assume (hhv_main_1047DLRunknownCLN157_1_Int == 0 && hhv_main_1047DLRunknownCLN157_2_Int == 0) && hhv_main_1047DLRunknownCLN157_0_Int == 1; [L0] RET call gotoProc(8, hhv_f2_1034DLRunknownCLN53_0_Int, hhv_f2_1034DLRunknownCLN53_1_Int, hhv_f2_1034DLRunknownCLN53_2_Int, hhv_f2_1034DLRunknownCLN53_3_Int, hhv_f2_1034DLRunknownCLN53_4_Int, hhv_f2_1034DLRunknownCLN53_5_Int, hhv_f2_1034DLRunknownCLN53_6_Int, hbv_f2_1034DLRunknownCLN53_6_Int, hhv_f2_1034DLRunknownCLN53_5_Int, hhv_f2_1034DLRunknownCLN53_6_Int, hhv_f2_1034DLRunknownCLN53_5_Int, hhv_f2_1034DLRunknownCLN53_6_Int, hbv_f2_1034DLRunknownCLN53_4_Int, hbv_f2_1034DLRunknownCLN53_9_Int, hbv_f2_1034DLRunknownCLN53_10_Int, hhv_f2_1034DLRunknownCLN53_10_Int, hbv_f2_1034DLRunknownCLN53_11_Int, hbv_f2_1034DLRunknownCLN53_12_Int); [L0] hhv_f3_1038DLRunknownCLN69_0_Int, hhv_f3_1038DLRunknownCLN69_1_Int, hhv_f3_1038DLRunknownCLN69_2_Int, hhv_f3_1038DLRunknownCLN69_3_Int, hhv_f3_1038DLRunknownCLN69_4_Int, hhv_f3_1038DLRunknownCLN69_5_Int, hhv_f3_1038DLRunknownCLN69_6_Int, hhv_f3_1038DLRunknownCLN69_7_Int := hhv_f2_1034DLRunknownCLN53_5_Int, hhv_f2_1034DLRunknownCLN53_6_Int, hbv_f2_1034DLRunknownCLN53_4_Int, hbv_f2_1034DLRunknownCLN53_9_Int, hbv_f2_1034DLRunknownCLN53_10_Int, hhv_f2_1034DLRunknownCLN53_10_Int, hbv_f2_1034DLRunknownCLN53_11_Int, hbv_f2_1034DLRunknownCLN53_12_Int; [L0] havoc hbv_f2_1034DLRunknownCLN53_3_Int, hbv_f2_1034DLRunknownCLN53_7_Int, hbv_f2_1034DLRunknownCLN53_10_Int, hbv_f2_1034DLRunknownCLN53_4_Int, hbv_f2_1034DLRunknownCLN53_9_Int, hbv_f2_1034DLRunknownCLN53_2_Int, hbv_f2_1034DLRunknownCLN53_6_Int, hbv_f2_1034DLRunknownCLN53_1_Int, hbv_f2_1034DLRunknownCLN53_5_Int, hbv_f2_1034DLRunknownCLN53_8_Int, hbv_f2_1034DLRunknownCLN53_11_Int, hbv_f2_1034DLRunknownCLN53_12_Int; [L0] assume (((hhv_f3_1038DLRunknownCLN69_4_Int == hhv_f3_1038DLRunknownCLN69_1_Int && hhv_f3_1038DLRunknownCLN69_7_Int == hhv_f3_1038DLRunknownCLN69_1_Int) && hhv_f3_1038DLRunknownCLN69_2_Int == 0) && hhv_f3_1038DLRunknownCLN69_6_Int == hhv_f3_1038DLRunknownCLN69_0_Int) && hhv_f3_1038DLRunknownCLN69_3_Int == hhv_f3_1038DLRunknownCLN69_0_Int; [L0] hhv_main_1047DLRunknownCLN157_0_Int, hhv_main_1047DLRunknownCLN157_1_Int, hhv_main_1047DLRunknownCLN157_2_Int := hhv_f3_1038DLRunknownCLN69_5_Int, hhv_f3_1038DLRunknownCLN69_0_Int, hhv_f3_1038DLRunknownCLN69_1_Int; [L0] assume (hhv_main_1047DLRunknownCLN157_1_Int == 0 && hhv_main_1047DLRunknownCLN157_2_Int == 0) && hhv_main_1047DLRunknownCLN157_0_Int == 1; [L0] RET call gotoProc(6, hhv_f3_1038DLRunknownCLN74_0_Int, hhv_f3_1038DLRunknownCLN74_1_Int, hhv_f3_1038DLRunknownCLN74_2_Int, hhv_f3_1038DLRunknownCLN74_3_Int, hhv_f3_1038DLRunknownCLN74_4_Int, hhv_f3_1038DLRunknownCLN74_5_Int, hhv_f3_1038DLRunknownCLN74_6_Int, hbv_f3_1038DLRunknownCLN74_4_Int, hhv_f3_1038DLRunknownCLN74_5_Int, hhv_f3_1038DLRunknownCLN74_6_Int, hhv_f3_1038DLRunknownCLN74_10_Int, hhv_f3_1038DLRunknownCLN74_5_Int, hhv_f3_1038DLRunknownCLN74_6_Int, 0, 0, 0, 0, 0); [L0] hhv_f3_1038DLRunknownCLN69_0_Int, hhv_f3_1038DLRunknownCLN69_1_Int, hhv_f3_1038DLRunknownCLN69_2_Int, hhv_f3_1038DLRunknownCLN69_3_Int, hhv_f3_1038DLRunknownCLN69_4_Int, hhv_f3_1038DLRunknownCLN69_5_Int, hhv_f3_1038DLRunknownCLN69_6_Int, hhv_f3_1038DLRunknownCLN69_7_Int := hhv_f3_1038DLRunknownCLN74_5_Int, hhv_f3_1038DLRunknownCLN74_6_Int, hhv_f3_1038DLRunknownCLN74_7_Int, hhv_f3_1038DLRunknownCLN74_8_Int, hhv_f3_1038DLRunknownCLN74_9_Int, hhv_f3_1038DLRunknownCLN74_10_Int, hhv_f3_1038DLRunknownCLN74_11_Int, hhv_f3_1038DLRunknownCLN74_12_Int; [L0] havoc hbv_f3_1038DLRunknownCLN74_4_Int, hbv_f3_1038DLRunknownCLN74_6_Int, hbv_f3_1038DLRunknownCLN74_1_Int, hbv_f3_1038DLRunknownCLN74_5_Int, hbv_f3_1038DLRunknownCLN74_3_Int, hbv_f3_1038DLRunknownCLN74_2_Int; [L0] assume (((hhv_f3_1038DLRunknownCLN69_4_Int == hhv_f3_1038DLRunknownCLN69_1_Int && hhv_f3_1038DLRunknownCLN69_7_Int == hhv_f3_1038DLRunknownCLN69_1_Int) && hhv_f3_1038DLRunknownCLN69_2_Int == 0) && hhv_f3_1038DLRunknownCLN69_6_Int == hhv_f3_1038DLRunknownCLN69_0_Int) && hhv_f3_1038DLRunknownCLN69_3_Int == hhv_f3_1038DLRunknownCLN69_0_Int; [L0] hhv_main_1047DLRunknownCLN157_0_Int, hhv_main_1047DLRunknownCLN157_1_Int, hhv_main_1047DLRunknownCLN157_2_Int := hhv_f3_1038DLRunknownCLN69_5_Int, hhv_f3_1038DLRunknownCLN69_0_Int, hhv_f3_1038DLRunknownCLN69_1_Int; [L0] assume (hhv_main_1047DLRunknownCLN157_1_Int == 0 && hhv_main_1047DLRunknownCLN157_2_Int == 0) && hhv_main_1047DLRunknownCLN157_0_Int == 1; [L0] RET call gotoProc(4, hhv_f5_1044DLRunknownCLN110_0_Int, hhv_f5_1044DLRunknownCLN110_1_Int, hhv_f5_1044DLRunknownCLN110_2_Int, hhv_f5_1044DLRunknownCLN110_3_Int, hhv_f5_1044DLRunknownCLN110_4_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, hbv_f5_1044DLRunknownCLN110_1_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, hhv_f5_1044DLRunknownCLN110_5_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int, 0, 0, 0, 0, 0); [L0] hhv_main_1047DLRunknownCLN157_0_Int, hhv_main_1047DLRunknownCLN157_1_Int, hhv_main_1047DLRunknownCLN157_2_Int := hhv_f5_1044DLRunknownCLN110_5_Int, hhv_f5_1044DLRunknownCLN110_6_Int, hhv_f5_1044DLRunknownCLN110_7_Int; [L0] havoc hbv_f5_1044DLRunknownCLN110_1_Int; [L0] assume (hhv_main_1047DLRunknownCLN157_1_Int == 0 && hhv_main_1047DLRunknownCLN157_2_Int == 0) && hhv_main_1047DLRunknownCLN157_0_Int == 1; [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. UNSAFE Result, 7.5s OverallTime, 11 OverallIterations, 9 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 448 SDtfs, 550 SDslu, 344 SDs, 0 SdLazy, 715 SolverSat, 168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 479 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=10, 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 680 NumberOfCodeBlocks, 680 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 40343 SizeOfPredicates, 11 NumberOfNonLiveVariables, 4296 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 551/600 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/CE-Jones_Bohr04.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-55-51-572.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/CE-Jones_Bohr04.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-55-51-572.csv Received shutdown request...