./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1270a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa333650cb1e4cf3e280683e8b2ad72d19029b0d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa333650cb1e4cf3e280683e8b2ad72d19029b0d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:53:59,039 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:53:59,039 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:53:59,046 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:53:59,047 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:53:59,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:53:59,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:53:59,049 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:53:59,050 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:53:59,051 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:53:59,051 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:53:59,051 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:53:59,052 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:53:59,053 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:53:59,053 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:53:59,054 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:53:59,055 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:53:59,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:53:59,057 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:53:59,058 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:53:59,059 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:53:59,060 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:53:59,061 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:53:59,061 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:53:59,062 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:53:59,062 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:53:59,063 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:53:59,063 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:53:59,064 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:53:59,065 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:53:59,065 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:53:59,065 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:53:59,065 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:53:59,066 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:53:59,066 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:53:59,067 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:53:59,067 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 13:53:59,077 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:53:59,077 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:53:59,078 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:53:59,078 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:53:59,078 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 13:53:59,078 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 13:53:59,078 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 13:53:59,078 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 13:53:59,078 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 13:53:59,078 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 13:53:59,078 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 13:53:59,079 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 13:53:59,079 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 13:53:59,079 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:53:59,079 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:53:59,079 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:53:59,079 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:53:59,080 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:53:59,080 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:53:59,080 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:53:59,080 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:53:59,080 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:53:59,080 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:53:59,080 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:53:59,080 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:53:59,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:53:59,081 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:53:59,081 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:53:59,081 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:53:59,081 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:53:59,081 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:53:59,081 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:53:59,081 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:53:59,081 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 13:53:59,081 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:53:59,081 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:53:59,081 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:53:59,082 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa333650cb1e4cf3e280683e8b2ad72d19029b0d [2018-11-23 13:53:59,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:53:59,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:53:59,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:53:59,113 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:53:59,113 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:53:59,113 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1270a_true-unreach-call.c [2018-11-23 13:53:59,148 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/data/1f4dc61fe/276bd41924e04757b0350161d2063291/FLAG194e2acd8 [2018-11-23 13:53:59,561 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:53:59,561 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/sv-benchmarks/c/float-newlib/float_req_bl_1270a_true-unreach-call.c [2018-11-23 13:53:59,566 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/data/1f4dc61fe/276bd41924e04757b0350161d2063291/FLAG194e2acd8 [2018-11-23 13:53:59,574 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/data/1f4dc61fe/276bd41924e04757b0350161d2063291 [2018-11-23 13:53:59,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:53:59,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:53:59,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:53:59,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:53:59,581 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:53:59,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:53:59" (1/1) ... [2018-11-23 13:53:59,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a0aac63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:59, skipping insertion in model container [2018-11-23 13:53:59,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:53:59" (1/1) ... [2018-11-23 13:53:59,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:53:59,615 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:53:59,755 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:53:59,758 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:53:59,793 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:53:59,847 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:53:59,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:59 WrapperNode [2018-11-23 13:53:59,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:53:59,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:53:59,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:53:59,849 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:53:59,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:59" (1/1) ... [2018-11-23 13:53:59,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:59" (1/1) ... [2018-11-23 13:53:59,870 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:53:59,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:53:59,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:53:59,870 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:53:59,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:59" (1/1) ... [2018-11-23 13:53:59,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:59" (1/1) ... [2018-11-23 13:53:59,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:59" (1/1) ... [2018-11-23 13:53:59,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:59" (1/1) ... [2018-11-23 13:53:59,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:59" (1/1) ... [2018-11-23 13:53:59,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:59" (1/1) ... [2018-11-23 13:53:59,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:59" (1/1) ... [2018-11-23 13:53:59,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:53:59,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:53:59,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:53:59,908 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:53:59,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:53:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:53:59,939 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:53:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 13:53:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:53:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-11-23 13:53:59,939 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-11-23 13:53:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:53:59,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:53:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 13:53:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:53:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:53:59,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:53:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:53:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_hypotf [2018-11-23 13:53:59,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_hypotf [2018-11-23 13:53:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:53:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-11-23 13:53:59,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-11-23 13:54:00,364 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:54:00,365 INFO L280 CfgBuilder]: Removed 34 assue(true) statements. [2018-11-23 13:54:00,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:54:00 BoogieIcfgContainer [2018-11-23 13:54:00,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:54:00,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:54:00,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:54:00,368 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:54:00,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:53:59" (1/3) ... [2018-11-23 13:54:00,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0fe4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:54:00, skipping insertion in model container [2018-11-23 13:54:00,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:53:59" (2/3) ... [2018-11-23 13:54:00,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0fe4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:54:00, skipping insertion in model container [2018-11-23 13:54:00,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:54:00" (3/3) ... [2018-11-23 13:54:00,371 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270a_true-unreach-call.c [2018-11-23 13:54:00,376 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:54:00,381 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:54:00,394 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:54:00,412 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:54:00,412 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:54:00,412 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:54:00,412 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:54:00,413 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:54:00,413 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:54:00,413 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:54:00,413 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:54:00,424 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states. [2018-11-23 13:54:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:54:00,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:54:00,430 INFO L402 BasicCegarLoop]: trace histogram [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-11-23 13:54:00,431 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:54:00,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:54:00,434 INFO L82 PathProgramCache]: Analyzing trace with hash 872759118, now seen corresponding path program 1 times [2018-11-23 13:54:00,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:54:00,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:54:00,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:54:00,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:54:00,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:54:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:54:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:54:00,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:54:00,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:54:00,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 13:54:00,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:54:00,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:54:00,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:54:00,536 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 2 states. [2018-11-23 13:54:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:54:00,559 INFO L93 Difference]: Finished difference Result 196 states and 313 transitions. [2018-11-23 13:54:00,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:54:00,560 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-11-23 13:54:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:54:00,566 INFO L225 Difference]: With dead ends: 196 [2018-11-23 13:54:00,566 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 13:54:00,569 INFO L631 BasicCegarLoop]: 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-11-23 13:54:00,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 13:54:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-11-23 13:54:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 13:54:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2018-11-23 13:54:00,604 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 28 [2018-11-23 13:54:00,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:54:00,604 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2018-11-23 13:54:00,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:54:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2018-11-23 13:54:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:54:00,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:54:00,606 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-11-23 13:54:00,606 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:54:00,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:54:00,606 INFO L82 PathProgramCache]: Analyzing trace with hash -863403993, now seen corresponding path program 1 times [2018-11-23 13:54:00,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 13:54:00,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:54:00,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:54:00,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:54:00,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 13:54:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:54:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:54:00,705 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=10737418250, |#NULL.offset|=10737418241, |old(#NULL.base)|=10737418250, |old(#NULL.offset)|=10737418241, |old(~one_sqrt~0)|=10737418248.0, |old(~tiny_sqrt~0)|=10737418258.0, ~one_sqrt~0=10737418248.0, ~tiny_sqrt~0=10737418258.0] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=10737418250, |old(#NULL.offset)|=10737418241, |old(~one_sqrt~0)|=10737418248.0, |old(~tiny_sqrt~0)|=10737418258.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=10737418250, |old(#NULL.offset)|=10737418241, |old(~one_sqrt~0)|=10737418248.0, |old(~tiny_sqrt~0)|=10737418258.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] RET #363#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] CALL call #t~ret38 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0);~y~0 := #t~nondet35;havoc #t~nondet35; VAL [main_~y~0=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] CALL call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418246.0, |__ieee754_hypotf_#in~y|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~x := #in~x;~y := #in~y;~a~0 := ~x;~b~0 := ~y;havoc ~t1~0;havoc ~t2~0;havoc ~y1~0;havoc ~y2~0;havoc ~w~0;havoc ~j~0;havoc ~k~0;havoc ~ha~0;havoc ~hb~0; VAL [__ieee754_hypotf_~a~0=10737418246.0, __ieee754_hypotf_~b~0=10737418259.0, __ieee754_hypotf_~x=10737418246.0, __ieee754_hypotf_~y=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418246.0, |__ieee754_hypotf_#in~y|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] call ~#gf_u~1.base, ~#gf_u~1.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~1.base, ~#gf_u~1.offset, 4);call #t~mem5 := read~int(~#gf_u~1.base, ~#gf_u~1.offset, 4);~ha~0 := (if #t~mem5 % 4294967296 % 4294967296 <= 2147483647 then #t~mem5 % 4294967296 % 4294967296 else #t~mem5 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union6, ~#gf_u~1.base, ~#gf_u~1.offset, 4);havoc #t~mem5;havoc #t~union6;call ULTIMATE.dealloc(~#gf_u~1.base, ~#gf_u~1.offset);havoc ~#gf_u~1.base, ~#gf_u~1.offset; VAL [__ieee754_hypotf_~a~0=10737418246.0, __ieee754_hypotf_~b~0=10737418259.0, __ieee754_hypotf_~ha~0=2147483647, __ieee754_hypotf_~x=10737418246.0, __ieee754_hypotf_~y=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418246.0, |__ieee754_hypotf_#in~y|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] goto; VAL [__ieee754_hypotf_~a~0=10737418246.0, __ieee754_hypotf_~b~0=10737418259.0, __ieee754_hypotf_~ha~0=2147483647, __ieee754_hypotf_~x=10737418246.0, __ieee754_hypotf_~y=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418246.0, |__ieee754_hypotf_#in~y|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [__ieee754_hypotf_~a~0=10737418246.0, __ieee754_hypotf_~b~0=10737418259.0, __ieee754_hypotf_~x=10737418246.0, __ieee754_hypotf_~y=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418246.0, |__ieee754_hypotf_#in~y|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] call ~#gf_u~2.base, ~#gf_u~2.offset := #Ultimate.alloc(4);call write~real(~y, ~#gf_u~2.base, ~#gf_u~2.offset, 4);call #t~mem7 := read~int(~#gf_u~2.base, ~#gf_u~2.offset, 4);~hb~0 := (if #t~mem7 % 4294967296 % 4294967296 <= 2147483647 then #t~mem7 % 4294967296 % 4294967296 else #t~mem7 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union8, ~#gf_u~2.base, ~#gf_u~2.offset, 4);havoc #t~union8;havoc #t~mem7;call ULTIMATE.dealloc(~#gf_u~2.base, ~#gf_u~2.offset);havoc ~#gf_u~2.base, ~#gf_u~2.offset; VAL [__ieee754_hypotf_~a~0=10737418246.0, __ieee754_hypotf_~b~0=10737418259.0, __ieee754_hypotf_~hb~0=(- 2147483648), __ieee754_hypotf_~x=10737418246.0, __ieee754_hypotf_~y=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418246.0, |__ieee754_hypotf_#in~y|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] goto; VAL [__ieee754_hypotf_~a~0=10737418246.0, __ieee754_hypotf_~b~0=10737418259.0, __ieee754_hypotf_~hb~0=(- 2147483648), __ieee754_hypotf_~x=10737418246.0, __ieee754_hypotf_~y=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418246.0, |__ieee754_hypotf_#in~y|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [__ieee754_hypotf_~a~0=10737418246.0, __ieee754_hypotf_~b~0=10737418259.0, __ieee754_hypotf_~x=10737418246.0, __ieee754_hypotf_~y=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418246.0, |__ieee754_hypotf_#in~y|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume ~hb~0 > ~ha~0;~a~0 := ~y;~b~0 := ~x;~j~0 := ~ha~0;~ha~0 := ~hb~0;~hb~0 := ~j~0; VAL [__ieee754_hypotf_~a~0=10737418259.0, __ieee754_hypotf_~b~0=10737418246.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418246.0, __ieee754_hypotf_~y=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418246.0, |__ieee754_hypotf_#in~y|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] call ~#sf_u~1.base, ~#sf_u~1.offset := #Ultimate.alloc(4);call write~int(~ha~0, ~#sf_u~1.base, ~#sf_u~1.offset, 4);call #t~mem9 := read~real(~#sf_u~1.base, ~#sf_u~1.offset, 4);~a~0 := #t~mem9;call write~int(#t~union10, ~#sf_u~1.base, ~#sf_u~1.offset, 4);havoc #t~mem9;havoc #t~union10;call ULTIMATE.dealloc(~#sf_u~1.base, ~#sf_u~1.offset);havoc ~#sf_u~1.base, ~#sf_u~1.offset; VAL [__ieee754_hypotf_~a~0=10737418263.0, __ieee754_hypotf_~b~0=10737418246.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418246.0, __ieee754_hypotf_~y=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418246.0, |__ieee754_hypotf_#in~y|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] goto; VAL [__ieee754_hypotf_~a~0=10737418263.0, __ieee754_hypotf_~b~0=10737418246.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418246.0, __ieee754_hypotf_~y=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418246.0, |__ieee754_hypotf_#in~y|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] call ~#sf_u~2.base, ~#sf_u~2.offset := #Ultimate.alloc(4);call write~int(~hb~0, ~#sf_u~2.base, ~#sf_u~2.offset, 4);call #t~mem11 := read~real(~#sf_u~2.base, ~#sf_u~2.offset, 4);~b~0 := #t~mem11;call write~int(#t~union12, ~#sf_u~2.base, ~#sf_u~2.offset, 4);havoc #t~union12;havoc #t~mem11;call ULTIMATE.dealloc(~#sf_u~2.base, ~#sf_u~2.offset);havoc ~#sf_u~2.base, ~#sf_u~2.offset; VAL [__ieee754_hypotf_~a~0=10737418263.0, __ieee754_hypotf_~b~0=10737418264.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418246.0, __ieee754_hypotf_~y=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418246.0, |__ieee754_hypotf_#in~y|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] goto; VAL [__ieee754_hypotf_~a~0=10737418263.0, __ieee754_hypotf_~b~0=10737418264.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418246.0, __ieee754_hypotf_~y=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418246.0, |__ieee754_hypotf_#in~y|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume ~ha~0 - ~hb~0 > 251658240;#res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [__ieee754_hypotf_~a~0=10737418263.0, __ieee754_hypotf_~b~0=10737418264.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418246.0, __ieee754_hypotf_~y=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418246.0, |__ieee754_hypotf_#in~y|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume true; VAL [__ieee754_hypotf_~a~0=10737418263.0, __ieee754_hypotf_~b~0=10737418264.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418246.0, __ieee754_hypotf_~y=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418246.0, |__ieee754_hypotf_#in~y|=10737418259.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] RET #367#return; VAL [main_~x~0=10737418246.0, main_~y~0=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret36|=10737418243.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~res~0 := #t~ret36;havoc #t~ret36; VAL [main_~res~0=10737418243.0, main_~x~0=10737418246.0, main_~y~0=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] CALL call #t~ret37 := isinf_float(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=10737418243.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~x := #in~x;havoc ~ix~1; VAL [isinf_float_~x=10737418243.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=10737418243.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] call ~#gf_u~3.base, ~#gf_u~3.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~3.base, ~#gf_u~3.offset, 4);call #t~mem33 := read~int(~#gf_u~3.base, ~#gf_u~3.offset, 4);~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union34, ~#gf_u~3.base, ~#gf_u~3.offset, 4);havoc #t~mem33;havoc #t~union34;call ULTIMATE.dealloc(~#gf_u~3.base, ~#gf_u~3.offset);havoc ~#gf_u~3.base, ~#gf_u~3.offset; VAL [isinf_float_~ix~1=(- 2147483648), isinf_float_~x=10737418243.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=10737418243.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] goto; VAL [isinf_float_~ix~1=(- 2147483648), isinf_float_~x=10737418243.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=10737418243.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647);#res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [isinf_float_~ix~1=0, isinf_float_~x=10737418243.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=10737418243.0, |isinf_float_#res|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume true; VAL [isinf_float_~ix~1=0, isinf_float_~x=10737418243.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=10737418243.0, |isinf_float_#res|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] RET #369#return; VAL [main_~res~0=10737418243.0, main_~x~0=10737418246.0, main_~y~0=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret37|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647; VAL [main_~res~0=10737418243.0, main_~x~0=10737418246.0, main_~y~0=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret37|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume 0 == #t~ret37;havoc #t~ret37; VAL [main_~res~0=10737418243.0, main_~x~0=10737418246.0, main_~y~0=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume !false; VAL [main_~res~0=10737418243.0, main_~x~0=10737418246.0, main_~y~0=10737418259.0, |#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=10737418250, #NULL.offset=10737418241, old(#NULL.base)=10737418250, old(#NULL.offset)=10737418241, old(~one_sqrt~0)=1.0737418248E10, old(~tiny_sqrt~0)=1.0737418258E10, ~one_sqrt~0=1.0737418248E10, ~tiny_sqrt~0=1.0737418258E10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10737418250, old(#NULL.offset)=10737418241, old(~one_sqrt~0)=1.0737418248E10, old(~tiny_sqrt~0)=1.0737418258E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10737418250, old(#NULL.offset)=10737418241, old(~one_sqrt~0)=1.0737418248E10, old(~tiny_sqrt~0)=1.0737418258E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] CALL call #t~ret38 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L229] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); [L230] ~y~0 := #t~nondet35; [L230] havoc #t~nondet35; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418259E10] [L231] CALL call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L81-L208] ~x := #in~x; [L81-L208] ~y := #in~y; [L82] ~a~0 := ~x; [L82] ~b~0 := ~y; [L82] havoc ~t1~0; [L82] havoc ~t2~0; [L82] havoc ~y1~0; [L82] havoc ~y2~0; [L82] havoc ~w~0; [L83] havoc ~j~0; [L83] havoc ~k~0; [L83] havoc ~ha~0; [L83] havoc ~hb~0; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L86] call ~#gf_u~1.base, ~#gf_u~1.offset := #Ultimate.alloc(4); [L87] call write~real(~x, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L88] call #t~mem5 := read~int(~#gf_u~1.base, ~#gf_u~1.offset, 4); [L88] ~ha~0 := (if #t~mem5 % 4294967296 % 4294967296 <= 2147483647 then #t~mem5 % 4294967296 % 4294967296 else #t~mem5 % 4294967296 % 4294967296 - 4294967296); [L88] call write~real(#t~union6, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L88] havoc #t~mem5; [L88] havoc #t~union6; [L86] call ULTIMATE.dealloc(~#gf_u~1.base, ~#gf_u~1.offset); [L86] havoc ~#gf_u~1.base, ~#gf_u~1.offset; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~ha~0=2147483647, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L92] call ~#gf_u~2.base, ~#gf_u~2.offset := #Ultimate.alloc(4); [L93] call write~real(~y, ~#gf_u~2.base, ~#gf_u~2.offset, 4); [L94] call #t~mem7 := read~int(~#gf_u~2.base, ~#gf_u~2.offset, 4); [L94] ~hb~0 := (if #t~mem7 % 4294967296 % 4294967296 <= 2147483647 then #t~mem7 % 4294967296 % 4294967296 else #t~mem7 % 4294967296 % 4294967296 - 4294967296); [L94] call write~real(#t~union8, ~#gf_u~2.base, ~#gf_u~2.offset, 4); [L94] havoc #t~union8; [L94] havoc #t~mem7; [L92] call ULTIMATE.dealloc(~#gf_u~2.base, ~#gf_u~2.offset); [L92] havoc ~#gf_u~2.base, ~#gf_u~2.offset; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~hb~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L97-L106] assume ~hb~0 > ~ha~0; [L98] ~a~0 := ~y; [L99] ~b~0 := ~x; [L100] ~j~0 := ~ha~0; [L101] ~ha~0 := ~hb~0; [L102] ~hb~0 := ~j~0; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418259E10, ~b~0=1.0737418246E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L108] call ~#sf_u~1.base, ~#sf_u~1.offset := #Ultimate.alloc(4); [L109] call write~int(~ha~0, ~#sf_u~1.base, ~#sf_u~1.offset, 4); [L110] call #t~mem9 := read~real(~#sf_u~1.base, ~#sf_u~1.offset, 4); [L110] ~a~0 := #t~mem9; [L110] call write~int(#t~union10, ~#sf_u~1.base, ~#sf_u~1.offset, 4); [L110] havoc #t~mem9; [L110] havoc #t~union10; [L108] call ULTIMATE.dealloc(~#sf_u~1.base, ~#sf_u~1.offset); [L108] havoc ~#sf_u~1.base, ~#sf_u~1.offset; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418246E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L113] call ~#sf_u~2.base, ~#sf_u~2.offset := #Ultimate.alloc(4); [L114] call write~int(~hb~0, ~#sf_u~2.base, ~#sf_u~2.offset, 4); [L115] call #t~mem11 := read~real(~#sf_u~2.base, ~#sf_u~2.offset, 4); [L115] ~b~0 := #t~mem11; [L115] call write~int(#t~union12, ~#sf_u~2.base, ~#sf_u~2.offset, 4); [L115] havoc #t~union12; [L115] havoc #t~mem11; [L113] call ULTIMATE.dealloc(~#sf_u~2.base, ~#sf_u~2.offset); [L113] havoc ~#sf_u~2.base, ~#sf_u~2.offset; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L117-L119] assume ~ha~0 - ~hb~0 > 251658240; [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L81-L208] ensures true; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L231] RET call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret36=1.0737418243E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L231] ~res~0 := #t~ret36; [L231] havoc #t~ret36; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233] CALL call #t~ret37 := isinf_float(~res~0); VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211-L220] ~x := #in~x; [L212] havoc ~ix~1; VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L214] call ~#gf_u~3.base, ~#gf_u~3.offset := #Ultimate.alloc(4); [L215] call write~real(~x, ~#gf_u~3.base, ~#gf_u~3.offset, 4); [L216] call #t~mem33 := read~int(~#gf_u~3.base, ~#gf_u~3.offset, 4); [L216] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L216] call write~real(#t~union34, ~#gf_u~3.base, ~#gf_u~3.offset, 4); [L216] havoc #t~mem33; [L216] havoc #t~union34; [L214] call ULTIMATE.dealloc(~#gf_u~3.base, ~#gf_u~3.offset); [L214] havoc ~#gf_u~3.base, ~#gf_u~3.offset; VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L218] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L219] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, #res=0, ~ix~1=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L211-L220] ensures true; VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, #res=0, ~ix~1=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L233] RET call #t~ret37 := isinf_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233] assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233-L236] assume 0 == #t~ret37; [L233] havoc #t~ret37; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L234] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=10737418250, #NULL.offset=10737418241, old(#NULL.base)=10737418250, old(#NULL.offset)=10737418241, old(~one_sqrt~0)=1.0737418248E10, old(~tiny_sqrt~0)=1.0737418258E10, ~one_sqrt~0=1.0737418248E10, ~tiny_sqrt~0=1.0737418258E10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10737418250, old(#NULL.offset)=10737418241, old(~one_sqrt~0)=1.0737418248E10, old(~tiny_sqrt~0)=1.0737418258E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10737418250, old(#NULL.offset)=10737418241, old(~one_sqrt~0)=1.0737418248E10, old(~tiny_sqrt~0)=1.0737418258E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] CALL call #t~ret38 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L229] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); [L230] ~y~0 := #t~nondet35; [L230] havoc #t~nondet35; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418259E10] [L231] CALL call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L81-L208] ~x := #in~x; [L81-L208] ~y := #in~y; [L82] ~a~0 := ~x; [L82] ~b~0 := ~y; [L82] havoc ~t1~0; [L82] havoc ~t2~0; [L82] havoc ~y1~0; [L82] havoc ~y2~0; [L82] havoc ~w~0; [L83] havoc ~j~0; [L83] havoc ~k~0; [L83] havoc ~ha~0; [L83] havoc ~hb~0; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L86] call ~#gf_u~1.base, ~#gf_u~1.offset := #Ultimate.alloc(4); [L87] call write~real(~x, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L88] call #t~mem5 := read~int(~#gf_u~1.base, ~#gf_u~1.offset, 4); [L88] ~ha~0 := (if #t~mem5 % 4294967296 % 4294967296 <= 2147483647 then #t~mem5 % 4294967296 % 4294967296 else #t~mem5 % 4294967296 % 4294967296 - 4294967296); [L88] call write~real(#t~union6, ~#gf_u~1.base, ~#gf_u~1.offset, 4); [L88] havoc #t~mem5; [L88] havoc #t~union6; [L86] call ULTIMATE.dealloc(~#gf_u~1.base, ~#gf_u~1.offset); [L86] havoc ~#gf_u~1.base, ~#gf_u~1.offset; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~ha~0=2147483647, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L92] call ~#gf_u~2.base, ~#gf_u~2.offset := #Ultimate.alloc(4); [L93] call write~real(~y, ~#gf_u~2.base, ~#gf_u~2.offset, 4); [L94] call #t~mem7 := read~int(~#gf_u~2.base, ~#gf_u~2.offset, 4); [L94] ~hb~0 := (if #t~mem7 % 4294967296 % 4294967296 <= 2147483647 then #t~mem7 % 4294967296 % 4294967296 else #t~mem7 % 4294967296 % 4294967296 - 4294967296); [L94] call write~real(#t~union8, ~#gf_u~2.base, ~#gf_u~2.offset, 4); [L94] havoc #t~union8; [L94] havoc #t~mem7; [L92] call ULTIMATE.dealloc(~#gf_u~2.base, ~#gf_u~2.offset); [L92] havoc ~#gf_u~2.base, ~#gf_u~2.offset; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~hb~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L97-L106] assume ~hb~0 > ~ha~0; [L98] ~a~0 := ~y; [L99] ~b~0 := ~x; [L100] ~j~0 := ~ha~0; [L101] ~ha~0 := ~hb~0; [L102] ~hb~0 := ~j~0; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418259E10, ~b~0=1.0737418246E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L108] call ~#sf_u~1.base, ~#sf_u~1.offset := #Ultimate.alloc(4); [L109] call write~int(~ha~0, ~#sf_u~1.base, ~#sf_u~1.offset, 4); [L110] call #t~mem9 := read~real(~#sf_u~1.base, ~#sf_u~1.offset, 4); [L110] ~a~0 := #t~mem9; [L110] call write~int(#t~union10, ~#sf_u~1.base, ~#sf_u~1.offset, 4); [L110] havoc #t~mem9; [L110] havoc #t~union10; [L108] call ULTIMATE.dealloc(~#sf_u~1.base, ~#sf_u~1.offset); [L108] havoc ~#sf_u~1.base, ~#sf_u~1.offset; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418246E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L113] call ~#sf_u~2.base, ~#sf_u~2.offset := #Ultimate.alloc(4); [L114] call write~int(~hb~0, ~#sf_u~2.base, ~#sf_u~2.offset, 4); [L115] call #t~mem11 := read~real(~#sf_u~2.base, ~#sf_u~2.offset, 4); [L115] ~b~0 := #t~mem11; [L115] call write~int(#t~union12, ~#sf_u~2.base, ~#sf_u~2.offset, 4); [L115] havoc #t~union12; [L115] havoc #t~mem11; [L113] call ULTIMATE.dealloc(~#sf_u~2.base, ~#sf_u~2.offset); [L113] havoc ~#sf_u~2.base, ~#sf_u~2.offset; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L117-L119] assume ~ha~0 - ~hb~0 > 251658240; [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L81-L208] ensures true; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L231] RET call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret36=1.0737418243E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L231] ~res~0 := #t~ret36; [L231] havoc #t~ret36; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233] CALL call #t~ret37 := isinf_float(~res~0); VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211-L220] ~x := #in~x; [L212] havoc ~ix~1; VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L214] call ~#gf_u~3.base, ~#gf_u~3.offset := #Ultimate.alloc(4); [L215] call write~real(~x, ~#gf_u~3.base, ~#gf_u~3.offset, 4); [L216] call #t~mem33 := read~int(~#gf_u~3.base, ~#gf_u~3.offset, 4); [L216] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L216] call write~real(#t~union34, ~#gf_u~3.base, ~#gf_u~3.offset, 4); [L216] havoc #t~mem33; [L216] havoc #t~union34; [L214] call ULTIMATE.dealloc(~#gf_u~3.base, ~#gf_u~3.offset); [L214] havoc ~#gf_u~3.base, ~#gf_u~3.offset; VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L218] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L219] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, #res=0, ~ix~1=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L211-L220] ensures true; VAL [#in~x=1.0737418243E10, #NULL.base=0, #NULL.offset=0, #res=0, ~ix~1=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L233] RET call #t~ret37 := isinf_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233] assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233-L236] assume 0 == #t~ret37; [L233] havoc #t~ret37; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L234] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418250, #NULL!offset=10737418241, old(#NULL!base)=10737418250, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418248E10, old(~tiny_sqrt~0)=1.0737418258E10, ~one_sqrt~0=1.0737418248E10, ~tiny_sqrt~0=1.0737418258E10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10737418250, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418248E10, old(~tiny_sqrt~0)=1.0737418258E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] CALL call #t~ret38 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L229] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); [L230] ~y~0 := #t~nondet35; [L230] havoc #t~nondet35; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418259E10] [L231] CALL call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L81-L208] ~x := #in~x; [L81-L208] ~y := #in~y; [L82] ~a~0 := ~x; [L82] ~b~0 := ~y; [L82] havoc ~t1~0; [L82] havoc ~t2~0; [L82] havoc ~y1~0; [L82] havoc ~y2~0; [L82] havoc ~w~0; [L83] havoc ~j~0; [L83] havoc ~k~0; [L83] havoc ~ha~0; [L83] havoc ~hb~0; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L86] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L87] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] FCALL call #t~mem5 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] ~ha~0 := (if #t~mem5 % 4294967296 % 4294967296 <= 2147483647 then #t~mem5 % 4294967296 % 4294967296 else #t~mem5 % 4294967296 % 4294967296 - 4294967296); [L88] FCALL call write~real(#t~union6, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] havoc #t~mem5; [L88] havoc #t~union6; [L86] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L86] havoc ~#gf_u~1; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~ha~0=2147483647, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L92] FCALL call ~#gf_u~2 := #Ultimate.alloc(4); [L93] FCALL call write~real(~y, { base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] FCALL call #t~mem7 := read~int({ base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] ~hb~0 := (if #t~mem7 % 4294967296 % 4294967296 <= 2147483647 then #t~mem7 % 4294967296 % 4294967296 else #t~mem7 % 4294967296 % 4294967296 - 4294967296); [L94] FCALL call write~real(#t~union8, { base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] havoc #t~union8; [L94] havoc #t~mem7; [L92] FCALL call ULTIMATE.dealloc(~#gf_u~2); [L92] havoc ~#gf_u~2; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~hb~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L97] COND TRUE ~hb~0 > ~ha~0 [L98] ~a~0 := ~y; [L99] ~b~0 := ~x; [L100] ~j~0 := ~ha~0; [L101] ~ha~0 := ~hb~0; [L102] ~hb~0 := ~j~0; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418259E10, ~b~0=1.0737418246E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L108] FCALL call ~#sf_u~1 := #Ultimate.alloc(4); [L109] FCALL call write~int(~ha~0, { base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] FCALL call #t~mem9 := read~real({ base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] ~a~0 := #t~mem9; [L110] FCALL call write~int(#t~union10, { base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] havoc #t~mem9; [L110] havoc #t~union10; [L108] FCALL call ULTIMATE.dealloc(~#sf_u~1); [L108] havoc ~#sf_u~1; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418246E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L113] FCALL call ~#sf_u~2 := #Ultimate.alloc(4); [L114] FCALL call write~int(~hb~0, { base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] FCALL call #t~mem11 := read~real({ base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] ~b~0 := #t~mem11; [L115] FCALL call write~int(#t~union12, { base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] havoc #t~union12; [L115] havoc #t~mem11; [L113] FCALL call ULTIMATE.dealloc(~#sf_u~2); [L113] havoc ~#sf_u~2; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L117] COND TRUE ~ha~0 - ~hb~0 > 251658240 [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L231] RET call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret36=1.0737418243E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L231] ~res~0 := #t~ret36; [L231] havoc #t~ret36; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233] CALL call #t~ret37 := isinf_float(~res~0); VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211-L220] ~x := #in~x; [L212] havoc ~ix~1; VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L214] FCALL call ~#gf_u~3 := #Ultimate.alloc(4); [L215] FCALL call write~real(~x, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] FCALL call #t~mem33 := read~int({ base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L216] FCALL call write~real(#t~union34, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] havoc #t~mem33; [L216] havoc #t~union34; [L214] FCALL call ULTIMATE.dealloc(~#gf_u~3); [L214] havoc ~#gf_u~3; VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L218] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L219] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, #res=0, ~ix~1=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L233] RET call #t~ret37 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233] assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233] COND TRUE 0 == #t~ret37 [L233] havoc #t~ret37; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L234] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418250, #NULL!offset=10737418241, old(#NULL!base)=10737418250, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418248E10, old(~tiny_sqrt~0)=1.0737418258E10, ~one_sqrt~0=1.0737418248E10, ~tiny_sqrt~0=1.0737418258E10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10737418250, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418248E10, old(~tiny_sqrt~0)=1.0737418258E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] CALL call #t~ret38 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L229] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); [L230] ~y~0 := #t~nondet35; [L230] havoc #t~nondet35; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418259E10] [L231] CALL call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L81-L208] ~x := #in~x; [L81-L208] ~y := #in~y; [L82] ~a~0 := ~x; [L82] ~b~0 := ~y; [L82] havoc ~t1~0; [L82] havoc ~t2~0; [L82] havoc ~y1~0; [L82] havoc ~y2~0; [L82] havoc ~w~0; [L83] havoc ~j~0; [L83] havoc ~k~0; [L83] havoc ~ha~0; [L83] havoc ~hb~0; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L86] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L87] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] FCALL call #t~mem5 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] ~ha~0 := (if #t~mem5 % 4294967296 % 4294967296 <= 2147483647 then #t~mem5 % 4294967296 % 4294967296 else #t~mem5 % 4294967296 % 4294967296 - 4294967296); [L88] FCALL call write~real(#t~union6, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] havoc #t~mem5; [L88] havoc #t~union6; [L86] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L86] havoc ~#gf_u~1; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~ha~0=2147483647, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L92] FCALL call ~#gf_u~2 := #Ultimate.alloc(4); [L93] FCALL call write~real(~y, { base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] FCALL call #t~mem7 := read~int({ base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] ~hb~0 := (if #t~mem7 % 4294967296 % 4294967296 <= 2147483647 then #t~mem7 % 4294967296 % 4294967296 else #t~mem7 % 4294967296 % 4294967296 - 4294967296); [L94] FCALL call write~real(#t~union8, { base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] havoc #t~union8; [L94] havoc #t~mem7; [L92] FCALL call ULTIMATE.dealloc(~#gf_u~2); [L92] havoc ~#gf_u~2; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~hb~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L97] COND TRUE ~hb~0 > ~ha~0 [L98] ~a~0 := ~y; [L99] ~b~0 := ~x; [L100] ~j~0 := ~ha~0; [L101] ~ha~0 := ~hb~0; [L102] ~hb~0 := ~j~0; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418259E10, ~b~0=1.0737418246E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L108] FCALL call ~#sf_u~1 := #Ultimate.alloc(4); [L109] FCALL call write~int(~ha~0, { base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] FCALL call #t~mem9 := read~real({ base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] ~a~0 := #t~mem9; [L110] FCALL call write~int(#t~union10, { base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] havoc #t~mem9; [L110] havoc #t~union10; [L108] FCALL call ULTIMATE.dealloc(~#sf_u~1); [L108] havoc ~#sf_u~1; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418246E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L113] FCALL call ~#sf_u~2 := #Ultimate.alloc(4); [L114] FCALL call write~int(~hb~0, { base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] FCALL call #t~mem11 := read~real({ base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] ~b~0 := #t~mem11; [L115] FCALL call write~int(#t~union12, { base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] havoc #t~union12; [L115] havoc #t~mem11; [L113] FCALL call ULTIMATE.dealloc(~#sf_u~2); [L113] havoc ~#sf_u~2; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L117] COND TRUE ~ha~0 - ~hb~0 > 251658240 [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L231] RET call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret36=1.0737418243E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L231] ~res~0 := #t~ret36; [L231] havoc #t~ret36; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233] CALL call #t~ret37 := isinf_float(~res~0); VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211-L220] ~x := #in~x; [L212] havoc ~ix~1; VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L214] FCALL call ~#gf_u~3 := #Ultimate.alloc(4); [L215] FCALL call write~real(~x, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] FCALL call #t~mem33 := read~int({ base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L216] FCALL call write~real(#t~union34, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] havoc #t~mem33; [L216] havoc #t~union34; [L214] FCALL call ULTIMATE.dealloc(~#gf_u~3); [L214] havoc ~#gf_u~3; VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L218] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L219] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, #res=0, ~ix~1=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L233] RET call #t~ret37 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233] assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233] COND TRUE 0 == #t~ret37 [L233] havoc #t~ret37; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L234] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418250, #NULL!offset=10737418241, old(#NULL!base)=10737418250, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418248E10, old(~tiny_sqrt~0)=1.0737418258E10, ~one_sqrt~0=1.0737418248E10, ~tiny_sqrt~0=1.0737418258E10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10737418250, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418248E10, old(~tiny_sqrt~0)=1.0737418258E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] CALL call #t~ret38 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L229] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); [L230] ~y~0 := #t~nondet35; [L230] havoc #t~nondet35; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418259E10] [L231] CALL call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L81-L208] ~x := #in~x; [L81-L208] ~y := #in~y; [L82] ~a~0 := ~x; [L82] ~b~0 := ~y; [L82] havoc ~t1~0; [L82] havoc ~t2~0; [L82] havoc ~y1~0; [L82] havoc ~y2~0; [L82] havoc ~w~0; [L83] havoc ~j~0; [L83] havoc ~k~0; [L83] havoc ~ha~0; [L83] havoc ~hb~0; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L86] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L87] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] FCALL call #t~mem5 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] ~ha~0 := (if #t~mem5 % 4294967296 % 4294967296 <= 2147483647 then #t~mem5 % 4294967296 % 4294967296 else #t~mem5 % 4294967296 % 4294967296 - 4294967296); [L88] FCALL call write~real(#t~union6, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] havoc #t~mem5; [L88] havoc #t~union6; [L86] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L86] havoc ~#gf_u~1; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~ha~0=2147483647, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L92] FCALL call ~#gf_u~2 := #Ultimate.alloc(4); [L93] FCALL call write~real(~y, { base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] FCALL call #t~mem7 := read~int({ base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] ~hb~0 := (if #t~mem7 % 4294967296 % 4294967296 <= 2147483647 then #t~mem7 % 4294967296 % 4294967296 else #t~mem7 % 4294967296 % 4294967296 - 4294967296); [L94] FCALL call write~real(#t~union8, { base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] havoc #t~union8; [L94] havoc #t~mem7; [L92] FCALL call ULTIMATE.dealloc(~#gf_u~2); [L92] havoc ~#gf_u~2; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~hb~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L97] COND TRUE ~hb~0 > ~ha~0 [L98] ~a~0 := ~y; [L99] ~b~0 := ~x; [L100] ~j~0 := ~ha~0; [L101] ~ha~0 := ~hb~0; [L102] ~hb~0 := ~j~0; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418259E10, ~b~0=1.0737418246E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L108] FCALL call ~#sf_u~1 := #Ultimate.alloc(4); [L109] FCALL call write~int(~ha~0, { base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] FCALL call #t~mem9 := read~real({ base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] ~a~0 := #t~mem9; [L110] FCALL call write~int(#t~union10, { base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] havoc #t~mem9; [L110] havoc #t~union10; [L108] FCALL call ULTIMATE.dealloc(~#sf_u~1); [L108] havoc ~#sf_u~1; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418246E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L113] FCALL call ~#sf_u~2 := #Ultimate.alloc(4); [L114] FCALL call write~int(~hb~0, { base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] FCALL call #t~mem11 := read~real({ base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] ~b~0 := #t~mem11; [L115] FCALL call write~int(#t~union12, { base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] havoc #t~union12; [L115] havoc #t~mem11; [L113] FCALL call ULTIMATE.dealloc(~#sf_u~2); [L113] havoc ~#sf_u~2; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L117] COND TRUE ~ha~0 - ~hb~0 > 251658240 [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L231] RET call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret36=1.0737418243E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L231] ~res~0 := #t~ret36; [L231] havoc #t~ret36; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233] CALL call #t~ret37 := isinf_float(~res~0); VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211-L220] ~x := #in~x; [L212] havoc ~ix~1; VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L214] FCALL call ~#gf_u~3 := #Ultimate.alloc(4); [L215] FCALL call write~real(~x, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] FCALL call #t~mem33 := read~int({ base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L216] FCALL call write~real(#t~union34, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] havoc #t~mem33; [L216] havoc #t~union34; [L214] FCALL call ULTIMATE.dealloc(~#gf_u~3); [L214] havoc ~#gf_u~3; VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L218] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L219] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, #res=0, ~ix~1=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L233] RET call #t~ret37 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233] assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233] COND TRUE 0 == #t~ret37 [L233] havoc #t~ret37; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L234] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418250, #NULL!offset=10737418241, old(#NULL!base)=10737418250, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418248E10, old(~tiny_sqrt~0)=1.0737418258E10, ~one_sqrt~0=1.0737418248E10, ~tiny_sqrt~0=1.0737418258E10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10737418250, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418248E10, old(~tiny_sqrt~0)=1.0737418258E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] CALL call #t~ret38 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L229] ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0); [L230] ~y~0 := #t~nondet35; [L230] havoc #t~nondet35; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418259E10] [L231] CALL call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L81-L208] ~x := #in~x; [L81-L208] ~y := #in~y; [L82] ~a~0 := ~x; [L82] ~b~0 := ~y; [L82] havoc ~t1~0; [L82] havoc ~t2~0; [L82] havoc ~y1~0; [L82] havoc ~y2~0; [L82] havoc ~w~0; [L83] havoc ~j~0; [L83] havoc ~k~0; [L83] havoc ~ha~0; [L83] havoc ~hb~0; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L86] FCALL call ~#gf_u~1 := #Ultimate.alloc(4); [L87] FCALL call write~real(~x, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] FCALL call #t~mem5 := read~int({ base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] ~ha~0 := (if #t~mem5 % 4294967296 % 4294967296 <= 2147483647 then #t~mem5 % 4294967296 % 4294967296 else #t~mem5 % 4294967296 % 4294967296 - 4294967296); [L88] FCALL call write~real(#t~union6, { base: ~#gf_u~1!base, offset: ~#gf_u~1!offset }, 4); [L88] havoc #t~mem5; [L88] havoc #t~union6; [L86] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L86] havoc ~#gf_u~1; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~ha~0=2147483647, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L92] FCALL call ~#gf_u~2 := #Ultimate.alloc(4); [L93] FCALL call write~real(~y, { base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] FCALL call #t~mem7 := read~int({ base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] ~hb~0 := (if #t~mem7 % 4294967296 % 4294967296 <= 2147483647 then #t~mem7 % 4294967296 % 4294967296 else #t~mem7 % 4294967296 % 4294967296 - 4294967296); [L94] FCALL call write~real(#t~union8, { base: ~#gf_u~2!base, offset: ~#gf_u~2!offset }, 4); [L94] havoc #t~union8; [L94] havoc #t~mem7; [L92] FCALL call ULTIMATE.dealloc(~#gf_u~2); [L92] havoc ~#gf_u~2; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~hb~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418246E10, ~b~0=1.0737418259E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L97] COND TRUE ~hb~0 > ~ha~0 [L98] ~a~0 := ~y; [L99] ~b~0 := ~x; [L100] ~j~0 := ~ha~0; [L101] ~ha~0 := ~hb~0; [L102] ~hb~0 := ~j~0; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418259E10, ~b~0=1.0737418246E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L108] FCALL call ~#sf_u~1 := #Ultimate.alloc(4); [L109] FCALL call write~int(~ha~0, { base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] FCALL call #t~mem9 := read~real({ base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] ~a~0 := #t~mem9; [L110] FCALL call write~int(#t~union10, { base: ~#sf_u~1!base, offset: ~#sf_u~1!offset }, 4); [L110] havoc #t~mem9; [L110] havoc #t~union10; [L108] FCALL call ULTIMATE.dealloc(~#sf_u~1); [L108] havoc ~#sf_u~1; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418246E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L113] FCALL call ~#sf_u~2 := #Ultimate.alloc(4); [L114] FCALL call write~int(~hb~0, { base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] FCALL call #t~mem11 := read~real({ base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] ~b~0 := #t~mem11; [L115] FCALL call write~int(#t~union12, { base: ~#sf_u~2!base, offset: ~#sf_u~2!offset }, 4); [L115] havoc #t~union12; [L115] havoc #t~mem11; [L113] FCALL call ULTIMATE.dealloc(~#sf_u~2); [L113] havoc ~#sf_u~2; VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L117] COND TRUE ~ha~0 - ~hb~0 > 251658240 [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418246E10, #in~y=1.0737418259E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418263E10, ~b~0=1.0737418264E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418246E10, ~y=1.0737418259E10] [L231] RET call #t~ret36 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret36=1.0737418243E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L231] ~res~0 := #t~ret36; [L231] havoc #t~ret36; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233] CALL call #t~ret37 := isinf_float(~res~0); VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211-L220] ~x := #in~x; [L212] havoc ~ix~1; VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L214] FCALL call ~#gf_u~3 := #Ultimate.alloc(4); [L215] FCALL call write~real(~x, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] FCALL call #t~mem33 := read~int({ base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L216] FCALL call write~real(#t~union34, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L216] havoc #t~mem33; [L216] havoc #t~union34; [L214] FCALL call ULTIMATE.dealloc(~#gf_u~3); [L214] havoc ~#gf_u~3; VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L218] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L219] #res := (if 2139095040 == ~ix~1 then 1 else 0); VAL [#in~x=1.0737418243E10, #NULL!base=0, #NULL!offset=0, #res=0, ~ix~1=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418243E10] [L233] RET call #t~ret37 := isinf_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233] assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L233] COND TRUE 0 == #t~ret37 [L233] havoc #t~ret37; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L234] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418243E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418246E10, ~y~0=1.0737418259E10] [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [\old(one_sqrt)=10737418248, \old(tiny_sqrt)=10737418258, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L229] float x = 1.0f / 0.0f; [L230] float y = __VERIFIER_nondet_float(); [L231] CALL, EXPR __ieee754_hypotf(x, y) VAL [\old(x)=10737418246, \old(y)=10737418259, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L82] float a = x, b = y, t1, t2, y1, y2, w; [L83] __int32_t j, k, ha, hb; VAL [\old(x)=10737418246, \old(y)=10737418259, a=10737418246, b=10737418259, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418246, y=10737418259] [L86] ieee_float_shape_type gf_u; [L87] gf_u.value = (x) [L88] EXPR gf_u.word [L88] (ha) = gf_u.word [L90] ha &= 0x7fffffffL VAL [\old(x)=10737418246, \old(y)=10737418259, a=10737418246, b=10737418259, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418246, y=10737418259] [L92] ieee_float_shape_type gf_u; [L93] gf_u.value = (y) [L94] EXPR gf_u.word [L94] (hb) = gf_u.word [L96] hb &= 0x7fffffffL VAL [\old(x)=10737418246, \old(y)=10737418259, a=10737418246, b=10737418259, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418246, y=10737418259] [L97] COND TRUE hb > ha [L98] a = y [L99] b = x [L100] j = ha [L101] ha = hb [L102] hb = j VAL [\old(x)=10737418246, \old(y)=10737418259, a=10737418259, b=10737418246, ha=251658239, hb=-2, j=-2, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418246, y=10737418259] [L108] ieee_float_shape_type sf_u; [L109] sf_u.word = (ha) [L110] EXPR sf_u.value [L110] (a) = sf_u.value [L113] ieee_float_shape_type sf_u; [L114] sf_u.word = (hb) [L115] EXPR sf_u.value [L115] (b) = sf_u.value [L117] COND TRUE (ha - hb) > 0xf000000L [L118] return a + b; VAL [\old(x)=10737418246, \old(y)=10737418259, a=10737418263, b=10737418264, ha=251658239, hb=-2, j=-2, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418246, y=10737418259] [L231] RET, EXPR __ieee754_hypotf(x, y) VAL [__ieee754_hypotf(x, y)=10737418243, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418246, y=10737418259] [L231] float res = __ieee754_hypotf(x, y); [L233] CALL, EXPR isinf_float(res) VAL [\old(x)=10737418243, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L212] __int32_t ix; VAL [\old(x)=10737418243, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243] [L214] ieee_float_shape_type gf_u; [L215] gf_u.value = (x) [L216] EXPR gf_u.word [L216] (ix) = gf_u.word [L218] ix &= 0x7fffffff [L219] return ((ix) == 0x7f800000L); VAL [\old(x)=10737418243, \result=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243] [L233] RET, EXPR isinf_float(res) VAL [isinf_float(res)=0, one_sqrt=1, res=10737418243, tiny_sqrt=1/1000000000000000000000000000000, x=10737418246, y=10737418259] [L233] COND TRUE !isinf_float(res) [L234] __VERIFIER_error() VAL [one_sqrt=1, res=10737418243, tiny_sqrt=1/1000000000000000000000000000000, x=10737418246, y=10737418259] ----- [2018-11-23 13:54:00,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:54:00 BoogieIcfgContainer [2018-11-23 13:54:00,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:54:00,761 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:54:00,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:54:00,762 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:54:00,762 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:54:00" (3/4) ... [2018-11-23 13:54:00,765 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:54:00,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:54:00,766 INFO L168 Benchmark]: Toolchain (without parser) took 1189.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 961.9 MB in the beginning and 1.0 GB in the end (delta: -81.4 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:54:00,768 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:54:00,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:54:00,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:54:00,769 INFO L168 Benchmark]: Boogie Preprocessor took 37.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:54:00,769 INFO L168 Benchmark]: RCFGBuilder took 456.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:54:00,770 INFO L168 Benchmark]: TraceAbstraction took 395.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:54:00,770 INFO L168 Benchmark]: Witness Printer took 3.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:54:00,772 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 270.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 456.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 395.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 234]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 118, overapproximation of bitwiseAnd at line 218. Possible FailurePath: [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [\old(one_sqrt)=10737418248, \old(tiny_sqrt)=10737418258, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L229] float x = 1.0f / 0.0f; [L230] float y = __VERIFIER_nondet_float(); [L231] CALL, EXPR __ieee754_hypotf(x, y) VAL [\old(x)=10737418246, \old(y)=10737418259, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L82] float a = x, b = y, t1, t2, y1, y2, w; [L83] __int32_t j, k, ha, hb; VAL [\old(x)=10737418246, \old(y)=10737418259, a=10737418246, b=10737418259, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418246, y=10737418259] [L86] ieee_float_shape_type gf_u; [L87] gf_u.value = (x) [L88] EXPR gf_u.word [L88] (ha) = gf_u.word [L90] ha &= 0x7fffffffL VAL [\old(x)=10737418246, \old(y)=10737418259, a=10737418246, b=10737418259, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418246, y=10737418259] [L92] ieee_float_shape_type gf_u; [L93] gf_u.value = (y) [L94] EXPR gf_u.word [L94] (hb) = gf_u.word [L96] hb &= 0x7fffffffL VAL [\old(x)=10737418246, \old(y)=10737418259, a=10737418246, b=10737418259, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418246, y=10737418259] [L97] COND TRUE hb > ha [L98] a = y [L99] b = x [L100] j = ha [L101] ha = hb [L102] hb = j VAL [\old(x)=10737418246, \old(y)=10737418259, a=10737418259, b=10737418246, ha=251658239, hb=-2, j=-2, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418246, y=10737418259] [L108] ieee_float_shape_type sf_u; [L109] sf_u.word = (ha) [L110] EXPR sf_u.value [L110] (a) = sf_u.value [L113] ieee_float_shape_type sf_u; [L114] sf_u.word = (hb) [L115] EXPR sf_u.value [L115] (b) = sf_u.value [L117] COND TRUE (ha - hb) > 0xf000000L [L118] return a + b; VAL [\old(x)=10737418246, \old(y)=10737418259, a=10737418263, b=10737418264, ha=251658239, hb=-2, j=-2, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418246, y=10737418259] [L231] RET, EXPR __ieee754_hypotf(x, y) VAL [__ieee754_hypotf(x, y)=10737418243, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418246, y=10737418259] [L231] float res = __ieee754_hypotf(x, y); [L233] CALL, EXPR isinf_float(res) VAL [\old(x)=10737418243, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L212] __int32_t ix; VAL [\old(x)=10737418243, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243] [L214] ieee_float_shape_type gf_u; [L215] gf_u.value = (x) [L216] EXPR gf_u.word [L216] (ix) = gf_u.word [L218] ix &= 0x7fffffff [L219] return ((ix) == 0x7f800000L); VAL [\old(x)=10737418243, \result=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418243] [L233] RET, EXPR isinf_float(res) VAL [isinf_float(res)=0, one_sqrt=1, res=10737418243, tiny_sqrt=1/1000000000000000000000000000000, x=10737418246, y=10737418259] [L233] COND TRUE !isinf_float(res) [L234] __VERIFIER_error() VAL [one_sqrt=1, res=10737418243, tiny_sqrt=1/1000000000000000000000000000000, x=10737418246, y=10737418259] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 102 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 124 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 13:54:02,183 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:54:02,184 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:54:02,191 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:54:02,192 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:54:02,192 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:54:02,193 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:54:02,194 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:54:02,195 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:54:02,196 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:54:02,196 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:54:02,197 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:54:02,197 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:54:02,198 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:54:02,199 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:54:02,199 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:54:02,200 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:54:02,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:54:02,202 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:54:02,203 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:54:02,204 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:54:02,205 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:54:02,206 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:54:02,207 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:54:02,207 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:54:02,207 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:54:02,208 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:54:02,208 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:54:02,209 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:54:02,210 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:54:02,210 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:54:02,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:54:02,211 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:54:02,211 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:54:02,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:54:02,212 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:54:02,212 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 13:54:02,222 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:54:02,223 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:54:02,223 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:54:02,223 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:54:02,224 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 13:54:02,224 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 13:54:02,224 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 13:54:02,224 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 13:54:02,224 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 13:54:02,224 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 13:54:02,225 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:54:02,225 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:54:02,225 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:54:02,225 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:54:02,225 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:54:02,225 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:54:02,225 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:54:02,226 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 13:54:02,226 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 13:54:02,226 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:54:02,226 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:54:02,226 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:54:02,226 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:54:02,226 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:54:02,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:54:02,227 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:54:02,227 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:54:02,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:54:02,227 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:54:02,227 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:54:02,227 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:54:02,228 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 13:54:02,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:54:02,228 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 13:54:02,228 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 13:54:02,228 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa333650cb1e4cf3e280683e8b2ad72d19029b0d [2018-11-23 13:54:02,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:54:02,263 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:54:02,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:54:02,266 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:54:02,266 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:54:02,266 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1270a_true-unreach-call.c [2018-11-23 13:54:02,300 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/data/9026badc3/fb8900232add4f508fbf3869cf6adc08/FLAG0de534ff1 [2018-11-23 13:54:02,700 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:54:02,701 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/sv-benchmarks/c/float-newlib/float_req_bl_1270a_true-unreach-call.c [2018-11-23 13:54:02,705 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/data/9026badc3/fb8900232add4f508fbf3869cf6adc08/FLAG0de534ff1 [2018-11-23 13:54:02,715 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/data/9026badc3/fb8900232add4f508fbf3869cf6adc08 [2018-11-23 13:54:02,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:54:02,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:54:02,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:54:02,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:54:02,722 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:54:02,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:54:02" (1/1) ... [2018-11-23 13:54:02,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc5cec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:02, skipping insertion in model container [2018-11-23 13:54:02,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:54:02" (1/1) ... [2018-11-23 13:54:02,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:54:02,756 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:54:02,911 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:54:02,915 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:54:02,950 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:54:02,971 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:54:02,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:02 WrapperNode [2018-11-23 13:54:02,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:54:02,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:54:02,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:54:02,972 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:54:02,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:02" (1/1) ... [2018-11-23 13:54:02,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:02" (1/1) ... [2018-11-23 13:54:02,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:54:02,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:54:02,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:54:02,997 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:54:03,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:02" (1/1) ... [2018-11-23 13:54:03,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:02" (1/1) ... [2018-11-23 13:54:03,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:02" (1/1) ... [2018-11-23 13:54:03,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:02" (1/1) ... [2018-11-23 13:54:03,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:02" (1/1) ... [2018-11-23 13:54:03,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:02" (1/1) ... [2018-11-23 13:54:03,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:02" (1/1) ... [2018-11-23 13:54:03,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:54:03,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:54:03,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:54:03,075 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:54:03,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:54:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:54:03,108 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:54:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-23 13:54:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-11-23 13:54:03,108 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-11-23 13:54:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:54:03,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:54:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:54:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 13:54:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:54:03,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:54:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 13:54:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_hypotf [2018-11-23 13:54:03,110 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_hypotf [2018-11-23 13:54:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 13:54:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:54:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-11-23 13:54:03,110 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-11-23 13:54:04,362 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:54:04,362 INFO L280 CfgBuilder]: Removed 34 assue(true) statements. [2018-11-23 13:54:04,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:54:04 BoogieIcfgContainer [2018-11-23 13:54:04,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:54:04,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:54:04,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:54:04,365 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:54:04,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:54:02" (1/3) ... [2018-11-23 13:54:04,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789ee115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:54:04, skipping insertion in model container [2018-11-23 13:54:04,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:02" (2/3) ... [2018-11-23 13:54:04,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789ee115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:54:04, skipping insertion in model container [2018-11-23 13:54:04,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:54:04" (3/3) ... [2018-11-23 13:54:04,368 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270a_true-unreach-call.c [2018-11-23 13:54:04,373 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:54:04,379 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:54:04,388 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:54:04,408 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:54:04,408 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:54:04,408 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:54:04,409 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:54:04,409 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:54:04,409 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:54:04,409 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:54:04,409 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:54:04,409 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:54:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-11-23 13:54:04,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:54:04,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:54:04,428 INFO L402 BasicCegarLoop]: trace histogram [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-11-23 13:54:04,429 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:54:04,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:54:04,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1684593163, now seen corresponding path program 1 times [2018-11-23 13:54:04,436 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:54:04,436 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 13:54:04,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:54:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:54:04,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:54:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:54:04,534 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:54:04,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:54:04,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:54:04,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:54:04,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:54:04,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:54:04,553 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states. [2018-11-23 13:54:04,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:54:04,576 INFO L93 Difference]: Finished difference Result 194 states and 311 transitions. [2018-11-23 13:54:04,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:54:04,577 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 13:54:04,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:54:04,584 INFO L225 Difference]: With dead ends: 194 [2018-11-23 13:54:04,584 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 13:54:04,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-11-23 13:54:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 13:54:04,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-11-23 13:54:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 13:54:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2018-11-23 13:54:04,622 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 27 [2018-11-23 13:54:04,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:54:04,622 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2018-11-23 13:54:04,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:54:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2018-11-23 13:54:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:54:04,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:54:04,624 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-11-23 13:54:04,624 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:54:04,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:54:04,624 INFO L82 PathProgramCache]: Analyzing trace with hash -592227502, now seen corresponding path program 1 times [2018-11-23 13:54:04,625 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:54:04,625 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 13:54:04,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:54:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:54:04,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:54:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:54:04,990 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:54:05,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:54:05,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 13:54:05,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:54:05,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:54:05,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:54:05,005 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand 9 states. [2018-11-23 13:54:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:54:50,990 INFO L93 Difference]: Finished difference Result 223 states and 272 transitions. [2018-11-23 13:54:51,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:54:51,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-23 13:54:51,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:54:51,035 INFO L225 Difference]: With dead ends: 223 [2018-11-23 13:54:51,035 INFO L226 Difference]: Without dead ends: 150 [2018-11-23 13:54:51,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:54:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-23 13:54:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 112. [2018-11-23 13:54:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 13:54:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2018-11-23 13:54:51,051 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 32 [2018-11-23 13:54:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:54:51,052 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2018-11-23 13:54:51,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:54:51,052 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2018-11-23 13:54:51,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:54:51,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:54:51,053 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2018-11-23 13:54:51,053 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:54:51,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:54:51,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1708595088, now seen corresponding path program 1 times [2018-11-23 13:54:51,054 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:54:51,054 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 13:54:51,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:54:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:54:51,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:54:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:54:53,443 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:54:53,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:54:53,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-23 13:54:53,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:54:53,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:54:53,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:54:53,452 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand 16 states. [2018-11-23 13:54:59,424 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-23 13:55:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:55:18,021 INFO L93 Difference]: Finished difference Result 141 states and 170 transitions. [2018-11-23 13:55:18,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:55:18,029 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-11-23 13:55:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:55:18,030 INFO L225 Difference]: With dead ends: 141 [2018-11-23 13:55:18,030 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 13:55:18,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:55:18,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 13:55:18,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 112. [2018-11-23 13:55:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 13:55:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2018-11-23 13:55:18,041 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 32 [2018-11-23 13:55:18,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:55:18,042 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2018-11-23 13:55:18,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:55:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2018-11-23 13:55:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 13:55:18,043 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:55:18,043 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-11-23 13:55:18,044 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:55:18,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:55:18,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1068264538, now seen corresponding path program 1 times [2018-11-23 13:55:18,045 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:55:18,045 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 13:55:18,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:55:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:55:18,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:55:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:55:18,367 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:55:18,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:55:18,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 13:55:18,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:55:18,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:55:18,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:55:18,376 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand 11 states. [2018-11-23 13:55:43,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:55:43,440 INFO L93 Difference]: Finished difference Result 170 states and 202 transitions. [2018-11-23 13:55:43,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:55:43,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 13:55:43,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:55:43,476 INFO L225 Difference]: With dead ends: 170 [2018-11-23 13:55:43,476 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 13:55:43,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:55:43,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 13:55:43,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-11-23 13:55:43,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:55:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-23 13:55:43,480 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 37 [2018-11-23 13:55:43,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:55:43,481 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-23 13:55:43,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:55:43,481 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-23 13:55:43,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 13:55:43,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:55:43,481 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-11-23 13:55:43,482 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:55:43,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:55:43,482 INFO L82 PathProgramCache]: Analyzing trace with hash -211599140, now seen corresponding path program 1 times [2018-11-23 13:55:43,482 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:55:43,482 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 13:55:43,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:55:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:55:43,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:55:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:55:43,926 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:55:43,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:55:43,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-23 13:55:43,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:55:43,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:55:43,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:55:43,934 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 16 states. [2018-11-23 13:55:45,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:55:45,439 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-23 13:55:45,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:55:45,440 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-11-23 13:55:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:55:45,440 INFO L225 Difference]: With dead ends: 58 [2018-11-23 13:55:45,440 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 13:55:45,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:55:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 13:55:45,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-23 13:55:45,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:55:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-23 13:55:45,444 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 37 [2018-11-23 13:55:45,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:55:45,445 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-23 13:55:45,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:55:45,445 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-23 13:55:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 13:55:45,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:55:45,445 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-11-23 13:55:45,446 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:55:45,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:55:45,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1222716390, now seen corresponding path program 1 times [2018-11-23 13:55:45,446 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:55:45,446 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 13:55:45,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:55:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:55:45,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:55:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:55:45,618 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:55:45,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:55:45,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 13:55:45,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:55:45,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:55:45,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:55:45,631 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 8 states. [2018-11-23 13:55:46,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:55:46,102 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-11-23 13:55:46,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:55:46,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-23 13:55:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:55:46,104 INFO L225 Difference]: With dead ends: 65 [2018-11-23 13:55:46,104 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:55:46,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:55:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:55:46,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 13:55:46,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:55:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-23 13:55:46,107 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 37 [2018-11-23 13:55:46,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:55:46,107 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-23 13:55:46,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:55:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:55:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 13:55:46,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:55:46,108 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-11-23 13:55:46,108 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:55:46,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:55:46,108 INFO L82 PathProgramCache]: Analyzing trace with hash -737173796, now seen corresponding path program 1 times [2018-11-23 13:55:46,108 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:55:46,108 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-23 13:55:46,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:55:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:55:46,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:55:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:55:46,325 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:55:46,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:55:46,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 13:55:46,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:55:46,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:55:46,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:55:46,334 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 12 states. [2018-11-23 13:55:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:55:46,893 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:55:46,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:55:46,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 13:55:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:55:46,894 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:55:46,894 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:55:46,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:55:46,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:55:46,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 13:55:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:55:46,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 37 transitions. [2018-11-23 13:55:46,897 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 37 transitions. Word has length 37 [2018-11-23 13:55:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:55:46,898 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 37 transitions. [2018-11-23 13:55:46,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:55:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 37 transitions. [2018-11-23 13:55:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 13:55:46,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:55:46,899 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-11-23 13:55:46,899 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:55:46,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:55:46,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1748291046, now seen corresponding path program 1 times [2018-11-23 13:55:46,899 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:55:46,899 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-23 13:55:46,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:55:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:55:46,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:55:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:55:47,305 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:55:47,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:55:47,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 13:55:47,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:55:47,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:55:47,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:55:47,314 INFO L87 Difference]: Start difference. First operand 38 states and 37 transitions. Second operand 15 states. [2018-11-23 13:55:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:55:48,259 INFO L93 Difference]: Finished difference Result 38 states and 37 transitions. [2018-11-23 13:55:48,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:55:48,260 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-23 13:55:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:55:48,260 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:55:48,260 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:55:48,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:55:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:55:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:55:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:55:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:55:48,261 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-11-23 13:55:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:55:48,261 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:55:48,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:55:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:55:48,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:55:48,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:55:48,847 INFO L448 ceAbstractionStarter]: For program point L213-1(lines 213 217) no Hoare annotation was computed. [2018-11-23 13:55:48,847 INFO L444 ceAbstractionStarter]: At program point L213-2(lines 213 217) the Hoare annotation is: (= |isinf_float_#in~x| isinf_float_~x) [2018-11-23 13:55:48,847 INFO L448 ceAbstractionStarter]: For program point L213-3(lines 213 217) no Hoare annotation was computed. [2018-11-23 13:55:48,847 INFO L451 ceAbstractionStarter]: At program point isinf_floatENTRY(lines 211 220) the Hoare annotation is: true [2018-11-23 13:55:48,847 INFO L448 ceAbstractionStarter]: For program point isinf_floatEXIT(lines 211 220) no Hoare annotation was computed. [2018-11-23 13:55:48,848 INFO L448 ceAbstractionStarter]: For program point isinf_floatFINAL(lines 211 220) no Hoare annotation was computed. [2018-11-23 13:55:48,848 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:55:48,848 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:55:48,848 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:55:48,848 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:55:48,848 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:55:48,848 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:55:48,848 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:55:48,848 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 222 238) the Hoare annotation is: true [2018-11-23 13:55:48,848 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 222 238) no Hoare annotation was computed. [2018-11-23 13:55:48,848 INFO L448 ceAbstractionStarter]: For program point L234(line 234) no Hoare annotation was computed. [2018-11-23 13:55:48,848 INFO L444 ceAbstractionStarter]: At program point L233(line 233) the Hoare annotation is: (and (= main_~res~0 (fp (_ bv0 1) (_ bv255 8) (_ bv0 23))) (= main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) [2018-11-23 13:55:48,849 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 234) no Hoare annotation was computed. [2018-11-23 13:55:48,849 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 222 238) no Hoare annotation was computed. [2018-11-23 13:55:48,849 INFO L448 ceAbstractionStarter]: For program point L233-1(lines 233 236) no Hoare annotation was computed. [2018-11-23 13:55:48,849 INFO L444 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (= main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) [2018-11-23 13:55:48,849 INFO L448 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-23 13:55:48,849 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 127) no Hoare annotation was computed. [2018-11-23 13:55:48,849 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2018-11-23 13:55:48,849 INFO L444 ceAbstractionStarter]: At program point L85-2(lines 85 89) the Hoare annotation is: (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x) [2018-11-23 13:55:48,849 INFO L448 ceAbstractionStarter]: For program point L85-3(lines 85 89) no Hoare annotation was computed. [2018-11-23 13:55:48,849 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 176 180) no Hoare annotation was computed. [2018-11-23 13:55:48,849 INFO L444 ceAbstractionStarter]: At program point L176-2(lines 176 180) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x) (exists ((v___ieee754_hypotf_~ha~0_27 (_ BitVec 32))) (and (= |__ieee754_hypotf_#in~x| (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_27) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_27) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_27))) (bvsgt (_ bv2139095040 32) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_27))))) [2018-11-23 13:55:48,850 INFO L448 ceAbstractionStarter]: For program point L176-3(lines 176 180) no Hoare annotation was computed. [2018-11-23 13:55:48,850 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 185 189) no Hoare annotation was computed. [2018-11-23 13:55:48,850 INFO L444 ceAbstractionStarter]: At program point L185-2(lines 185 189) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x) (exists ((v___ieee754_hypotf_~ha~0_27 (_ BitVec 32))) (and (= |__ieee754_hypotf_#in~x| (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_27) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_27) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_27))) (bvsgt (_ bv2139095040 32) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_27))))) [2018-11-23 13:55:48,850 INFO L448 ceAbstractionStarter]: For program point L185-3(lines 185 189) no Hoare annotation was computed. [2018-11-23 13:55:48,850 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 161 165) no Hoare annotation was computed. [2018-11-23 13:55:48,850 INFO L444 ceAbstractionStarter]: At program point L161-2(lines 161 165) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x) (exists ((v___ieee754_hypotf_~ha~0_27 (_ BitVec 32))) (and (= |__ieee754_hypotf_#in~x| (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_27) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_27) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_27))) (bvsgt (_ bv2139095040 32) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_27))))) [2018-11-23 13:55:48,850 INFO L448 ceAbstractionStarter]: For program point __ieee754_hypotfFINAL(lines 81 208) no Hoare annotation was computed. [2018-11-23 13:55:48,850 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 172) no Hoare annotation was computed. [2018-11-23 13:55:48,850 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 116) no Hoare annotation was computed. [2018-11-23 13:55:48,850 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 81 208) no Hoare annotation was computed. [2018-11-23 13:55:48,850 INFO L448 ceAbstractionStarter]: For program point L112-2(lines 81 208) no Hoare annotation was computed. [2018-11-23 13:55:48,850 INFO L448 ceAbstractionStarter]: For program point __ieee754_hypotfEXIT(lines 81 208) no Hoare annotation was computed. [2018-11-23 13:55:48,851 INFO L451 ceAbstractionStarter]: At program point __ieee754_hypotfENTRY(lines 81 208) the Hoare annotation is: true [2018-11-23 13:55:48,851 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 144) no Hoare annotation was computed. [2018-11-23 13:55:48,851 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 81 208) no Hoare annotation was computed. [2018-11-23 13:55:48,851 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 171) no Hoare annotation was computed. [2018-11-23 13:55:48,851 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 106) no Hoare annotation was computed. [2018-11-23 13:55:48,851 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 129) no Hoare annotation was computed. [2018-11-23 13:55:48,851 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 143) no Hoare annotation was computed. [2018-11-23 13:55:48,851 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 121 144) no Hoare annotation was computed. [2018-11-23 13:55:48,851 INFO L444 ceAbstractionStarter]: At program point L197(line 197) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x) (exists ((v___ieee754_hypotf_~ha~0_27 (_ BitVec 32))) (and (= |__ieee754_hypotf_#in~x| (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_27) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_27) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_27))) (bvsgt (_ bv2139095040 32) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_27))))) [2018-11-23 13:55:48,851 INFO L448 ceAbstractionStarter]: For program point L197-1(line 197) no Hoare annotation was computed. [2018-11-23 13:55:48,851 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 171) no Hoare annotation was computed. [2018-11-23 13:55:48,851 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2018-11-23 13:55:48,852 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 81 208) no Hoare annotation was computed. [2018-11-23 13:55:48,852 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2018-11-23 13:55:48,852 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 91 95) no Hoare annotation was computed. [2018-11-23 13:55:48,852 INFO L448 ceAbstractionStarter]: For program point L124-2(lines 122 129) no Hoare annotation was computed. [2018-11-23 13:55:48,852 INFO L444 ceAbstractionStarter]: At program point L91-2(lines 91 95) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x) (exists ((v___ieee754_hypotf_~ha~0_29 (_ BitVec 32))) (and (= __ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_29)) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_29) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_29) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_29)) |__ieee754_hypotf_#in~x|)))) [2018-11-23 13:55:48,852 INFO L448 ceAbstractionStarter]: For program point L91-3(lines 91 95) no Hoare annotation was computed. [2018-11-23 13:55:48,852 INFO L444 ceAbstractionStarter]: At program point L182(line 182) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x) (exists ((v___ieee754_hypotf_~ha~0_27 (_ BitVec 32))) (and (= |__ieee754_hypotf_#in~x| (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_27) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_27) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_27))) (bvsgt (_ bv2139095040 32) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_27))))) [2018-11-23 13:55:48,852 INFO L448 ceAbstractionStarter]: For program point L182-1(line 182) no Hoare annotation was computed. [2018-11-23 13:55:48,852 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2018-11-23 13:55:48,852 INFO L444 ceAbstractionStarter]: At program point L149-2(lines 149 153) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x) (exists ((v___ieee754_hypotf_~ha~0_27 (_ BitVec 32))) (and (= |__ieee754_hypotf_#in~x| (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_27) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_27) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_27))) (bvsgt (_ bv2139095040 32) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_27))))) [2018-11-23 13:55:48,853 INFO L448 ceAbstractionStarter]: For program point L149-3(lines 149 153) no Hoare annotation was computed. [2018-11-23 13:55:48,853 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 170) no Hoare annotation was computed. [2018-11-23 13:55:48,853 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 157 171) no Hoare annotation was computed. [2018-11-23 13:55:48,853 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 191 195) no Hoare annotation was computed. [2018-11-23 13:55:48,853 INFO L444 ceAbstractionStarter]: At program point L191-2(lines 191 195) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x) (exists ((v___ieee754_hypotf_~ha~0_27 (_ BitVec 32))) (and (= |__ieee754_hypotf_#in~x| (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_27) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_27) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_27))) (bvsgt (_ bv2139095040 32) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_27))))) [2018-11-23 13:55:48,853 INFO L448 ceAbstractionStarter]: For program point L191-3(lines 191 195) no Hoare annotation was computed. [2018-11-23 13:55:48,853 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 198) no Hoare annotation was computed. [2018-11-23 13:55:48,853 INFO L448 ceAbstractionStarter]: For program point L175-2(lines 81 208) no Hoare annotation was computed. [2018-11-23 13:55:48,853 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 200 204) no Hoare annotation was computed. [2018-11-23 13:55:48,853 INFO L444 ceAbstractionStarter]: At program point L200-2(lines 200 204) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x) (exists ((v___ieee754_hypotf_~ha~0_27 (_ BitVec 32))) (and (= |__ieee754_hypotf_#in~x| (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_27) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_27) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_27))) (bvsgt (_ bv2139095040 32) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_27))))) [2018-11-23 13:55:48,853 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2018-11-23 13:55:48,853 INFO L448 ceAbstractionStarter]: For program point L200-3(lines 200 204) no Hoare annotation was computed. [2018-11-23 13:55:48,854 INFO L444 ceAbstractionStarter]: At program point L134-2(lines 134 138) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x) (exists ((v___ieee754_hypotf_~ha~0_27 (_ BitVec 32))) (and (= |__ieee754_hypotf_#in~x| (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_27) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_27) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_27))) (bvsgt (_ bv2139095040 32) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_27))))) [2018-11-23 13:55:48,854 INFO L448 ceAbstractionStarter]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2018-11-23 13:55:48,854 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 32) no Hoare annotation was computed. [2018-11-23 13:55:48,854 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2018-11-23 13:55:48,854 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2018-11-23 13:55:48,854 INFO L448 ceAbstractionStarter]: For program point L52-2(lines 52 56) no Hoare annotation was computed. [2018-11-23 13:55:48,854 INFO L451 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: true [2018-11-23 13:55:48,854 INFO L448 ceAbstractionStarter]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2018-11-23 13:55:48,854 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2018-11-23 13:55:48,854 INFO L451 ceAbstractionStarter]: At program point L73-2(lines 73 77) the Hoare annotation is: true [2018-11-23 13:55:48,854 INFO L448 ceAbstractionStarter]: For program point L73-3(lines 73 77) no Hoare annotation was computed. [2018-11-23 13:55:48,854 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 37) no Hoare annotation was computed. [2018-11-23 13:55:48,854 INFO L451 ceAbstractionStarter]: At program point L36-3(lines 36 37) the Hoare annotation is: true [2018-11-23 13:55:48,855 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 68) no Hoare annotation was computed. [2018-11-23 13:55:48,855 INFO L448 ceAbstractionStarter]: For program point L36-4(lines 36 37) no Hoare annotation was computed. [2018-11-23 13:55:48,855 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 70) no Hoare annotation was computed. [2018-11-23 13:55:48,855 INFO L451 ceAbstractionStarter]: At program point __ieee754_sqrtfENTRY(lines 14 79) the Hoare annotation is: true [2018-11-23 13:55:48,855 INFO L448 ceAbstractionStarter]: For program point __ieee754_sqrtfFINAL(lines 14 79) no Hoare annotation was computed. [2018-11-23 13:55:48,855 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 30) no Hoare annotation was computed. [2018-11-23 13:55:48,855 INFO L448 ceAbstractionStarter]: For program point __ieee754_sqrtfEXIT(lines 14 79) no Hoare annotation was computed. [2018-11-23 13:55:48,855 INFO L451 ceAbstractionStarter]: At program point L50-2(lines 50 59) the Hoare annotation is: true [2018-11-23 13:55:48,855 INFO L448 ceAbstractionStarter]: For program point L50-3(lines 14 79) no Hoare annotation was computed. [2018-11-23 13:55:48,855 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2018-11-23 13:55:48,855 INFO L448 ceAbstractionStarter]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2018-11-23 13:55:48,855 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 69) no Hoare annotation was computed. [2018-11-23 13:55:48,855 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 27) no Hoare annotation was computed. [2018-11-23 13:55:48,856 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2018-11-23 13:55:48,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 13:55:48,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 13:55:48,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 13:55:48,872 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 13:55:48,873 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 13:55:48,873 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 13:55:48,873 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 13:55:48,873 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 13:55:48,873 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,874 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,874 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,874 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,874 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,874 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,875 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,875 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,875 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,875 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,876 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,876 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,876 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,876 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,876 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,876 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,877 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,877 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,877 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,877 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,877 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,878 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,878 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,878 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,878 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,878 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,881 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,881 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,881 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,881 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:55:48 BoogieIcfgContainer [2018-11-23 13:55:48,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:55:48,885 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:55:48,885 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:55:48,885 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:55:48,886 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:54:04" (3/4) ... [2018-11-23 13:55:48,889 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:55:48,894 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_float [2018-11-23 13:55:48,894 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:55:48,894 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:55:48,894 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_hypotf [2018-11-23 13:55:48,894 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_sqrtf [2018-11-23 13:55:48,899 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2018-11-23 13:55:48,900 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 13:55:48,900 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 13:55:48,900 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:55:48,923 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 13:55:48,924 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 13:55:48,924 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x && (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ha == ~bvand32(2147483647bv32, v___ieee754_hypotf_~ha~0_29) && ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_29[31:31], v___ieee754_hypotf_~ha~0_29[30:23], v___ieee754_hypotf_~ha~0_29[22:0]) == \old(x)) [2018-11-23 13:55:48,938 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f2dd21d8-e8fa-4f16-81a9-c59d3043f65a/bin-2019/utaipan/witness.graphml [2018-11-23 13:55:48,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:55:48,939 INFO L168 Benchmark]: Toolchain (without parser) took 106221.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -128.2 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:55:48,940 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:55:48,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.31 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 928.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:55:48,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.83 ms. Allocated memory is still 1.0 GB. Free memory is still 928.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:55:48,940 INFO L168 Benchmark]: Boogie Preprocessor took 77.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 928.3 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:55:48,941 INFO L168 Benchmark]: RCFGBuilder took 1288.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:55:48,941 INFO L168 Benchmark]: TraceAbstraction took 104521.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.3 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:55:48,941 INFO L168 Benchmark]: Witness Printer took 53.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:55:48,945 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 252.31 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 928.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.83 ms. Allocated memory is still 1.0 GB. Free memory is still 928.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 928.3 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1288.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 104521.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 57.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.3 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. * Witness Printer took 53.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 234]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant [2018-11-23 13:55:48,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] Derived loop invariant: \old(x) == x && (\exists v___ieee754_hypotf_~ha~0_27 : bv32 :: \old(x) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_27[31:31], v___ieee754_hypotf_~ha~0_27[30:23], v___ieee754_hypotf_~ha~0_27[22:0]) && ~bvsgt32(2139095040bv32, ~bvand32(2147483647bv32, v___ieee754_hypotf_~ha~0_27))) - InvariantResult [Line: 134]: Loop Invariant [2018-11-23 13:55:48,951 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,951 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,951 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] Derived loop invariant: \old(x) == x && (\exists v___ieee754_hypotf_~ha~0_27 : bv32 :: \old(x) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_27[31:31], v___ieee754_hypotf_~ha~0_27[30:23], v___ieee754_hypotf_~ha~0_27[22:0]) && ~bvsgt32(2139095040bv32, ~bvand32(2147483647bv32, v___ieee754_hypotf_~ha~0_27))) - InvariantResult [Line: 91]: Loop Invariant [2018-11-23 13:55:48,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 13:55:48,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 13:55:48,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 13:55:48,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 13:55:48,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 13:55:48,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 13:55:48,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] [2018-11-23 13:55:48,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_29,QUANTIFIED] Derived loop invariant: \old(x) == x && (\exists v___ieee754_hypotf_~ha~0_29 : bv32 :: ha == ~bvand32(2147483647bv32, v___ieee754_hypotf_~ha~0_29) && ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_29[31:31], v___ieee754_hypotf_~ha~0_29[30:23], v___ieee754_hypotf_~ha~0_29[22:0]) == \old(x)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 176]: Loop Invariant [2018-11-23 13:55:48,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] Derived loop invariant: \old(x) == x && (\exists v___ieee754_hypotf_~ha~0_27 : bv32 :: \old(x) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_27[31:31], v___ieee754_hypotf_~ha~0_27[30:23], v___ieee754_hypotf_~ha~0_27[22:0]) && ~bvsgt32(2139095040bv32, ~bvand32(2147483647bv32, v___ieee754_hypotf_~ha~0_27))) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 185]: Loop Invariant [2018-11-23 13:55:48,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] Derived loop invariant: \old(x) == x && (\exists v___ieee754_hypotf_~ha~0_27 : bv32 :: \old(x) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_27[31:31], v___ieee754_hypotf_~ha~0_27[30:23], v___ieee754_hypotf_~ha~0_27[22:0]) && ~bvsgt32(2139095040bv32, ~bvand32(2147483647bv32, v___ieee754_hypotf_~ha~0_27))) - InvariantResult [Line: 161]: Loop Invariant [2018-11-23 13:55:48,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] Derived loop invariant: \old(x) == x && (\exists v___ieee754_hypotf_~ha~0_27 : bv32 :: \old(x) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_27[31:31], v___ieee754_hypotf_~ha~0_27[30:23], v___ieee754_hypotf_~ha~0_27[22:0]) && ~bvsgt32(2139095040bv32, ~bvand32(2147483647bv32, v___ieee754_hypotf_~ha~0_27))) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 149]: Loop Invariant [2018-11-23 13:55:48,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] Derived loop invariant: \old(x) == x && (\exists v___ieee754_hypotf_~ha~0_27 : bv32 :: \old(x) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_27[31:31], v___ieee754_hypotf_~ha~0_27[30:23], v___ieee754_hypotf_~ha~0_27[22:0]) && ~bvsgt32(2139095040bv32, ~bvand32(2147483647bv32, v___ieee754_hypotf_~ha~0_27))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 191]: Loop Invariant [2018-11-23 13:55:48,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] [2018-11-23 13:55:48,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___ieee754_hypotf_~ha~0_27,QUANTIFIED] Derived loop invariant: \old(x) == x && (\exists v___ieee754_hypotf_~ha~0_27 : bv32 :: \old(x) == ~fp~LONGDOUBLE(v___ieee754_hypotf_~ha~0_27[31:31], v___ieee754_hypotf_~ha~0_27[30:23], v___ieee754_hypotf_~ha~0_27[22:0]) && ~bvsgt32(2139095040bv32, ~bvand32(2147483647bv32, v___ieee754_hypotf_~ha~0_27))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 101 locations, 1 error locations. SAFE Result, 104.4s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 99.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 628 SDtfs, 943 SDslu, 3538 SDs, 0 SdLazy, 1642 SolverSat, 76 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 93.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 67 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 94 PreInvPairs, 181 NumberOfFragments, 240 HoareAnnotationTreeSize, 94 FomulaSimplifications, 3146 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 25 FomulaSimplificationsInter, 456 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 268 ConstructedInterpolants, 110 QuantifiedInterpolants, 102034 SizeOfPredicates, 44 NumberOfNonLiveVariables, 842 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...