./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1271a_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_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1271a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/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 3c3794d6019e92717a5ca8c9c9457e833b63e739 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1271a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/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 3c3794d6019e92717a5ca8c9c9457e833b63e739 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:40:08,975 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:40:08,976 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:40:08,983 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:40:08,983 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:40:08,984 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:40:08,985 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:40:08,986 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:40:08,987 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:40:08,988 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:40:08,989 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:40:08,989 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:40:08,989 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:40:08,990 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:40:08,990 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:40:08,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:40:08,991 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:40:08,993 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:40:08,994 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:40:08,995 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:40:08,996 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:40:08,997 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:40:08,998 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:40:08,998 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:40:08,999 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:40:08,999 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:40:09,000 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:40:09,000 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:40:09,000 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:40:09,001 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:40:09,001 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:40:09,001 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:40:09,001 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:40:09,002 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:40:09,002 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:40:09,002 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:40:09,002 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 02:40:09,010 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:40:09,010 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:40:09,010 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:40:09,010 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:40:09,010 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 02:40:09,010 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 02:40:09,011 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 02:40:09,011 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 02:40:09,011 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 02:40:09,011 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 02:40:09,011 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 02:40:09,011 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 02:40:09,011 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 02:40:09,012 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:40:09,012 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:40:09,012 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:40:09,012 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:40:09,012 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:40:09,012 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:40:09,012 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:40:09,013 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:40:09,013 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:40:09,013 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:40:09,013 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:40:09,013 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:40:09,013 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:40:09,013 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:40:09,013 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:40:09,014 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:40:09,014 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:40:09,014 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:40:09,014 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:40:09,014 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:40:09,014 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 02:40:09,014 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:40:09,014 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:40:09,014 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 02:40:09,014 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_4e09d06e-e220-4042-8383-db8ace6a7e4a/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 -> 3c3794d6019e92717a5ca8c9c9457e833b63e739 [2018-11-23 02:40:09,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:40:09,047 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:40:09,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:40:09,050 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:40:09,051 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:40:09,051 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1271a_true-unreach-call.c [2018-11-23 02:40:09,090 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/data/8cc187992/6b6220f7bd2b488aa0fa997140b8dae1/FLAGda202e1ee [2018-11-23 02:40:09,499 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:40:09,499 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/sv-benchmarks/c/float-newlib/float_req_bl_1271a_true-unreach-call.c [2018-11-23 02:40:09,504 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/data/8cc187992/6b6220f7bd2b488aa0fa997140b8dae1/FLAGda202e1ee [2018-11-23 02:40:09,514 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/data/8cc187992/6b6220f7bd2b488aa0fa997140b8dae1 [2018-11-23 02:40:09,515 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:40:09,516 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:40:09,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:40:09,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:40:09,519 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:40:09,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:40:09" (1/1) ... [2018-11-23 02:40:09,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc74d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:09, skipping insertion in model container [2018-11-23 02:40:09,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:40:09" (1/1) ... [2018-11-23 02:40:09,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:40:09,546 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:40:09,680 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:40:09,682 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:40:09,718 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:40:09,774 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:40:09,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:09 WrapperNode [2018-11-23 02:40:09,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:40:09,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:40:09,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:40:09,775 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:40:09,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:09" (1/1) ... [2018-11-23 02:40:09,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:09" (1/1) ... [2018-11-23 02:40:09,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:40:09,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:40:09,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:40:09,795 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:40:09,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:09" (1/1) ... [2018-11-23 02:40:09,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:09" (1/1) ... [2018-11-23 02:40:09,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:09" (1/1) ... [2018-11-23 02:40:09,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:09" (1/1) ... [2018-11-23 02:40:09,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:09" (1/1) ... [2018-11-23 02:40:09,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:09" (1/1) ... [2018-11-23 02:40:09,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:09" (1/1) ... [2018-11-23 02:40:09,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:40:09,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:40:09,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:40:09,826 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:40:09,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/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 02:40:09,858 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_float [2018-11-23 02:40:09,859 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_float [2018-11-23 02:40:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:40:09,859 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:40:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-11-23 02:40:09,859 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-11-23 02:40:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 02:40:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:40:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:40:09,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:40:09,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 02:40:09,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:40:09,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:40:09,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:40:09,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:40:09,860 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_hypotf [2018-11-23 02:40:09,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_hypotf [2018-11-23 02:40:09,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:40:09,860 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-11-23 02:40:09,861 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-11-23 02:40:10,304 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:40:10,304 INFO L280 CfgBuilder]: Removed 34 assue(true) statements. [2018-11-23 02:40:10,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:10 BoogieIcfgContainer [2018-11-23 02:40:10,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:40:10,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:40:10,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:40:10,309 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:40:10,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:40:09" (1/3) ... [2018-11-23 02:40:10,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3fde44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:40:10, skipping insertion in model container [2018-11-23 02:40:10,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:09" (2/3) ... [2018-11-23 02:40:10,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3fde44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:40:10, skipping insertion in model container [2018-11-23 02:40:10,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:10" (3/3) ... [2018-11-23 02:40:10,313 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1271a_true-unreach-call.c [2018-11-23 02:40:10,319 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:40:10,325 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:40:10,335 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:40:10,359 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:40:10,359 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:40:10,359 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:40:10,359 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:40:10,359 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:40:10,359 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:40:10,360 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:40:10,360 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:40:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-11-23 02:40:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 02:40:10,379 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:40:10,380 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] [2018-11-23 02:40:10,382 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:40:10,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:40:10,386 INFO L82 PathProgramCache]: Analyzing trace with hash 860825893, now seen corresponding path program 1 times [2018-11-23 02:40:10,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:40:10,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:40:10,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:40:10,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:40:10,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:40:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:40:10,482 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 02:40:10,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:40:10,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:40:10,485 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:40:10,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:40:10,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:40:10,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:40:10,498 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 2 states. [2018-11-23 02:40:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:40:10,523 INFO L93 Difference]: Finished difference Result 210 states and 329 transitions. [2018-11-23 02:40:10,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:40:10,525 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 34 [2018-11-23 02:40:10,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:40:10,533 INFO L225 Difference]: With dead ends: 210 [2018-11-23 02:40:10,533 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 02:40:10,537 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 02:40:10,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 02:40:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-23 02:40:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 02:40:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2018-11-23 02:40:10,571 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 34 [2018-11-23 02:40:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:40:10,572 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2018-11-23 02:40:10,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:40:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2018-11-23 02:40:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 02:40:10,573 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:40:10,573 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, 1, 1] [2018-11-23 02:40:10,573 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:40:10,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:40:10,573 INFO L82 PathProgramCache]: Analyzing trace with hash 68622012, now seen corresponding path program 1 times [2018-11-23 02:40:10,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:40:10,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:40:10,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:40:10,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:40:10,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:40:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:40:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:40:10,700 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)|=10737418246.0, |old(~tiny_sqrt~0)|=10737418255.0, ~one_sqrt~0=10737418246.0, ~tiny_sqrt~0=10737418255.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)|=10737418246.0, |old(~tiny_sqrt~0)|=10737418255.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)|=10737418246.0, |old(~tiny_sqrt~0)|=10737418255.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] RET #380#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] CALL call #t~ret39 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);~y~0 := #t~nondet35;havoc #t~nondet35; VAL [main_~y~0=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] CALL call #t~ret36 := isfinite_float(~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isfinite_float_#in~x|=10737418256.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~x := #in~x;havoc ~ix~1; VAL [isfinite_float_~x=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |isfinite_float_#in~x|=10737418256.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~union34;havoc #t~mem33;call ULTIMATE.dealloc(~#gf_u~3.base, ~#gf_u~3.offset);havoc ~#gf_u~3.base, ~#gf_u~3.offset; VAL [isfinite_float_~ix~1=(- 2147483648), isfinite_float_~x=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |isfinite_float_#in~x|=10737418256.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] goto; VAL [isfinite_float_~ix~1=(- 2147483648), isfinite_float_~x=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |isfinite_float_#in~x|=10737418256.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647);#res := (if ~ix~1 < 2139095040 then 1 else 0); VAL [isfinite_float_~ix~1=2139095039, isfinite_float_~x=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |isfinite_float_#in~x|=10737418256.0, |isfinite_float_#res|=1, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume true; VAL [isfinite_float_~ix~1=2139095039, isfinite_float_~x=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |isfinite_float_#in~x|=10737418256.0, |isfinite_float_#res|=1, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] RET #374#return; VAL [main_~y~0=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret36|=1, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647; VAL [main_~y~0=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret36|=1, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume 0 != #t~ret36;havoc #t~ret36; VAL [main_~y~0=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] CALL call #t~ret37 := __ieee754_hypotf(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418254.0, |__ieee754_hypotf_#in~y|=10737418256.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=10737418254.0, __ieee754_hypotf_~b~0=10737418256.0, __ieee754_hypotf_~x=10737418254.0, __ieee754_hypotf_~y=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418254.0, |__ieee754_hypotf_#in~y|=10737418256.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~union6;havoc #t~mem5;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=10737418254.0, __ieee754_hypotf_~b~0=10737418256.0, __ieee754_hypotf_~ha~0=(- 2147483648), __ieee754_hypotf_~x=10737418254.0, __ieee754_hypotf_~y=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418254.0, |__ieee754_hypotf_#in~y|=10737418256.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] goto; VAL [__ieee754_hypotf_~a~0=10737418254.0, __ieee754_hypotf_~b~0=10737418256.0, __ieee754_hypotf_~ha~0=(- 2147483648), __ieee754_hypotf_~x=10737418254.0, __ieee754_hypotf_~y=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418254.0, |__ieee754_hypotf_#in~y|=10737418256.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [__ieee754_hypotf_~a~0=10737418254.0, __ieee754_hypotf_~b~0=10737418256.0, __ieee754_hypotf_~x=10737418254.0, __ieee754_hypotf_~y=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418254.0, |__ieee754_hypotf_#in~y|=10737418256.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=10737418254.0, __ieee754_hypotf_~b~0=10737418256.0, __ieee754_hypotf_~hb~0=3, __ieee754_hypotf_~x=10737418254.0, __ieee754_hypotf_~y=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418254.0, |__ieee754_hypotf_#in~y|=10737418256.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] goto; VAL [__ieee754_hypotf_~a~0=10737418254.0, __ieee754_hypotf_~b~0=10737418256.0, __ieee754_hypotf_~hb~0=3, __ieee754_hypotf_~x=10737418254.0, __ieee754_hypotf_~y=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418254.0, |__ieee754_hypotf_#in~y|=10737418256.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [__ieee754_hypotf_~a~0=10737418254.0, __ieee754_hypotf_~b~0=10737418256.0, __ieee754_hypotf_~x=10737418254.0, __ieee754_hypotf_~y=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418254.0, |__ieee754_hypotf_#in~y|=10737418256.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=10737418256.0, __ieee754_hypotf_~b~0=10737418254.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418254.0, __ieee754_hypotf_~y=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418254.0, |__ieee754_hypotf_#in~y|=10737418256.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=10737418253.0, __ieee754_hypotf_~b~0=10737418254.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418254.0, __ieee754_hypotf_~y=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418254.0, |__ieee754_hypotf_#in~y|=10737418256.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] goto; VAL [__ieee754_hypotf_~a~0=10737418253.0, __ieee754_hypotf_~b~0=10737418254.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418254.0, __ieee754_hypotf_~y=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418254.0, |__ieee754_hypotf_#in~y|=10737418256.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~mem11;havoc #t~union12;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=10737418253.0, __ieee754_hypotf_~b~0=10737418260.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418254.0, __ieee754_hypotf_~y=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418254.0, |__ieee754_hypotf_#in~y|=10737418256.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] goto; VAL [__ieee754_hypotf_~a~0=10737418253.0, __ieee754_hypotf_~b~0=10737418260.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418254.0, __ieee754_hypotf_~y=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418254.0, |__ieee754_hypotf_#in~y|=10737418256.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=10737418253.0, __ieee754_hypotf_~b~0=10737418260.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418254.0, __ieee754_hypotf_~y=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418254.0, |__ieee754_hypotf_#in~y|=10737418256.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume true; VAL [__ieee754_hypotf_~a~0=10737418253.0, __ieee754_hypotf_~b~0=10737418260.0, __ieee754_hypotf_~ha~0=251658239, __ieee754_hypotf_~hb~0=(- 2), __ieee754_hypotf_~j~0=(- 2), __ieee754_hypotf_~x=10737418254.0, __ieee754_hypotf_~y=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |__ieee754_hypotf_#in~x|=10737418254.0, |__ieee754_hypotf_#in~y|=10737418256.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] RET #376#return; VAL [main_~x~0=10737418254.0, main_~y~0=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret37|=10737418261.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~res~0 := #t~ret37;havoc #t~ret37; VAL [main_~res~0=10737418261.0, main_~x~0=10737418254.0, main_~y~0=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] CALL call #t~ret38 := isnan_float(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=10737418261.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_float_~x=10737418261.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=10737418261.0, |isnan_float_#res|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume true; VAL [isnan_float_~x=10737418261.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=10737418261.0, |isnan_float_#res|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] RET #378#return; VAL [main_~res~0=10737418261.0, main_~x~0=10737418254.0, main_~y~0=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret38|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647; VAL [main_~res~0=10737418261.0, main_~x~0=10737418254.0, main_~y~0=10737418256.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret38|=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume 0 == #t~ret38;havoc #t~ret38; VAL [main_~res~0=10737418261.0, main_~x~0=10737418254.0, main_~y~0=10737418256.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=10737418261.0, main_~x~0=10737418254.0, main_~y~0=10737418256.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.0737418246E10, old(~tiny_sqrt~0)=1.0737418255E10, ~one_sqrt~0=1.0737418246E10, ~tiny_sqrt~0=1.0737418255E10] [?] #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.0737418246E10, old(~tiny_sqrt~0)=1.0737418255E10, ~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.0737418246E10, old(~tiny_sqrt~0)=1.0737418255E10, ~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~ret39 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L232] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L233] ~y~0 := #t~nondet35; [L233] havoc #t~nondet35; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235] CALL call #t~ret36 := isfinite_float(~y~0); VAL [#in~x=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L214-L223] ~x := #in~x; [L215] havoc ~ix~1; VAL [#in~x=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L217] call ~#gf_u~3.base, ~#gf_u~3.offset := #Ultimate.alloc(4); [L218] call write~real(~x, ~#gf_u~3.base, ~#gf_u~3.offset, 4); [L219] call #t~mem33 := read~int(~#gf_u~3.base, ~#gf_u~3.offset, 4); [L219] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L219] call write~real(#t~union34, ~#gf_u~3.base, ~#gf_u~3.offset, 4); [L219] havoc #t~union34; [L219] havoc #t~mem33; [L217] call ULTIMATE.dealloc(~#gf_u~3.base, ~#gf_u~3.offset); [L217] havoc ~#gf_u~3.base, ~#gf_u~3.offset; VAL [#in~x=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L221] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L222] #res := (if ~ix~1 < 2139095040 then 1 else 0); VAL [#in~x=1.0737418256E10, #NULL.base=0, #NULL.offset=0, #res=1, ~ix~1=2139095039, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L214-L223] ensures true; VAL [#in~x=1.0737418256E10, #NULL.base=0, #NULL.offset=0, #res=1, ~ix~1=2139095039, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L235] RET call #t~ret36 := isfinite_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret36=1, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235] assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret36=1, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235-L242] assume 0 != #t~ret36; [L235] havoc #t~ret36; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L236] CALL call #t~ret37 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #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.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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~union6; [L88] havoc #t~mem5; [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.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~ha~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~hb~0=3, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418256E10, ~b~0=1.0737418254E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418253E10, ~b~0=1.0737418254E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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~mem11; [L115] havoc #t~union12; [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.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418253E10, ~b~0=1.073741826E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L117-L119] assume ~ha~0 - ~hb~0 > 251658240; [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418253E10, ~b~0=1.073741826E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L81-L208] ensures true; VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418253E10, ~b~0=1.073741826E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L236] RET call #t~ret37 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret37=1.0737418261E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L236] ~res~0 := #t~ret37; [L236] havoc #t~ret37; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238] CALL call #t~ret38 := isnan_float(~res~0); VAL [#in~x=1.0737418261E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211] ~x := #in~x; [L211] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=1.0737418261E10, #NULL.base=0, #NULL.offset=0, #res=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418261E10] [L211] ensures true; VAL [#in~x=1.0737418261E10, #NULL.base=0, #NULL.offset=0, #res=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418261E10] [L238] RET call #t~ret38 := isnan_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret38=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238] assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret38=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238-L241] assume 0 == #t~ret38; [L238] havoc #t~ret38; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L239] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] ----- ----- 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.0737418246E10, old(~tiny_sqrt~0)=1.0737418255E10, ~one_sqrt~0=1.0737418246E10, ~tiny_sqrt~0=1.0737418255E10] [?] #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.0737418246E10, old(~tiny_sqrt~0)=1.0737418255E10, ~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.0737418246E10, old(~tiny_sqrt~0)=1.0737418255E10, ~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~ret39 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L232] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L233] ~y~0 := #t~nondet35; [L233] havoc #t~nondet35; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235] CALL call #t~ret36 := isfinite_float(~y~0); VAL [#in~x=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L214-L223] ~x := #in~x; [L215] havoc ~ix~1; VAL [#in~x=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L217] call ~#gf_u~3.base, ~#gf_u~3.offset := #Ultimate.alloc(4); [L218] call write~real(~x, ~#gf_u~3.base, ~#gf_u~3.offset, 4); [L219] call #t~mem33 := read~int(~#gf_u~3.base, ~#gf_u~3.offset, 4); [L219] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L219] call write~real(#t~union34, ~#gf_u~3.base, ~#gf_u~3.offset, 4); [L219] havoc #t~union34; [L219] havoc #t~mem33; [L217] call ULTIMATE.dealloc(~#gf_u~3.base, ~#gf_u~3.offset); [L217] havoc ~#gf_u~3.base, ~#gf_u~3.offset; VAL [#in~x=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L221] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L222] #res := (if ~ix~1 < 2139095040 then 1 else 0); VAL [#in~x=1.0737418256E10, #NULL.base=0, #NULL.offset=0, #res=1, ~ix~1=2139095039, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L214-L223] ensures true; VAL [#in~x=1.0737418256E10, #NULL.base=0, #NULL.offset=0, #res=1, ~ix~1=2139095039, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L235] RET call #t~ret36 := isfinite_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret36=1, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235] assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret36=1, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235-L242] assume 0 != #t~ret36; [L235] havoc #t~ret36; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L236] CALL call #t~ret37 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #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.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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~union6; [L88] havoc #t~mem5; [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.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~ha~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~hb~0=3, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418256E10, ~b~0=1.0737418254E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418253E10, ~b~0=1.0737418254E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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~mem11; [L115] havoc #t~union12; [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.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418253E10, ~b~0=1.073741826E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L117-L119] assume ~ha~0 - ~hb~0 > 251658240; [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418253E10, ~b~0=1.073741826E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L81-L208] ensures true; VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL.base=0, #NULL.offset=0, ~a~0=1.0737418253E10, ~b~0=1.073741826E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L236] RET call #t~ret37 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret37=1.0737418261E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L236] ~res~0 := #t~ret37; [L236] havoc #t~ret37; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238] CALL call #t~ret38 := isnan_float(~res~0); VAL [#in~x=1.0737418261E10, #NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211] ~x := #in~x; [L211] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=1.0737418261E10, #NULL.base=0, #NULL.offset=0, #res=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418261E10] [L211] ensures true; VAL [#in~x=1.0737418261E10, #NULL.base=0, #NULL.offset=0, #res=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418261E10] [L238] RET call #t~ret38 := isnan_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret38=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238] assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret38=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238-L241] assume 0 == #t~ret38; [L238] havoc #t~ret38; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L239] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418250, #NULL!offset=10737418241, old(#NULL!base)=10737418250, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418246E10, old(~tiny_sqrt~0)=1.0737418255E10, ~one_sqrt~0=1.0737418246E10, ~tiny_sqrt~0=1.0737418255E10] [?] #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.0737418246E10, old(~tiny_sqrt~0)=1.0737418255E10, ~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~ret39 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L232] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L233] ~y~0 := #t~nondet35; [L233] havoc #t~nondet35; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235] CALL call #t~ret36 := isfinite_float(~y~0); VAL [#in~x=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L214-L223] ~x := #in~x; [L215] havoc ~ix~1; VAL [#in~x=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L217] FCALL call ~#gf_u~3 := #Ultimate.alloc(4); [L218] FCALL call write~real(~x, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L219] FCALL call #t~mem33 := read~int({ base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L219] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L219] FCALL call write~real(#t~union34, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L219] havoc #t~union34; [L219] havoc #t~mem33; [L217] FCALL call ULTIMATE.dealloc(~#gf_u~3); [L217] havoc ~#gf_u~3; VAL [#in~x=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L221] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L222] #res := (if ~ix~1 < 2139095040 then 1 else 0); VAL [#in~x=1.0737418256E10, #NULL!base=0, #NULL!offset=0, #res=1, ~ix~1=2139095039, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L235] RET call #t~ret36 := isfinite_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret36=1, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235] assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret36=1, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235-L242] COND TRUE 0 != #t~ret36 [L235] havoc #t~ret36; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L236] CALL call #t~ret37 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #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.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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~union6; [L88] havoc #t~mem5; [L86] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L86] havoc ~#gf_u~1; VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~ha~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~hb~0=3, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418256E10, ~b~0=1.0737418254E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418253E10, ~b~0=1.0737418254E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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~mem11; [L115] havoc #t~union12; [L113] FCALL call ULTIMATE.dealloc(~#sf_u~2); [L113] havoc ~#sf_u~2; VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418253E10, ~b~0=1.073741826E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L117] COND TRUE ~ha~0 - ~hb~0 > 251658240 [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418253E10, ~b~0=1.073741826E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L236] RET call #t~ret37 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=1.0737418261E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L236] ~res~0 := #t~ret37; [L236] havoc #t~ret37; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238] CALL call #t~ret38 := isnan_float(~res~0); VAL [#in~x=1.0737418261E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211] ~x := #in~x; [L211] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=1.0737418261E10, #NULL!base=0, #NULL!offset=0, #res=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418261E10] [L238] RET call #t~ret38 := isnan_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret38=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238] assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret38=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238] COND TRUE 0 == #t~ret38 [L238] havoc #t~ret38; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L239] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] ----- ----- 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.0737418246E10, old(~tiny_sqrt~0)=1.0737418255E10, ~one_sqrt~0=1.0737418246E10, ~tiny_sqrt~0=1.0737418255E10] [?] #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.0737418246E10, old(~tiny_sqrt~0)=1.0737418255E10, ~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~ret39 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L232] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L233] ~y~0 := #t~nondet35; [L233] havoc #t~nondet35; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235] CALL call #t~ret36 := isfinite_float(~y~0); VAL [#in~x=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L214-L223] ~x := #in~x; [L215] havoc ~ix~1; VAL [#in~x=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L217] FCALL call ~#gf_u~3 := #Ultimate.alloc(4); [L218] FCALL call write~real(~x, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L219] FCALL call #t~mem33 := read~int({ base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L219] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L219] FCALL call write~real(#t~union34, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L219] havoc #t~union34; [L219] havoc #t~mem33; [L217] FCALL call ULTIMATE.dealloc(~#gf_u~3); [L217] havoc ~#gf_u~3; VAL [#in~x=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L221] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L222] #res := (if ~ix~1 < 2139095040 then 1 else 0); VAL [#in~x=1.0737418256E10, #NULL!base=0, #NULL!offset=0, #res=1, ~ix~1=2139095039, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L235] RET call #t~ret36 := isfinite_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret36=1, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235] assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret36=1, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235-L242] COND TRUE 0 != #t~ret36 [L235] havoc #t~ret36; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L236] CALL call #t~ret37 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #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.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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~union6; [L88] havoc #t~mem5; [L86] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L86] havoc ~#gf_u~1; VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~ha~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~hb~0=3, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418256E10, ~b~0=1.0737418254E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418253E10, ~b~0=1.0737418254E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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~mem11; [L115] havoc #t~union12; [L113] FCALL call ULTIMATE.dealloc(~#sf_u~2); [L113] havoc ~#sf_u~2; VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418253E10, ~b~0=1.073741826E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L117] COND TRUE ~ha~0 - ~hb~0 > 251658240 [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418253E10, ~b~0=1.073741826E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L236] RET call #t~ret37 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=1.0737418261E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L236] ~res~0 := #t~ret37; [L236] havoc #t~ret37; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238] CALL call #t~ret38 := isnan_float(~res~0); VAL [#in~x=1.0737418261E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211] ~x := #in~x; [L211] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=1.0737418261E10, #NULL!base=0, #NULL!offset=0, #res=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418261E10] [L238] RET call #t~ret38 := isnan_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret38=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238] assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret38=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238] COND TRUE 0 == #t~ret38 [L238] havoc #t~ret38; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L239] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418250, #NULL!offset=10737418241, old(#NULL!base)=10737418250, old(#NULL!offset)=10737418241, old(~one_sqrt~0)=1.0737418246E10, old(~tiny_sqrt~0)=1.0737418255E10, ~one_sqrt~0=1.0737418246E10, ~tiny_sqrt~0=1.0737418255E10] [?] #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.0737418246E10, old(~tiny_sqrt~0)=1.0737418255E10, ~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~ret39 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L232] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L233] ~y~0 := #t~nondet35; [L233] havoc #t~nondet35; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235] CALL call #t~ret36 := isfinite_float(~y~0); VAL [#in~x=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L214-L223] ~x := #in~x; [L215] havoc ~ix~1; VAL [#in~x=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L217] FCALL call ~#gf_u~3 := #Ultimate.alloc(4); [L218] FCALL call write~real(~x, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L219] FCALL call #t~mem33 := read~int({ base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L219] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L219] FCALL call write~real(#t~union34, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L219] havoc #t~union34; [L219] havoc #t~mem33; [L217] FCALL call ULTIMATE.dealloc(~#gf_u~3); [L217] havoc ~#gf_u~3; VAL [#in~x=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L221] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L222] #res := (if ~ix~1 < 2139095040 then 1 else 0); VAL [#in~x=1.0737418256E10, #NULL!base=0, #NULL!offset=0, #res=1, ~ix~1=2139095039, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L235] RET call #t~ret36 := isfinite_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret36=1, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235] assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret36=1, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235-L242] COND TRUE 0 != #t~ret36 [L235] havoc #t~ret36; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L236] CALL call #t~ret37 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #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.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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~union6; [L88] havoc #t~mem5; [L86] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L86] havoc ~#gf_u~1; VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~ha~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~hb~0=3, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418256E10, ~b~0=1.0737418254E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418253E10, ~b~0=1.0737418254E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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~mem11; [L115] havoc #t~union12; [L113] FCALL call ULTIMATE.dealloc(~#sf_u~2); [L113] havoc ~#sf_u~2; VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418253E10, ~b~0=1.073741826E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L117] COND TRUE ~ha~0 - ~hb~0 > 251658240 [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418253E10, ~b~0=1.073741826E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L236] RET call #t~ret37 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=1.0737418261E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L236] ~res~0 := #t~ret37; [L236] havoc #t~ret37; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238] CALL call #t~ret38 := isnan_float(~res~0); VAL [#in~x=1.0737418261E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211] ~x := #in~x; [L211] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=1.0737418261E10, #NULL!base=0, #NULL!offset=0, #res=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418261E10] [L238] RET call #t~ret38 := isnan_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret38=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238] assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret38=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238] COND TRUE 0 == #t~ret38 [L238] havoc #t~ret38; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L239] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] ----- ----- 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.0737418246E10, old(~tiny_sqrt~0)=1.0737418255E10, ~one_sqrt~0=1.0737418246E10, ~tiny_sqrt~0=1.0737418255E10] [?] #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.0737418246E10, old(~tiny_sqrt~0)=1.0737418255E10, ~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~ret39 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L232] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L233] ~y~0 := #t~nondet35; [L233] havoc #t~nondet35; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235] CALL call #t~ret36 := isfinite_float(~y~0); VAL [#in~x=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L214-L223] ~x := #in~x; [L215] havoc ~ix~1; VAL [#in~x=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L217] FCALL call ~#gf_u~3 := #Ultimate.alloc(4); [L218] FCALL call write~real(~x, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L219] FCALL call #t~mem33 := read~int({ base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L219] ~ix~1 := (if #t~mem33 % 4294967296 % 4294967296 <= 2147483647 then #t~mem33 % 4294967296 % 4294967296 else #t~mem33 % 4294967296 % 4294967296 - 4294967296); [L219] FCALL call write~real(#t~union34, { base: ~#gf_u~3!base, offset: ~#gf_u~3!offset }, 4); [L219] havoc #t~union34; [L219] havoc #t~mem33; [L217] FCALL call ULTIMATE.dealloc(~#gf_u~3); [L217] havoc ~#gf_u~3; VAL [#in~x=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~ix~1=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L221] ~ix~1 := ~bitwiseAnd(~ix~1, 2147483647); [L222] #res := (if ~ix~1 < 2139095040 then 1 else 0); VAL [#in~x=1.0737418256E10, #NULL!base=0, #NULL!offset=0, #res=1, ~ix~1=2139095039, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418256E10] [L235] RET call #t~ret36 := isfinite_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret36=1, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235] assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret36=1, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L235-L242] COND TRUE 0 != #t~ret36 [L235] havoc #t~ret36; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~y~0=1.0737418256E10] [L236] CALL call #t~ret37 := __ieee754_hypotf(~x~0, ~y~0); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #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.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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~union6; [L88] havoc #t~mem5; [L86] FCALL call ULTIMATE.dealloc(~#gf_u~1); [L86] havoc ~#gf_u~1; VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~ha~0=-2147483648, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L90] ~ha~0 := ~bitwiseAnd(~ha~0, 2147483647); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~hb~0=3, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L96] ~hb~0 := ~bitwiseAnd(~hb~0, 2147483647); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418254E10, ~b~0=1.0737418256E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418256E10, ~b~0=1.0737418254E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418253E10, ~b~0=1.0737418254E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [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~mem11; [L115] havoc #t~union12; [L113] FCALL call ULTIMATE.dealloc(~#sf_u~2); [L113] havoc ~#sf_u~2; VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418253E10, ~b~0=1.073741826E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L117] COND TRUE ~ha~0 - ~hb~0 > 251658240 [L118] #res := ~someBinaryArithmeticFLOAToperation(~a~0, ~b~0); VAL [#in~x=1.0737418254E10, #in~y=1.0737418256E10, #NULL!base=0, #NULL!offset=0, ~a~0=1.0737418253E10, ~b~0=1.073741826E10, ~ha~0=251658239, ~hb~0=-2, ~j~0=-2, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418254E10, ~y=1.0737418256E10] [L236] RET call #t~ret37 := __ieee754_hypotf(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret37=1.0737418261E10, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L236] ~res~0 := #t~ret37; [L236] havoc #t~ret37; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238] CALL call #t~ret38 := isnan_float(~res~0); VAL [#in~x=1.0737418261E10, #NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L211] ~x := #in~x; [L211] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=1.0737418261E10, #NULL!base=0, #NULL!offset=0, #res=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x=1.0737418261E10] [L238] RET call #t~ret38 := isnan_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret38=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238] assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret38=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L238] COND TRUE 0 == #t~ret38 [L238] havoc #t~ret38; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L239] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~res~0=1.0737418261E10, ~tiny_sqrt~0=1/1000000000000000000000000000000, ~x~0=1.0737418254E10, ~y~0=1.0737418256E10] [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [\old(one_sqrt)=10737418246, \old(tiny_sqrt)=10737418255, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L232] float x = 0.0f / 0.0f; [L233] float y = __VERIFIER_nondet_float(); [L235] CALL isfinite_float(y) VAL [\old(x)=10737418256, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L215] __int32_t ix; VAL [\old(x)=10737418256, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418256] [L217] ieee_float_shape_type gf_u; [L218] gf_u.value = (x) [L219] EXPR gf_u.word [L219] (ix) = gf_u.word [L221] ix &= 0x7fffffff [L222] return (((ix) < 0x7f800000L)); VAL [\old(x)=10737418256, \result=1, ix=2139095039, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418256] [L235] RET isfinite_float(y) VAL [isfinite_float(y)=1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, y=10737418256] [L235] COND TRUE isfinite_float(y) [L236] CALL, EXPR __ieee754_hypotf(x, y) VAL [\old(x)=10737418254, \old(y)=10737418256, 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)=10737418254, \old(y)=10737418256, a=10737418254, b=10737418256, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418254, y=10737418256] [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)=10737418254, \old(y)=10737418256, a=10737418254, b=10737418256, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418254, y=10737418256] [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)=10737418254, \old(y)=10737418256, a=10737418254, b=10737418256, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418254, y=10737418256] [L97] COND TRUE hb > ha [L98] a = y [L99] b = x [L100] j = ha [L101] ha = hb [L102] hb = j VAL [\old(x)=10737418254, \old(y)=10737418256, a=10737418256, b=10737418254, ha=251658239, hb=-2, j=-2, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418254, y=10737418256] [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)=10737418254, \old(y)=10737418256, a=10737418253, b=10737418260, ha=251658239, hb=-2, j=-2, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418254, y=10737418256] [L236] RET, EXPR __ieee754_hypotf(x, y) VAL [__ieee754_hypotf(x, y)=10737418261, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418254, y=10737418256] [L236] float res = __ieee754_hypotf(x, y); [L238] CALL, EXPR isnan_float(res) VAL [\old(x)=10737418261, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L211] return x != x; VAL [\old(x)=10737418261, \result=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418261] [L238] RET, EXPR isnan_float(res) VAL [isnan_float(res)=0, one_sqrt=1, res=10737418261, tiny_sqrt=1/1000000000000000000000000000000, x=10737418254, y=10737418256] [L238] COND TRUE !isnan_float(res) [L239] __VERIFIER_error() VAL [one_sqrt=1, res=10737418261, tiny_sqrt=1/1000000000000000000000000000000, x=10737418254, y=10737418256] ----- [2018-11-23 02:40:10,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:40:10 BoogieIcfgContainer [2018-11-23 02:40:10,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:40:10,760 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:40:10,760 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:40:10,761 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:40:10,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:10" (3/4) ... [2018-11-23 02:40:10,765 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:40:10,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:40:10,765 INFO L168 Benchmark]: Toolchain (without parser) took 1249.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 963.4 MB in the beginning and 1.1 GB in the end (delta: -98.5 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:40:10,767 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:40:10,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 963.4 MB in the beginning and 1.2 GB in the end (delta: -190.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:40:10,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:40:10,768 INFO L168 Benchmark]: Boogie Preprocessor took 30.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:40:10,769 INFO L168 Benchmark]: RCFGBuilder took 479.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:40:10,769 INFO L168 Benchmark]: TraceAbstraction took 454.33 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:40:10,770 INFO L168 Benchmark]: Witness Printer took 4.51 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 02:40:10,773 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 963.4 MB in the beginning and 1.2 GB in the end (delta: -190.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 479.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 454.33 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.51 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.plugins.generator.traceabstraction: - UnprovableResult [Line: 239]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 211, overapproximation of someBinaryArithmeticFLOAToperation at line 118, overapproximation of bitwiseAnd at line 96. Possible FailurePath: [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [\old(one_sqrt)=10737418246, \old(tiny_sqrt)=10737418255, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L232] float x = 0.0f / 0.0f; [L233] float y = __VERIFIER_nondet_float(); [L235] CALL isfinite_float(y) VAL [\old(x)=10737418256, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L215] __int32_t ix; VAL [\old(x)=10737418256, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418256] [L217] ieee_float_shape_type gf_u; [L218] gf_u.value = (x) [L219] EXPR gf_u.word [L219] (ix) = gf_u.word [L221] ix &= 0x7fffffff [L222] return (((ix) < 0x7f800000L)); VAL [\old(x)=10737418256, \result=1, ix=2139095039, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418256] [L235] RET isfinite_float(y) VAL [isfinite_float(y)=1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, y=10737418256] [L235] COND TRUE isfinite_float(y) [L236] CALL, EXPR __ieee754_hypotf(x, y) VAL [\old(x)=10737418254, \old(y)=10737418256, 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)=10737418254, \old(y)=10737418256, a=10737418254, b=10737418256, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418254, y=10737418256] [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)=10737418254, \old(y)=10737418256, a=10737418254, b=10737418256, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418254, y=10737418256] [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)=10737418254, \old(y)=10737418256, a=10737418254, b=10737418256, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418254, y=10737418256] [L97] COND TRUE hb > ha [L98] a = y [L99] b = x [L100] j = ha [L101] ha = hb [L102] hb = j VAL [\old(x)=10737418254, \old(y)=10737418256, a=10737418256, b=10737418254, ha=251658239, hb=-2, j=-2, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418254, y=10737418256] [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)=10737418254, \old(y)=10737418256, a=10737418253, b=10737418260, ha=251658239, hb=-2, j=-2, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418254, y=10737418256] [L236] RET, EXPR __ieee754_hypotf(x, y) VAL [__ieee754_hypotf(x, y)=10737418261, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418254, y=10737418256] [L236] float res = __ieee754_hypotf(x, y); [L238] CALL, EXPR isnan_float(res) VAL [\old(x)=10737418261, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L211] return x != x; VAL [\old(x)=10737418261, \result=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=10737418261] [L238] RET, EXPR isnan_float(res) VAL [isnan_float(res)=0, one_sqrt=1, res=10737418261, tiny_sqrt=1/1000000000000000000000000000000, x=10737418254, y=10737418256] [L238] COND TRUE !isnan_float(res) [L239] __VERIFIER_error() VAL [one_sqrt=1, res=10737418261, tiny_sqrt=1/1000000000000000000000000000000, x=10737418254, y=10737418256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 109 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 132 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=109occurred 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, 73 NumberOfCodeBlocks, 73 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 1089 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 02:40:12,179 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:40:12,180 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:40:12,187 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:40:12,187 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:40:12,188 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:40:12,189 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:40:12,190 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:40:12,191 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:40:12,192 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:40:12,193 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:40:12,193 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:40:12,194 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:40:12,194 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:40:12,195 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:40:12,196 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:40:12,197 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:40:12,198 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:40:12,200 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:40:12,201 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:40:12,202 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:40:12,203 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:40:12,205 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:40:12,205 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:40:12,205 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:40:12,206 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:40:12,207 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:40:12,207 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:40:12,208 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:40:12,209 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:40:12,209 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:40:12,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:40:12,210 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:40:12,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:40:12,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:40:12,212 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:40:12,212 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 02:40:12,223 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:40:12,223 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:40:12,223 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:40:12,224 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:40:12,224 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 02:40:12,224 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 02:40:12,224 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 02:40:12,225 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 02:40:12,225 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 02:40:12,225 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 02:40:12,225 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:40:12,226 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:40:12,226 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:40:12,226 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:40:12,226 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:40:12,226 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:40:12,226 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:40:12,226 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 02:40:12,226 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 02:40:12,227 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:40:12,227 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:40:12,227 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:40:12,227 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:40:12,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:40:12,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:40:12,227 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:40:12,227 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:40:12,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:40:12,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:40:12,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:40:12,228 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:40:12,228 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 02:40:12,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:40:12,228 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 02:40:12,228 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 02:40:12,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_4e09d06e-e220-4042-8383-db8ace6a7e4a/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 -> 3c3794d6019e92717a5ca8c9c9457e833b63e739 [2018-11-23 02:40:12,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:40:12,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:40:12,272 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:40:12,273 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:40:12,273 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:40:12,274 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1271a_true-unreach-call.c [2018-11-23 02:40:12,318 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/data/63be24370/4c3df1dd870f45a9ab104bbc188c5b5f/FLAG73b324bc4 [2018-11-23 02:40:12,726 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:40:12,726 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/sv-benchmarks/c/float-newlib/float_req_bl_1271a_true-unreach-call.c [2018-11-23 02:40:12,731 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/data/63be24370/4c3df1dd870f45a9ab104bbc188c5b5f/FLAG73b324bc4 [2018-11-23 02:40:12,739 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/data/63be24370/4c3df1dd870f45a9ab104bbc188c5b5f [2018-11-23 02:40:12,741 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:40:12,742 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:40:12,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:40:12,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:40:12,746 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:40:12,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:40:12" (1/1) ... [2018-11-23 02:40:12,749 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 02:40:12, skipping insertion in model container [2018-11-23 02:40:12,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:40:12" (1/1) ... [2018-11-23 02:40:12,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:40:12,776 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:40:12,939 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:40:12,943 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:40:12,982 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:40:13,004 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:40:13,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:13 WrapperNode [2018-11-23 02:40:13,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:40:13,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:40:13,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:40:13,006 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:40:13,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:13" (1/1) ... [2018-11-23 02:40:13,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:13" (1/1) ... [2018-11-23 02:40:13,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:40:13,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:40:13,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:40:13,081 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:40:13,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:13" (1/1) ... [2018-11-23 02:40:13,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:13" (1/1) ... [2018-11-23 02:40:13,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:13" (1/1) ... [2018-11-23 02:40:13,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:13" (1/1) ... [2018-11-23 02:40:13,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:13" (1/1) ... [2018-11-23 02:40:13,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:13" (1/1) ... [2018-11-23 02:40:13,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:13" (1/1) ... [2018-11-23 02:40:13,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:40:13,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:40:13,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:40:13,122 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:40:13,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/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 02:40:13,160 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_float [2018-11-23 02:40:13,161 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_float [2018-11-23 02:40:13,161 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:40:13,161 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:40:13,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-23 02:40:13,161 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-11-23 02:40:13,161 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-11-23 02:40:13,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:40:13,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:40:13,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:40:13,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 02:40:13,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:40:13,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:40:13,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 02:40:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_hypotf [2018-11-23 02:40:13,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_hypotf [2018-11-23 02:40:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 02:40:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:40:13,163 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-11-23 02:40:13,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-11-23 02:40:13,288 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 02:40:13,543 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 02:40:13,580 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 02:40:14,462 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:40:14,462 INFO L280 CfgBuilder]: Removed 34 assue(true) statements. [2018-11-23 02:40:14,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:14 BoogieIcfgContainer [2018-11-23 02:40:14,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:40:14,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:40:14,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:40:14,465 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:40:14,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:40:12" (1/3) ... [2018-11-23 02:40:14,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30737f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:40:14, skipping insertion in model container [2018-11-23 02:40:14,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:13" (2/3) ... [2018-11-23 02:40:14,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30737f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:40:14, skipping insertion in model container [2018-11-23 02:40:14,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:14" (3/3) ... [2018-11-23 02:40:14,468 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1271a_true-unreach-call.c [2018-11-23 02:40:14,474 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:40:14,479 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:40:14,489 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:40:14,510 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:40:14,510 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:40:14,510 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:40:14,510 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:40:14,510 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:40:14,510 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:40:14,511 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:40:14,511 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:40:14,511 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:40:14,523 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2018-11-23 02:40:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 02:40:14,527 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:40:14,528 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 02:40:14,529 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:40:14,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:40:14,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1957122282, now seen corresponding path program 1 times [2018-11-23 02:40:14,536 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:40:14,536 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/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 02:40:14,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:40:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:40:14,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:40:14,645 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 02:40:14,645 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:40:14,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:40:14,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:40:14,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:40:14,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:40:14,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:40:14,670 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2018-11-23 02:40:14,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:40:14,695 INFO L93 Difference]: Finished difference Result 206 states and 325 transitions. [2018-11-23 02:40:14,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:40:14,697 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 02:40:14,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:40:14,705 INFO L225 Difference]: With dead ends: 206 [2018-11-23 02:40:14,705 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 02:40:14,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 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 02:40:14,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 02:40:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-23 02:40:14,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 02:40:14,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2018-11-23 02:40:14,743 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 32 [2018-11-23 02:40:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:40:14,743 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2018-11-23 02:40:14,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:40:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2018-11-23 02:40:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 02:40:14,745 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:40:14,745 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 02:40:14,745 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:40:14,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:40:14,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1007281651, now seen corresponding path program 1 times [2018-11-23 02:40:14,746 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:40:14,746 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/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 02:40:14,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:40:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:40:14,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:40:15,130 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 02:40:15,130 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:40:15,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:40:15,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:40:15,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:40:15,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:40:15,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:40:15,145 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand 9 states. [2018-11-23 02:41:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:41:12,967 INFO L93 Difference]: Finished difference Result 228 states and 277 transitions. [2018-11-23 02:41:13,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:41:13,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 02:41:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:41:13,008 INFO L225 Difference]: With dead ends: 228 [2018-11-23 02:41:13,008 INFO L226 Difference]: Without dead ends: 136 [2018-11-23 02:41:13,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-11-23 02:41:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-23 02:41:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2018-11-23 02:41:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 02:41:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 131 transitions. [2018-11-23 02:41:13,019 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 131 transitions. Word has length 37 [2018-11-23 02:41:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:41:13,020 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 131 transitions. [2018-11-23 02:41:13,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:41:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 131 transitions. [2018-11-23 02:41:13,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 02:41:13,021 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:41:13,021 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 02:41:13,021 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:41:13,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:41:13,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2007821967, now seen corresponding path program 1 times [2018-11-23 02:41:13,022 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:41:13,022 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/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 02:41:13,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:41:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:41:13,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:41:17,355 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 02:41:21,634 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 02:41:21,635 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:41:21,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:41:21,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 02:41:21,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 02:41:21,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 02:41:21,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=110, Unknown=1, NotChecked=0, Total=132 [2018-11-23 02:41:21,648 INFO L87 Difference]: Start difference. First operand 109 states and 131 transitions. Second operand 12 states. [2018-11-23 02:41:27,430 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 02:41:39,675 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 02:41:48,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:41:48,092 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2018-11-23 02:41:48,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 02:41:48,133 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 02:41:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:41:48,134 INFO L225 Difference]: With dead ends: 123 [2018-11-23 02:41:48,134 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 02:41:48,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=63, Invalid=315, Unknown=2, NotChecked=0, Total=380 [2018-11-23 02:41:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 02:41:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2018-11-23 02:41:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 02:41:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2018-11-23 02:41:48,145 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 37 [2018-11-23 02:41:48,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:41:48,145 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2018-11-23 02:41:48,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 02:41:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2018-11-23 02:41:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 02:41:48,146 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:41:48,147 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, 1, 1, 1, 1, 1] [2018-11-23 02:41:48,147 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:41:48,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:41:48,147 INFO L82 PathProgramCache]: Analyzing trace with hash -780723337, now seen corresponding path program 1 times [2018-11-23 02:41:48,147 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:41:48,148 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/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 02:41:48,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:41:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:41:48,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:41:48,635 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 02:41:48,635 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:41:48,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:41:48,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 02:41:48,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 02:41:48,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 02:41:48,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:41:48,644 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand 14 states. [2018-11-23 02:42:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:42:10,694 INFO L93 Difference]: Finished difference Result 156 states and 184 transitions. [2018-11-23 02:42:10,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 02:42:10,737 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-11-23 02:42:10,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:42:10,738 INFO L225 Difference]: With dead ends: 156 [2018-11-23 02:42:10,738 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 02:42:10,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2018-11-23 02:42:10,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 02:42:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2018-11-23 02:42:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 02:42:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2018-11-23 02:42:10,750 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 42 [2018-11-23 02:42:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:42:10,751 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2018-11-23 02:42:10,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 02:42:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2018-11-23 02:42:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 02:42:10,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:42:10,752 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, 1, 1, 1, 1, 1] [2018-11-23 02:42:10,752 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:42:10,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:42:10,752 INFO L82 PathProgramCache]: Analyzing trace with hash -897307209, now seen corresponding path program 1 times [2018-11-23 02:42:10,753 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:42:10,753 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/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 02:42:10,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:42:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:42:10,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:42:10,897 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 02:42:10,897 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:42:10,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:42:10,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 02:42:10,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:42:10,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:42:10,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:42:10,907 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand 7 states. [2018-11-23 02:42:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:42:23,721 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2018-11-23 02:42:23,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:42:23,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-11-23 02:42:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:42:23,763 INFO L225 Difference]: With dead ends: 124 [2018-11-23 02:42:23,763 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 02:42:23,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:42:23,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 02:42:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-11-23 02:42:23,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 02:42:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2018-11-23 02:42:23,772 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 42 [2018-11-23 02:42:23,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:42:23,773 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2018-11-23 02:42:23,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:42:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2018-11-23 02:42:23,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 02:42:23,774 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:42:23,774 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, 1, 1, 1, 1, 1] [2018-11-23 02:42:23,774 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:42:23,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:42:23,775 INFO L82 PathProgramCache]: Analyzing trace with hash -639141771, now seen corresponding path program 1 times [2018-11-23 02:42:23,775 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:42:23,775 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/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 02:42:23,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:42:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:42:23,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:42:24,267 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-11-23 02:42:25,717 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 02:42:25,717 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:42:25,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:42:25,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 02:42:25,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 02:42:25,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 02:42:25,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:42:25,726 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand 12 states. [2018-11-23 02:42:26,739 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-11-23 02:42:28,251 WARN L180 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2018-11-23 02:42:30,850 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-11-23 02:42:44,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:42:44,023 INFO L93 Difference]: Finished difference Result 151 states and 177 transitions. [2018-11-23 02:42:44,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:42:44,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-23 02:42:44,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:42:44,024 INFO L225 Difference]: With dead ends: 151 [2018-11-23 02:42:44,024 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 02:42:44,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-11-23 02:42:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 02:42:44,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 106. [2018-11-23 02:42:44,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 02:42:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2018-11-23 02:42:44,033 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 42 [2018-11-23 02:42:44,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:42:44,034 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2018-11-23 02:42:44,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 02:42:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2018-11-23 02:42:44,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 02:42:44,035 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:42:44,035 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:42:44,035 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:42:44,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:42:44,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1199845104, now seen corresponding path program 1 times [2018-11-23 02:42:44,035 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:42:44,035 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/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 02:42:44,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:42:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:42:44,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:42:44,245 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 02:42:44,245 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:42:44,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:42:44,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:42:44,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:42:44,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:42:44,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:42:44,254 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 9 states. [2018-11-23 02:43:06,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:43:06,053 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2018-11-23 02:43:06,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:43:06,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-11-23 02:43:06,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:43:06,055 INFO L225 Difference]: With dead ends: 173 [2018-11-23 02:43:06,055 INFO L226 Difference]: Without dead ends: 163 [2018-11-23 02:43:06,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:43:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-23 02:43:06,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 113. [2018-11-23 02:43:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 02:43:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2018-11-23 02:43:06,069 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 45 [2018-11-23 02:43:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:43:06,069 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2018-11-23 02:43:06,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:43:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2018-11-23 02:43:06,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 02:43:06,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:43:06,070 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:43:06,071 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:43:06,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:43:06,071 INFO L82 PathProgramCache]: Analyzing trace with hash -605593230, now seen corresponding path program 1 times [2018-11-23 02:43:06,071 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:43:06,071 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/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 02:43:06,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:43:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:43:06,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:43:06,804 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 02:43:06,804 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:43:06,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:43:06,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 02:43:06,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:43:06,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:43:06,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:43:06,817 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand 7 states. [2018-11-23 02:43:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:43:19,547 INFO L93 Difference]: Finished difference Result 189 states and 225 transitions. [2018-11-23 02:43:19,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:43:19,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-23 02:43:19,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:43:19,590 INFO L225 Difference]: With dead ends: 189 [2018-11-23 02:43:19,590 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 02:43:19,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:43:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 02:43:19,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 96. [2018-11-23 02:43:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 02:43:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2018-11-23 02:43:19,600 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 45 [2018-11-23 02:43:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:43:19,600 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2018-11-23 02:43:19,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:43:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2018-11-23 02:43:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 02:43:19,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:43:19,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:43:19,601 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:43:19,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:43:19,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1790274438, now seen corresponding path program 1 times [2018-11-23 02:43:19,602 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:43:19,602 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-23 02:43:19,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:43:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:43:19,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:43:20,243 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 02:43:20,243 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:43:20,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:43:20,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:43:20,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:43:20,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:43:20,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:43:20,255 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand 9 states. [2018-11-23 02:43:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:43:43,147 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2018-11-23 02:43:43,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:43:43,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-11-23 02:43:43,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:43:43,149 INFO L225 Difference]: With dead ends: 133 [2018-11-23 02:43:43,149 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 02:43:43,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:43:43,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 02:43:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2018-11-23 02:43:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 02:43:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2018-11-23 02:43:43,159 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 54 [2018-11-23 02:43:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:43:43,159 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2018-11-23 02:43:43,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:43:43,159 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2018-11-23 02:43:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 02:43:43,160 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:43:43,160 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:43:43,160 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:43:43,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:43:43,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2146000665, now seen corresponding path program 1 times [2018-11-23 02:43:43,160 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:43:43,161 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-23 02:43:43,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:43:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:43:43,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:43:44,056 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 02:43:44,056 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:43:44,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:43:44,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:43:44,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:43:44,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:43:44,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:43:44,069 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 9 states. [2018-11-23 02:44:02,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:44:02,898 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2018-11-23 02:44:02,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:44:02,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-11-23 02:44:02,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:44:02,899 INFO L225 Difference]: With dead ends: 122 [2018-11-23 02:44:02,900 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 02:44:02,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:44:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 02:44:02,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2018-11-23 02:44:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 02:44:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2018-11-23 02:44:02,909 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 57 [2018-11-23 02:44:02,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:44:02,909 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2018-11-23 02:44:02,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:44:02,909 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2018-11-23 02:44:02,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 02:44:02,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:44:02,910 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, 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 02:44:02,910 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:44:02,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:44:02,910 INFO L82 PathProgramCache]: Analyzing trace with hash 278430457, now seen corresponding path program 1 times [2018-11-23 02:44:02,910 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:44:02,910 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-11-23 02:44:02,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:44:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:44:03,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:44:03,287 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 02:44:03,287 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:44:03,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:44:03,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:44:03,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:44:03,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:44:03,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:44:03,298 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand 4 states. [2018-11-23 02:44:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:44:07,494 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2018-11-23 02:44:07,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:44:07,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-23 02:44:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:44:07,534 INFO L225 Difference]: With dead ends: 100 [2018-11-23 02:44:07,534 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 02:44:07,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:44:07,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 02:44:07,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-23 02:44:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 02:44:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2018-11-23 02:44:07,544 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 59 [2018-11-23 02:44:07,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:44:07,544 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2018-11-23 02:44:07,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:44:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2018-11-23 02:44:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 02:44:07,545 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:44:07,545 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, 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 02:44:07,545 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:44:07,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:44:07,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1738369465, now seen corresponding path program 1 times [2018-11-23 02:44:07,546 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:44:07,546 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-11-23 02:44:07,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:44:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:44:07,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:44:08,441 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 02:44:08,441 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:44:08,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:44:08,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 02:44:08,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 02:44:08,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 02:44:08,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:44:08,453 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand 10 states. [2018-11-23 02:44:22,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:44:22,176 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2018-11-23 02:44:22,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:44:22,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2018-11-23 02:44:22,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:44:22,222 INFO L225 Difference]: With dead ends: 131 [2018-11-23 02:44:22,222 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 02:44:22,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-11-23 02:44:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 02:44:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-23 02:44:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 02:44:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-11-23 02:44:22,233 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 62 [2018-11-23 02:44:22,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:44:22,233 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-11-23 02:44:22,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 02:44:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-11-23 02:44:22,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 02:44:22,234 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:44:22,234 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, 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 02:44:22,234 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:44:22,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:44:22,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1184790533, now seen corresponding path program 1 times [2018-11-23 02:44:22,235 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:44:22,235 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e09d06e-e220-4042-8383-db8ace6a7e4a/bin-2019/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-11-23 02:44:22,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:44:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:44:22,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:44:22,746 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 02:44:22,746 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:44:22,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:44:22,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 02:44:22,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:44:22,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:44:22,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:44:22,758 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 8 states. [2018-11-23 02:44:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:44:31,203 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2018-11-23 02:44:31,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:44:31,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-11-23 02:44:31,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:44:31,243 INFO L225 Difference]: With dead ends: 90 [2018-11-23 02:44:31,243 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 02:44:31,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:44:31,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 02:44:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 02:44:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 02:44:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 02:44:31,244 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-11-23 02:44:31,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:44:31,244 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:44:31,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:44:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:44:31,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 02:44:31,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 02:44:32,381 WARN L180 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 69 [2018-11-23 02:44:33,166 WARN L180 SmtUtils]: Spent 784.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-23 02:44:36,029 WARN L180 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2018-11-23 02:44:37,583 WARN L180 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2018-11-23 02:44:37,761 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 02:44:40,651 WARN L180 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2018-11-23 02:44:42,087 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2018-11-23 02:44:42,295 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 24 [2018-11-23 02:44:44,067 WARN L180 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2018-11-23 02:44:44,080 INFO L448 ceAbstractionStarter]: For program point isnan_floatFINAL(line 211) no Hoare annotation was computed. [2018-11-23 02:44:44,081 INFO L451 ceAbstractionStarter]: At program point isnan_floatENTRY(line 211) the Hoare annotation is: true [2018-11-23 02:44:44,081 INFO L448 ceAbstractionStarter]: For program point isnan_floatEXIT(line 211) no Hoare annotation was computed. [2018-11-23 02:44:44,081 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:44:44,081 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:44:44,081 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:44:44,081 INFO L448 ceAbstractionStarter]: For program point L216-1(lines 216 220) no Hoare annotation was computed. [2018-11-23 02:44:44,081 INFO L444 ceAbstractionStarter]: At program point L216-2(lines 216 220) the Hoare annotation is: (= isfinite_float_~x |isfinite_float_#in~x|) [2018-11-23 02:44:44,081 INFO L448 ceAbstractionStarter]: For program point L216-3(lines 216 220) no Hoare annotation was computed. [2018-11-23 02:44:44,081 INFO L448 ceAbstractionStarter]: For program point isfinite_floatFINAL(lines 214 223) no Hoare annotation was computed. [2018-11-23 02:44:44,081 INFO L451 ceAbstractionStarter]: At program point isfinite_floatENTRY(lines 214 223) the Hoare annotation is: true [2018-11-23 02:44:44,081 INFO L448 ceAbstractionStarter]: For program point isfinite_floatEXIT(lines 214 223) no Hoare annotation was computed. [2018-11-23 02:44:44,081 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:44:44,081 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 02:44:44,081 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:44:44,081 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:44:44,081 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 239) no Hoare annotation was computed. [2018-11-23 02:44:44,082 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 225 245) the Hoare annotation is: true [2018-11-23 02:44:44,082 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 225 245) no Hoare annotation was computed. [2018-11-23 02:44:44,082 INFO L448 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2018-11-23 02:44:44,082 INFO L444 ceAbstractionStarter]: At program point L238(line 238) the Hoare annotation is: (and (exists ((__ieee754_hypotf_~b~0 (_ FloatingPoint 8 24)) (v___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_26) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_26) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_26)) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24))) (= (fp.add roundNearestTiesToEven (let ((.cse0 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_26))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) __ieee754_hypotf_~b~0) main_~res~0))) (= main_~x~0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) [2018-11-23 02:44:44,082 INFO L448 ceAbstractionStarter]: For program point L238-1(lines 238 241) no Hoare annotation was computed. [2018-11-23 02:44:44,082 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 225 245) no Hoare annotation was computed. [2018-11-23 02:44:44,082 INFO L444 ceAbstractionStarter]: At program point L236(line 236) the Hoare annotation is: (and (exists ((v_isfinite_float_~ix~1_5 (_ BitVec 32))) (and (= main_~y~0 (fp ((_ extract 31 31) v_isfinite_float_~ix~1_5) ((_ extract 30 23) v_isfinite_float_~ix~1_5) ((_ extract 22 0) v_isfinite_float_~ix~1_5))) (bvslt (bvand (_ bv2147483647 32) v_isfinite_float_~ix~1_5) (_ bv2139095040 32)))) (= main_~x~0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) [2018-11-23 02:44:44,082 INFO L444 ceAbstractionStarter]: At program point L235(line 235) the Hoare annotation is: (= main_~x~0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24))) [2018-11-23 02:44:44,082 INFO L448 ceAbstractionStarter]: For program point L236-1(line 236) no Hoare annotation was computed. [2018-11-23 02:44:44,082 INFO L448 ceAbstractionStarter]: For program point L235-1(lines 235 242) no Hoare annotation was computed. [2018-11-23 02:44:44,083 INFO L448 ceAbstractionStarter]: For program point L235-3(lines 235 242) no Hoare annotation was computed. [2018-11-23 02:44:44,083 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 127) no Hoare annotation was computed. [2018-11-23 02:44:44,083 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2018-11-23 02:44:44,083 INFO L444 ceAbstractionStarter]: At program point L85-2(lines 85 89) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y) (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x)) [2018-11-23 02:44:44,083 INFO L448 ceAbstractionStarter]: For program point L85-3(lines 85 89) no Hoare annotation was computed. [2018-11-23 02:44:44,083 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 176 180) no Hoare annotation was computed. [2018-11-23 02:44:44,083 INFO L444 ceAbstractionStarter]: At program point L176-2(lines 176 180) the Hoare annotation is: (let ((.cse3 (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x))) (or (and (= (_ bv68 32) __ieee754_hypotf_~k~0) (let ((.cse0 (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y))) (or (and .cse0 (exists ((v___ieee754_hypotf_~ha~0_31 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_31) __ieee754_hypotf_~ha~0)) (not (bvsgt (bvadd (bvneg __ieee754_hypotf_~hb~0) __ieee754_hypotf_~ha~0) (_ bv251658240 32))) (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (= __ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_30)))) (and .cse0 (exists ((v___ieee754_hypotf_~ha~0_31 (_ BitVec 32))) (let ((.cse1 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_31))) (and (bvsgt .cse1 (_ bv1484783616 32)) (not (bvsgt (bvadd .cse1 (bvneg (bvadd __ieee754_hypotf_~hb~0 (_ bv570425344 32)))) (_ bv251658240 32)))))) (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (= (bvadd __ieee754_hypotf_~hb~0 (_ bv570425344 32)) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_30)))))) (exists ((v___ieee754_hypotf_~ha~0_39 (_ BitVec 32))) (let ((.cse2 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_39))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_39) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_39) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_39)) |__ieee754_hypotf_#in~x|) (bvslt .cse2 (_ bv2139095040 32)) (bvsgt .cse2 (_ bv1484783616 32))))) .cse3) (and (exists ((v___ieee754_hypotf_~ha~0_24 (_ BitVec 32)) (v___ieee754_hypotf_~hb~0_25 (_ BitVec 32))) (and (bvsgt (bvadd (bvneg (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_24)) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_25)) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_24) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_24) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_24)) |__ieee754_hypotf_#in~x|))) .cse3))) [2018-11-23 02:44:44,083 INFO L448 ceAbstractionStarter]: For program point L176-3(lines 176 180) no Hoare annotation was computed. [2018-11-23 02:44:44,083 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 185 189) no Hoare annotation was computed. [2018-11-23 02:44:44,084 INFO L444 ceAbstractionStarter]: At program point L185-2(lines 185 189) the Hoare annotation is: (let ((.cse3 (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x))) (or (and (= (_ bv68 32) __ieee754_hypotf_~k~0) (exists ((v___ieee754_hypotf_~ha~0_39 (_ BitVec 32))) (let ((.cse0 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_39))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_39) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_39) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_39)) |__ieee754_hypotf_#in~x|) (bvslt .cse0 (_ bv2139095040 32)) (bvsgt .cse0 (_ bv1484783616 32))))) (let ((.cse1 (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y))) (or (and .cse1 (exists ((v___ieee754_hypotf_~ha~0_31 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_31) __ieee754_hypotf_~ha~0)) (not (bvsgt (bvadd (bvneg __ieee754_hypotf_~hb~0) __ieee754_hypotf_~ha~0) (_ bv251658240 32))) (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (= __ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_30)))) (and .cse1 (exists ((v___ieee754_hypotf_~ha~0_31 (_ BitVec 32))) (let ((.cse2 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_31))) (and (bvsgt .cse2 (_ bv1484783616 32)) (not (bvsgt (bvadd .cse2 (bvneg (bvadd __ieee754_hypotf_~hb~0 (_ bv570425344 32)))) (_ bv251658240 32)))))) (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (= (bvadd __ieee754_hypotf_~hb~0 (_ bv570425344 32)) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_30)))))) .cse3) (and (exists ((v___ieee754_hypotf_~ha~0_24 (_ BitVec 32)) (v___ieee754_hypotf_~hb~0_25 (_ BitVec 32))) (and (bvsgt (bvadd (bvneg (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_24)) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_25)) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_24) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_24) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_24)) |__ieee754_hypotf_#in~x|))) .cse3))) [2018-11-23 02:44:44,084 INFO L448 ceAbstractionStarter]: For program point L185-3(lines 185 189) no Hoare annotation was computed. [2018-11-23 02:44:44,084 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 161 165) no Hoare annotation was computed. [2018-11-23 02:44:44,084 INFO L444 ceAbstractionStarter]: At program point L161-2(lines 161 165) the Hoare annotation is: (and (exists ((v___ieee754_hypotf_~ha~0_24 (_ BitVec 32)) (v___ieee754_hypotf_~hb~0_25 (_ BitVec 32))) (and (bvsgt (bvadd (bvneg (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_24)) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_25)) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_24) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_24) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_24)) |__ieee754_hypotf_#in~x|))) (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x)) [2018-11-23 02:44:44,084 INFO L448 ceAbstractionStarter]: For program point __ieee754_hypotfFINAL(lines 81 208) no Hoare annotation was computed. [2018-11-23 02:44:44,084 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 172) no Hoare annotation was computed. [2018-11-23 02:44:44,084 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 116) no Hoare annotation was computed. [2018-11-23 02:44:44,084 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 81 208) no Hoare annotation was computed. [2018-11-23 02:44:44,084 INFO L448 ceAbstractionStarter]: For program point L112-2(lines 81 208) no Hoare annotation was computed. [2018-11-23 02:44:44,084 INFO L448 ceAbstractionStarter]: For program point __ieee754_hypotfEXIT(lines 81 208) no Hoare annotation was computed. [2018-11-23 02:44:44,085 INFO L451 ceAbstractionStarter]: At program point __ieee754_hypotfENTRY(lines 81 208) the Hoare annotation is: true [2018-11-23 02:44:44,085 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 144) no Hoare annotation was computed. [2018-11-23 02:44:44,085 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 81 208) no Hoare annotation was computed. [2018-11-23 02:44:44,085 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 171) no Hoare annotation was computed. [2018-11-23 02:44:44,085 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 106) no Hoare annotation was computed. [2018-11-23 02:44:44,085 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 129) no Hoare annotation was computed. [2018-11-23 02:44:44,085 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 143) no Hoare annotation was computed. [2018-11-23 02:44:44,085 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 121 144) no Hoare annotation was computed. [2018-11-23 02:44:44,085 INFO L444 ceAbstractionStarter]: At program point L197(line 197) the Hoare annotation is: (let ((.cse3 (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x))) (or (and (= (_ bv68 32) __ieee754_hypotf_~k~0) (exists ((v___ieee754_hypotf_~ha~0_39 (_ BitVec 32))) (let ((.cse0 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_39))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_39) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_39) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_39)) |__ieee754_hypotf_#in~x|) (bvslt .cse0 (_ bv2139095040 32)) (bvsgt .cse0 (_ bv1484783616 32))))) (let ((.cse1 (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y))) (or (and .cse1 (exists ((v___ieee754_hypotf_~ha~0_31 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_31) __ieee754_hypotf_~ha~0)) (not (bvsgt (bvadd (bvneg __ieee754_hypotf_~hb~0) __ieee754_hypotf_~ha~0) (_ bv251658240 32))) (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (= __ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_30)))) (and .cse1 (exists ((v___ieee754_hypotf_~ha~0_31 (_ BitVec 32))) (let ((.cse2 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_31))) (and (bvsgt .cse2 (_ bv1484783616 32)) (not (bvsgt (bvadd .cse2 (bvneg (bvadd __ieee754_hypotf_~hb~0 (_ bv570425344 32)))) (_ bv251658240 32)))))) (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (= (bvadd __ieee754_hypotf_~hb~0 (_ bv570425344 32)) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_30)))))) .cse3) (and (exists ((v___ieee754_hypotf_~ha~0_24 (_ BitVec 32)) (v___ieee754_hypotf_~hb~0_25 (_ BitVec 32))) (and (bvsgt (bvadd (bvneg (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_24)) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_25)) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_24) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_24) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_24)) |__ieee754_hypotf_#in~x|))) .cse3))) [2018-11-23 02:44:44,085 INFO L448 ceAbstractionStarter]: For program point L197-1(line 197) no Hoare annotation was computed. [2018-11-23 02:44:44,086 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 171) no Hoare annotation was computed. [2018-11-23 02:44:44,086 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2018-11-23 02:44:44,086 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 81 208) no Hoare annotation was computed. [2018-11-23 02:44:44,086 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2018-11-23 02:44:44,086 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 91 95) no Hoare annotation was computed. [2018-11-23 02:44:44,086 INFO L448 ceAbstractionStarter]: For program point L124-2(lines 122 129) no Hoare annotation was computed. [2018-11-23 02:44:44,086 INFO L444 ceAbstractionStarter]: At program point L91-2(lines 91 95) the Hoare annotation is: (and (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y) (= |__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 02:44:44,086 INFO L448 ceAbstractionStarter]: For program point L91-3(lines 91 95) no Hoare annotation was computed. [2018-11-23 02:44:44,086 INFO L444 ceAbstractionStarter]: At program point L182(line 182) the Hoare annotation is: (let ((.cse3 (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x))) (or (and (= (_ bv68 32) __ieee754_hypotf_~k~0) (let ((.cse0 (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y))) (or (and .cse0 (exists ((v___ieee754_hypotf_~ha~0_31 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_31) __ieee754_hypotf_~ha~0)) (not (bvsgt (bvadd (bvneg __ieee754_hypotf_~hb~0) __ieee754_hypotf_~ha~0) (_ bv251658240 32))) (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (= __ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_30)))) (and .cse0 (exists ((v___ieee754_hypotf_~ha~0_31 (_ BitVec 32))) (let ((.cse1 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_31))) (and (bvsgt .cse1 (_ bv1484783616 32)) (not (bvsgt (bvadd .cse1 (bvneg (bvadd __ieee754_hypotf_~hb~0 (_ bv570425344 32)))) (_ bv251658240 32)))))) (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (= (bvadd __ieee754_hypotf_~hb~0 (_ bv570425344 32)) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_30)))))) (exists ((v___ieee754_hypotf_~ha~0_39 (_ BitVec 32))) (let ((.cse2 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_39))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_39) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_39) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_39)) |__ieee754_hypotf_#in~x|) (bvslt .cse2 (_ bv2139095040 32)) (bvsgt .cse2 (_ bv1484783616 32))))) .cse3) (and (exists ((v___ieee754_hypotf_~ha~0_24 (_ BitVec 32)) (v___ieee754_hypotf_~hb~0_25 (_ BitVec 32))) (and (bvsgt (bvadd (bvneg (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_24)) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_25)) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_24) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_24) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_24)) |__ieee754_hypotf_#in~x|))) .cse3))) [2018-11-23 02:44:44,086 INFO L448 ceAbstractionStarter]: For program point L182-1(line 182) no Hoare annotation was computed. [2018-11-23 02:44:44,087 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2018-11-23 02:44:44,087 INFO L444 ceAbstractionStarter]: At program point L149-2(lines 149 153) the Hoare annotation is: (let ((.cse0 (exists ((v___ieee754_hypotf_~ha~0_24 (_ BitVec 32)) (v___ieee754_hypotf_~hb~0_25 (_ BitVec 32))) (and (bvsgt (bvadd (bvneg (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_24)) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_25)) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_24) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_24) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_24)) |__ieee754_hypotf_#in~x|)))) (.cse1 (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x))) (or (and .cse0 (exists ((v___ieee754_hypotf_~ha~0_24 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_24) __ieee754_hypotf_~hb~0) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_24) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_24) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_24)) |__ieee754_hypotf_#in~x|))) .cse1 (exists ((v___ieee754_hypotf_~hb~0_25 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_25) __ieee754_hypotf_~ha~0))) (and .cse0 (exists ((v___ieee754_hypotf_~ha~0_24 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_24) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_24) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_24)) |__ieee754_hypotf_#in~x|) (= (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_24) __ieee754_hypotf_~ha~0))) .cse1 (exists ((v___ieee754_hypotf_~hb~0_25 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_25) __ieee754_hypotf_~hb~0))))) [2018-11-23 02:44:44,087 INFO L448 ceAbstractionStarter]: For program point L149-3(lines 149 153) no Hoare annotation was computed. [2018-11-23 02:44:44,087 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 170) no Hoare annotation was computed. [2018-11-23 02:44:44,087 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 157 171) no Hoare annotation was computed. [2018-11-23 02:44:44,087 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 191 195) no Hoare annotation was computed. [2018-11-23 02:44:44,087 INFO L444 ceAbstractionStarter]: At program point L191-2(lines 191 195) the Hoare annotation is: (let ((.cse3 (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x))) (or (and (= (_ bv68 32) __ieee754_hypotf_~k~0) (exists ((v___ieee754_hypotf_~ha~0_39 (_ BitVec 32))) (let ((.cse0 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_39))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_39) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_39) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_39)) |__ieee754_hypotf_#in~x|) (bvslt .cse0 (_ bv2139095040 32)) (bvsgt .cse0 (_ bv1484783616 32))))) (let ((.cse1 (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y))) (or (and .cse1 (exists ((v___ieee754_hypotf_~ha~0_31 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_31) __ieee754_hypotf_~ha~0)) (not (bvsgt (bvadd (bvneg __ieee754_hypotf_~hb~0) __ieee754_hypotf_~ha~0) (_ bv251658240 32))) (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (= __ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_30)))) (and .cse1 (exists ((v___ieee754_hypotf_~ha~0_31 (_ BitVec 32))) (let ((.cse2 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_31))) (and (bvsgt .cse2 (_ bv1484783616 32)) (not (bvsgt (bvadd .cse2 (bvneg (bvadd __ieee754_hypotf_~hb~0 (_ bv570425344 32)))) (_ bv251658240 32)))))) (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (= (bvadd __ieee754_hypotf_~hb~0 (_ bv570425344 32)) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_30)))))) .cse3) (and (exists ((v___ieee754_hypotf_~ha~0_24 (_ BitVec 32)) (v___ieee754_hypotf_~hb~0_25 (_ BitVec 32))) (and (bvsgt (bvadd (bvneg (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_24)) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_25)) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_24) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_24) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_24)) |__ieee754_hypotf_#in~x|))) .cse3))) [2018-11-23 02:44:44,087 INFO L448 ceAbstractionStarter]: For program point L191-3(lines 191 195) no Hoare annotation was computed. [2018-11-23 02:44:44,087 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 198) no Hoare annotation was computed. [2018-11-23 02:44:44,087 INFO L448 ceAbstractionStarter]: For program point L175-2(lines 81 208) no Hoare annotation was computed. [2018-11-23 02:44:44,087 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 200 204) no Hoare annotation was computed. [2018-11-23 02:44:44,088 INFO L444 ceAbstractionStarter]: At program point L200-2(lines 200 204) the Hoare annotation is: (let ((.cse1 (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x))) (or (and (= (_ bv68 32) __ieee754_hypotf_~k~0) (exists ((v___ieee754_hypotf_~ha~0_39 (_ BitVec 32))) (let ((.cse0 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_39))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_39) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_39) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_39)) |__ieee754_hypotf_#in~x|) (bvslt .cse0 (_ bv2139095040 32)) (bvsgt .cse0 (_ bv1484783616 32))))) .cse1 (let ((.cse2 (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y))) (or (and .cse2 (exists ((v___ieee754_hypotf_~ha~0_31 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_31) __ieee754_hypotf_~ha~0)) (not (bvsgt (bvadd (bvneg __ieee754_hypotf_~hb~0) __ieee754_hypotf_~ha~0) (_ bv251658240 32))) (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (= __ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_30)))) (and .cse2 (exists ((v___ieee754_hypotf_~ha~0_31 (_ BitVec 32))) (let ((.cse3 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_31))) (and (bvsgt .cse3 (_ bv1484783616 32)) (not (bvsgt (bvadd .cse3 (bvneg (bvadd __ieee754_hypotf_~hb~0 (_ bv570425344 32)))) (_ bv251658240 32)))))) (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (= (bvadd __ieee754_hypotf_~hb~0 (_ bv570425344 32)) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_30))))))) (and (exists ((v___ieee754_hypotf_~ha~0_24 (_ BitVec 32)) (v___ieee754_hypotf_~hb~0_25 (_ BitVec 32))) (and (bvsgt (bvadd (bvneg (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_24)) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_25)) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_24) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_24) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_24)) |__ieee754_hypotf_#in~x|))) .cse1))) [2018-11-23 02:44:44,088 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2018-11-23 02:44:44,088 INFO L448 ceAbstractionStarter]: For program point L200-3(lines 200 204) no Hoare annotation was computed. [2018-11-23 02:44:44,088 INFO L444 ceAbstractionStarter]: At program point L134-2(lines 134 138) the Hoare annotation is: (let ((.cse0 (= (_ bv68 32) __ieee754_hypotf_~k~0)) (.cse1 (= |__ieee754_hypotf_#in~y| __ieee754_hypotf_~y)) (.cse3 (exists ((v___ieee754_hypotf_~ha~0_31 (_ BitVec 32))) (let ((.cse7 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_31))) (and (bvsgt .cse7 (_ bv1484783616 32)) (not (bvsgt (bvadd .cse7 (bvneg (bvadd __ieee754_hypotf_~hb~0 (_ bv570425344 32)))) (_ bv251658240 32))))))) (.cse4 (exists ((v___ieee754_hypotf_~ha~0_28 (_ BitVec 32))) (= __ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_28)))) (.cse5 (= |__ieee754_hypotf_#in~x| __ieee754_hypotf_~x)) (.cse6 (exists ((v___ieee754_hypotf_~hb~0_30 (_ BitVec 32))) (= (bvadd __ieee754_hypotf_~hb~0 (_ bv570425344 32)) (bvand (_ bv2147483647 32) v___ieee754_hypotf_~hb~0_30))))) (or (and .cse0 .cse1 (exists ((v___ieee754_hypotf_~ha~0_39 (_ BitVec 32))) (let ((.cse2 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_39))) (and (= (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_39) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_39) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_39)) |__ieee754_hypotf_#in~x|) (bvslt .cse2 (_ bv2139095040 32)) (bvsgt .cse2 (_ bv1484783616 32))))) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 (exists ((v___ieee754_hypotf_~ha~0_38 (_ BitVec 32)) (v___ieee754_hypotf_~ha~0_36 (_ BitVec 32))) (and (bvsgt v___ieee754_hypotf_~ha~0_38 (bvand (_ bv2147483647 32) v___ieee754_hypotf_~ha~0_36)) (bvsgt v___ieee754_hypotf_~ha~0_38 (_ bv1484783616 32)) (= |__ieee754_hypotf_#in~x| (fp ((_ extract 31 31) v___ieee754_hypotf_~ha~0_36) ((_ extract 30 23) v___ieee754_hypotf_~ha~0_36) ((_ extract 22 0) v___ieee754_hypotf_~ha~0_36))) (bvslt v___ieee754_hypotf_~ha~0_38 (_ bv2139095040 32)))) .cse6))) [2018-11-23 02:44:44,088 INFO L448 ceAbstractionStarter]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2018-11-23 02:44:44,088 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 32) no Hoare annotation was computed. [2018-11-23 02:44:44,088 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2018-11-23 02:44:44,088 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2018-11-23 02:44:44,088 INFO L448 ceAbstractionStarter]: For program point L52-2(lines 52 56) no Hoare annotation was computed. [2018-11-23 02:44:44,088 INFO L451 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: true [2018-11-23 02:44:44,088 INFO L448 ceAbstractionStarter]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2018-11-23 02:44:44,088 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2018-11-23 02:44:44,088 INFO L451 ceAbstractionStarter]: At program point L73-2(lines 73 77) the Hoare annotation is: true [2018-11-23 02:44:44,088 INFO L448 ceAbstractionStarter]: For program point L73-3(lines 73 77) no Hoare annotation was computed. [2018-11-23 02:44:44,088 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 37) no Hoare annotation was computed. [2018-11-23 02:44:44,088 INFO L451 ceAbstractionStarter]: At program point L36-3(lines 36 37) the Hoare annotation is: true [2018-11-23 02:44:44,088 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 68) no Hoare annotation was computed. [2018-11-23 02:44:44,088 INFO L448 ceAbstractionStarter]: For program point L36-4(lines 36 37) no Hoare annotation was computed. [2018-11-23 02:44:44,088 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 70) no Hoare annotation was computed. [2018-11-23 02:44:44,088 INFO L451 ceAbstractionStarter]: At program point __ieee754_sqrtfENTRY(lines 14 79) the Hoare annotation is: true [2018-11-23 02:44:44,088 INFO L448 ceAbstractionStarter]: For program point __ieee754_sqrtfFINAL(lines 14 79) no Hoare annotation was computed. [2018-11-23 02:44:44,089 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 30) no Hoare annotation was computed. [2018-11-23 02:44:44,089 INFO L448 ceAbstractionStarter]: For program point __ieee754_sqrtfEXIT(lines 14 79) no Hoare annotation was computed. [2018-11-23 02:44:44,089 INFO L451 ceAbstractionStarter]: At program point L50-2(lines 50 59) the Hoare annotation is: true [2018-11-23 02:44:44,089 INFO L448 ceAbstractionStarter]: For program point L50-3(lines 14 79) no Hoare annotation was computed. [2018-11-23 02:44:44,089 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2018-11-23 02:44:44,089 INFO L448 ceAbstractionStarter]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2018-11-23 02:44:44,089 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 69) no Hoare annotation was computed. [2018-11-23 02:44:44,089 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 27) no Hoare annotation was computed. [2018-11-23 02:44:44,089 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2018-11-23 02:44:44,094 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 02:44:44,095 INFO L168 Benchmark]: Toolchain (without parser) took 271353.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.6 MB). Free memory was 943.8 MB in the beginning and 1.2 GB in the end (delta: -265.3 MB). Peak memory consumption was 347.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:44,096 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:44:44,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.41 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 922.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:44,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 922.4 MB in the beginning and 1.1 GB in the end (delta: -206.7 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:44,097 INFO L168 Benchmark]: Boogie Preprocessor took 40.54 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:44,097 INFO L168 Benchmark]: RCFGBuilder took 1340.91 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: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:44,097 INFO L168 Benchmark]: TraceAbstraction took 269631.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 93.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -145.6 MB). Peak memory consumption was 332.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:44,100 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 262.41 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 922.4 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 75.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 922.4 MB in the beginning and 1.1 GB in the end (delta: -206.7 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.54 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1340.91 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: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 269631.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 93.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -145.6 MB). Peak memory consumption was 332.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 239]: 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...