./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1121b_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_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1121b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/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 1c6c05365b181d4eacf1f0a2b19f094d722c4a6a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1121b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/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 1c6c05365b181d4eacf1f0a2b19f094d722c4a6a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:05:13,182 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:05:13,183 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:05:13,189 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:05:13,190 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:05:13,190 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:05:13,191 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:05:13,191 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:05:13,192 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:05:13,193 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:05:13,193 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:05:13,194 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:05:13,194 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:05:13,195 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:05:13,196 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:05:13,196 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:05:13,197 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:05:13,198 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:05:13,199 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:05:13,200 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:05:13,201 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:05:13,201 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:05:13,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:05:13,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:05:13,203 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:05:13,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:05:13,204 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:05:13,205 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:05:13,205 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:05:13,206 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:05:13,206 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:05:13,206 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:05:13,206 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:05:13,206 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:05:13,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:05:13,207 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:05:13,207 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 00:05:13,214 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:05:13,215 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:05:13,215 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:05:13,215 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:05:13,216 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 00:05:13,216 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 00:05:13,216 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 00:05:13,216 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 00:05:13,216 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 00:05:13,216 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 00:05:13,216 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 00:05:13,216 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 00:05:13,217 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 00:05:13,217 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:05:13,217 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:05:13,217 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:05:13,218 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:05:13,218 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:05:13,218 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:05:13,218 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:05:13,218 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:05:13,218 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:05:13,218 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:05:13,218 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:05:13,219 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:05:13,219 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:05:13,219 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:05:13,219 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:05:13,219 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:05:13,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:05:13,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:05:13,220 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:05:13,220 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:05:13,220 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 00:05:13,220 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:05:13,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:05:13,220 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 00:05:13,220 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_38ab8606-b5aa-47f1-8ebe-a000915a39a9/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 -> 1c6c05365b181d4eacf1f0a2b19f094d722c4a6a [2018-11-23 00:05:13,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:05:13,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:05:13,255 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:05:13,256 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:05:13,256 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:05:13,257 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1121b_true-unreach-call.c [2018-11-23 00:05:13,295 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/data/e37b89c98/d99e2547380e45f5bdac44e2c0c950d1/FLAGc8d3b7b22 [2018-11-23 00:05:13,646 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:05:13,647 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/sv-benchmarks/c/float-newlib/double_req_bl_1121b_true-unreach-call.c [2018-11-23 00:05:13,652 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/data/e37b89c98/d99e2547380e45f5bdac44e2c0c950d1/FLAGc8d3b7b22 [2018-11-23 00:05:14,053 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/data/e37b89c98/d99e2547380e45f5bdac44e2c0c950d1 [2018-11-23 00:05:14,056 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:05:14,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:05:14,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:05:14,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:05:14,060 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:05:14,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411bce80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14, skipping insertion in model container [2018-11-23 00:05:14,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:05:14,091 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:05:14,235 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:05:14,239 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:05:14,264 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:05:14,276 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:05:14,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14 WrapperNode [2018-11-23 00:05:14,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:05:14,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:05:14,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:05:14,277 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:05:14,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:05:14,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:05:14,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:05:14,331 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:05:14,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:05:14,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:05:14,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:05:14,364 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:05:14,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/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 00:05:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 00:05:14,400 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 00:05:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:05:14,400 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:05:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:05:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 00:05:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:05:14,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:05:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 00:05:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:05:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure fmod_double [2018-11-23 00:05:14,401 INFO L138 BoogieDeclarations]: Found implementation of procedure fmod_double [2018-11-23 00:05:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:05:14,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:05:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:05:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2018-11-23 00:05:14,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:05:14,763 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:05:14,763 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 00:05:14,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:14 BoogieIcfgContainer [2018-11-23 00:05:14,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:05:14,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:05:14,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:05:14,766 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:05:14,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:05:14" (1/3) ... [2018-11-23 00:05:14,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15962fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:14, skipping insertion in model container [2018-11-23 00:05:14,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (2/3) ... [2018-11-23 00:05:14,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15962fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:14, skipping insertion in model container [2018-11-23 00:05:14,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:14" (3/3) ... [2018-11-23 00:05:14,770 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1121b_true-unreach-call.c [2018-11-23 00:05:14,776 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:05:14,780 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:05:14,790 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:05:14,812 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:05:14,812 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:05:14,812 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:05:14,812 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:05:14,812 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:05:14,812 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:05:14,813 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:05:14,813 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:05:14,824 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-11-23 00:05:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 00:05:14,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:05:14,830 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] [2018-11-23 00:05:14,831 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:05:14,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:05:14,835 INFO L82 PathProgramCache]: Analyzing trace with hash -814364459, now seen corresponding path program 1 times [2018-11-23 00:05:14,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:05:14,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:05:14,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:05:14,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:05:14,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:05:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:05:14,922 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 00:05:14,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:05:14,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:05:14,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:05:14,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 00:05:14,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 00:05:14,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 00:05:14,938 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-11-23 00:05:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:05:14,958 INFO L93 Difference]: Finished difference Result 128 states and 210 transitions. [2018-11-23 00:05:14,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 00:05:14,959 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 00:05:14,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:05:14,966 INFO L225 Difference]: With dead ends: 128 [2018-11-23 00:05:14,966 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 00:05:14,968 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 00:05:14,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 00:05:14,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 00:05:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 00:05:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2018-11-23 00:05:14,996 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 22 [2018-11-23 00:05:14,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:05:14,996 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2018-11-23 00:05:14,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 00:05:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2018-11-23 00:05:14,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 00:05:14,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:05:14,997 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] [2018-11-23 00:05:14,997 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:05:14,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:05:14,997 INFO L82 PathProgramCache]: Analyzing trace with hash -920031726, now seen corresponding path program 1 times [2018-11-23 00:05:14,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:05:14,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:05:14,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:05:14,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:05:14,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:05:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:05:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:05:15,093 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6442450954, |#NULL.offset|=6442450945, |old(#NULL.base)|=6442450954, |old(#NULL.offset)|=6442450945, |old(~#Zero_fmod~0.base)|=6442450958, |old(~#Zero_fmod~0.offset)|=6442450953, |old(~one_fmod~0)|=6442450961.0, |~#Zero_fmod~0.base|=6442450958, |~#Zero_fmod~0.offset|=6442450953, ~one_fmod~0=6442450961.0] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~one_fmod~0 := 1.0;call ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := #Ultimate.alloc(16);call write~init~real(0.0, ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 8);call write~init~real(~someUnaryDOUBLEoperation(0.0), ~#Zero_fmod~0.base, 8 + ~#Zero_fmod~0.offset, 8); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450954, |old(#NULL.offset)|=6442450945, |old(~#Zero_fmod~0.base)|=6442450958, |old(~#Zero_fmod~0.offset)|=6442450953, |old(~one_fmod~0)|=6442450961.0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450954, |old(#NULL.offset)|=6442450945, |old(~#Zero_fmod~0.base)|=6442450958, |old(~#Zero_fmod~0.offset)|=6442450953, |old(~one_fmod~0)|=6442450961.0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] RET #261#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] CALL call #t~ret19 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] ~x~0 := #t~nondet16;havoc #t~nondet16;~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [main_~x~0=6442450948.0, |#NULL.base|=0, |#NULL.offset|=0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] CALL call #t~ret17 := fmod_double(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmod_double_#in~x|=6442450948.0, |fmod_double_#in~y|=6442450959.0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] ~x := #in~x;~y := #in~y;havoc ~n~0;havoc ~hx~0;havoc ~hy~0;havoc ~hz~0;havoc ~ix~0;havoc ~iy~0;havoc ~sx~0;havoc ~i~0;havoc ~lx~0;havoc ~ly~0;havoc ~lz~0; VAL [fmod_double_~x=6442450948.0, fmod_double_~y=6442450959.0, |#NULL.base|=0, |#NULL.offset|=0, |fmod_double_#in~x|=6442450948.0, |fmod_double_#in~y|=6442450959.0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union1;havoc #t~mem0;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lx~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [fmod_double_~hx~0=3, fmod_double_~lx~0=6442450960, fmod_double_~x=6442450948.0, fmod_double_~y=6442450959.0, |#NULL.base|=0, |#NULL.offset|=0, |fmod_double_#in~x|=6442450948.0, |fmod_double_#in~y|=6442450959.0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] goto; VAL [fmod_double_~hx~0=3, fmod_double_~lx~0=6442450960, fmod_double_~x=6442450948.0, fmod_double_~y=6442450959.0, |#NULL.base|=0, |#NULL.offset|=0, |fmod_double_#in~x|=6442450948.0, |fmod_double_#in~y|=6442450959.0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8);call write~real(~y, ~#ew_u~1.base, ~#ew_u~1.offset, 8);call #t~mem4 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4);~hy~0 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union5, ~#ew_u~1.base, ~#ew_u~1.offset, 8);havoc #t~union5;havoc #t~mem4;call #t~mem6 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4);~ly~0 := #t~mem6;call write~real(#t~union7, ~#ew_u~1.base, ~#ew_u~1.offset, 8);havoc #t~mem6;havoc #t~union7;call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset);havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [fmod_double_~hx~0=3, fmod_double_~hy~0=(- 2147483648), fmod_double_~lx~0=6442450960, fmod_double_~ly~0=6442450952, fmod_double_~x=6442450948.0, fmod_double_~y=6442450959.0, |#NULL.base|=0, |#NULL.offset|=0, |fmod_double_#in~x|=6442450948.0, |fmod_double_#in~y|=6442450959.0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] goto; VAL [fmod_double_~hx~0=3, fmod_double_~hy~0=(- 2147483648), fmod_double_~lx~0=6442450960, fmod_double_~ly~0=6442450952, fmod_double_~x=6442450948.0, fmod_double_~y=6442450959.0, |#NULL.base|=0, |#NULL.offset|=0, |fmod_double_#in~x|=6442450948.0, |fmod_double_#in~y|=6442450959.0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] ~sx~0 := (if ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 - 4294967296);~hx~0 := ~bitwiseXor(~hx~0, ~sx~0);~hy~0 := ~bitwiseAnd(~hy~0, 2147483647); VAL [fmod_double_~lx~0=6442450960, fmod_double_~ly~0=6442450952, fmod_double_~sx~0=0, fmod_double_~x=6442450948.0, fmod_double_~y=6442450959.0, |#NULL.base|=0, |#NULL.offset|=0, |fmod_double_#in~x|=6442450948.0, |fmod_double_#in~y|=6442450959.0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] assume (0 == ~bitwiseOr(~hy~0, ~ly~0) % 4294967296 || ~hx~0 >= 2146435072) || ~bitwiseOr(~hy~0, ~bitwiseOr(~ly~0, -~ly~0) / 2147483648) % 4294967296 > 2146435072;#res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~y), ~someBinaryArithmeticDOUBLEoperation(~x, ~y)); VAL [fmod_double_~hx~0=2146435072, fmod_double_~lx~0=6442450960, fmod_double_~ly~0=6442450952, fmod_double_~sx~0=0, fmod_double_~x=6442450948.0, fmod_double_~y=6442450959.0, |#NULL.base|=0, |#NULL.offset|=0, |fmod_double_#in~x|=6442450948.0, |fmod_double_#in~y|=6442450959.0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] assume true; VAL [fmod_double_~hx~0=2146435072, fmod_double_~lx~0=6442450960, fmod_double_~ly~0=6442450952, fmod_double_~sx~0=0, fmod_double_~x=6442450948.0, fmod_double_~y=6442450959.0, |#NULL.base|=0, |#NULL.offset|=0, |fmod_double_#in~x|=6442450948.0, |fmod_double_#in~y|=6442450959.0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] RET #265#return; VAL [main_~x~0=6442450948.0, main_~y~0=6442450959.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=6442450950.0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] ~res~0 := #t~ret17;havoc #t~ret17; VAL [main_~res~0=6442450950.0, main_~x~0=6442450948.0, main_~y~0=6442450959.0, |#NULL.base|=0, |#NULL.offset|=0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] CALL call #t~ret18 := isnan_double(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=6442450950.0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_double_~x=6442450950.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=6442450950.0, |isnan_double_#res|=0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] assume true; VAL [isnan_double_~x=6442450950.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=6442450950.0, |isnan_double_#res|=0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] RET #267#return; VAL [main_~res~0=6442450950.0, main_~x~0=6442450948.0, main_~y~0=6442450959.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret18|=0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; VAL [main_~res~0=6442450950.0, main_~x~0=6442450948.0, main_~y~0=6442450959.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret18|=0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] assume 0 == #t~ret18;havoc #t~ret18; VAL [main_~res~0=6442450950.0, main_~x~0=6442450948.0, main_~y~0=6442450959.0, |#NULL.base|=0, |#NULL.offset|=0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] assume !false; VAL [main_~res~0=6442450950.0, main_~x~0=6442450948.0, main_~y~0=6442450959.0, |#NULL.base|=0, |#NULL.offset|=0, |~#Zero_fmod~0.base|=6442450957, |~#Zero_fmod~0.offset|=0, ~one_fmod~0=1.0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450954, #NULL.offset=6442450945, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450945, old(~#Zero_fmod~0.base)=6442450958, old(~#Zero_fmod~0.offset)=6442450953, old(~one_fmod~0)=6.442450961E9, ~#Zero_fmod~0.base=6442450958, ~#Zero_fmod~0.offset=6442450953, ~one_fmod~0=6.442450961E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L18-L21] ~one_fmod~0 := 1.0; [L18-L21] call ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := #Ultimate.alloc(16); [L18-L21] call write~init~real(0.0, ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 8); [L18-L21] call write~init~real(~someUnaryDOUBLEoperation(0.0), ~#Zero_fmod~0.base, 8 + ~#Zero_fmod~0.offset, 8); VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450945, old(~#Zero_fmod~0.base)=6442450958, old(~#Zero_fmod~0.offset)=6442450953, old(~one_fmod~0)=6.442450961E9, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450945, old(~#Zero_fmod~0.base)=6442450958, old(~#Zero_fmod~0.offset)=6442450953, old(~one_fmod~0)=6.442450961E9, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0] [?] CALL call #t~ret19 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0] [L169] ~x~0 := #t~nondet16; [L169] havoc #t~nondet16; [L170] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~x~0=6.442450948E9] [L171] CALL call #t~ret17 := fmod_double(~x~0, ~y~0); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0] [L23-L161] ~x := #in~x; [L23-L161] ~y := #in~y; [L24] havoc ~n~0; [L24] havoc ~hx~0; [L24] havoc ~hy~0; [L24] havoc ~hz~0; [L24] havoc ~ix~0; [L24] havoc ~iy~0; [L24] havoc ~sx~0; [L24] havoc ~i~0; [L25] havoc ~lx~0; [L25] havoc ~ly~0; [L25] havoc ~lz~0; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L28] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L29] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L30] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L30] ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L30] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L30] havoc #t~union1; [L30] havoc #t~mem0; [L31] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L31] ~lx~0 := #t~mem2; [L31] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L31] havoc #t~union3; [L31] havoc #t~mem2; [L28] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L28] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~hx~0=3, ~lx~0=6442450960, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L34] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8); [L35] call write~real(~y, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L36] call #t~mem4 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4); [L36] ~hy~0 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] call write~real(#t~union5, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L37] call #t~mem6 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4); [L37] ~ly~0 := #t~mem6; [L37] call write~real(#t~union7, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L37] havoc #t~mem6; [L37] havoc #t~union7; [L34] call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset); [L34] havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~hx~0=3, ~hy~0=-2147483648, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L39] ~sx~0 := (if ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L40] ~hx~0 := ~bitwiseXor(~hx~0, ~sx~0); [L41] ~hy~0 := ~bitwiseAnd(~hy~0, 2147483647); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~sx~0=0, ~x=6.442450948E9, ~y=6.442450959E9] [L43-L45] assume (0 == ~bitwiseOr(~hy~0, ~ly~0) % 4294967296 || ~hx~0 >= 2146435072) || ~bitwiseOr(~hy~0, ~bitwiseOr(~ly~0, -~ly~0) / 2147483648) % 4294967296 > 2146435072; [L45] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~y), ~someBinaryArithmeticDOUBLEoperation(~x, ~y)); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~hx~0=2146435072, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~sx~0=0, ~x=6.442450948E9, ~y=6.442450959E9] [L23-L161] ensures true; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~hx~0=2146435072, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~sx~0=0, ~x=6.442450948E9, ~y=6.442450959E9] [L171] RET call #t~ret17 := fmod_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=6.44245095E9, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L171] ~res~0 := #t~ret17; [L171] havoc #t~ret17; VAL [#NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174] CALL call #t~ret18 := isnan_double(~res~0); VAL [#in~x=6.44245095E9, #NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=6.44245095E9, #NULL.base=0, #NULL.offset=0, #res=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~x=6.44245095E9] [L16] ensures true; VAL [#in~x=6.44245095E9, #NULL.base=0, #NULL.offset=0, #res=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~x=6.44245095E9] [L174] RET call #t~ret18 := isnan_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret18=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret18=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174-L177] assume 0 == #t~ret18; [L174] havoc #t~ret18; VAL [#NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L175] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450954, #NULL.offset=6442450945, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450945, old(~#Zero_fmod~0.base)=6442450958, old(~#Zero_fmod~0.offset)=6442450953, old(~one_fmod~0)=6.442450961E9, ~#Zero_fmod~0.base=6442450958, ~#Zero_fmod~0.offset=6442450953, ~one_fmod~0=6.442450961E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L18-L21] ~one_fmod~0 := 1.0; [L18-L21] call ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := #Ultimate.alloc(16); [L18-L21] call write~init~real(0.0, ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 8); [L18-L21] call write~init~real(~someUnaryDOUBLEoperation(0.0), ~#Zero_fmod~0.base, 8 + ~#Zero_fmod~0.offset, 8); VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450945, old(~#Zero_fmod~0.base)=6442450958, old(~#Zero_fmod~0.offset)=6442450953, old(~one_fmod~0)=6.442450961E9, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450945, old(~#Zero_fmod~0.base)=6442450958, old(~#Zero_fmod~0.offset)=6442450953, old(~one_fmod~0)=6.442450961E9, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0] [?] CALL call #t~ret19 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0] [L169] ~x~0 := #t~nondet16; [L169] havoc #t~nondet16; [L170] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~x~0=6.442450948E9] [L171] CALL call #t~ret17 := fmod_double(~x~0, ~y~0); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0] [L23-L161] ~x := #in~x; [L23-L161] ~y := #in~y; [L24] havoc ~n~0; [L24] havoc ~hx~0; [L24] havoc ~hy~0; [L24] havoc ~hz~0; [L24] havoc ~ix~0; [L24] havoc ~iy~0; [L24] havoc ~sx~0; [L24] havoc ~i~0; [L25] havoc ~lx~0; [L25] havoc ~ly~0; [L25] havoc ~lz~0; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L28] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L29] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L30] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L30] ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L30] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L30] havoc #t~union1; [L30] havoc #t~mem0; [L31] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L31] ~lx~0 := #t~mem2; [L31] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L31] havoc #t~union3; [L31] havoc #t~mem2; [L28] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L28] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~hx~0=3, ~lx~0=6442450960, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L34] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8); [L35] call write~real(~y, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L36] call #t~mem4 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4); [L36] ~hy~0 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] call write~real(#t~union5, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L37] call #t~mem6 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4); [L37] ~ly~0 := #t~mem6; [L37] call write~real(#t~union7, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L37] havoc #t~mem6; [L37] havoc #t~union7; [L34] call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset); [L34] havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~hx~0=3, ~hy~0=-2147483648, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L39] ~sx~0 := (if ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L40] ~hx~0 := ~bitwiseXor(~hx~0, ~sx~0); [L41] ~hy~0 := ~bitwiseAnd(~hy~0, 2147483647); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~sx~0=0, ~x=6.442450948E9, ~y=6.442450959E9] [L43-L45] assume (0 == ~bitwiseOr(~hy~0, ~ly~0) % 4294967296 || ~hx~0 >= 2146435072) || ~bitwiseOr(~hy~0, ~bitwiseOr(~ly~0, -~ly~0) / 2147483648) % 4294967296 > 2146435072; [L45] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~y), ~someBinaryArithmeticDOUBLEoperation(~x, ~y)); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~hx~0=2146435072, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~sx~0=0, ~x=6.442450948E9, ~y=6.442450959E9] [L23-L161] ensures true; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~hx~0=2146435072, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~sx~0=0, ~x=6.442450948E9, ~y=6.442450959E9] [L171] RET call #t~ret17 := fmod_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=6.44245095E9, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L171] ~res~0 := #t~ret17; [L171] havoc #t~ret17; VAL [#NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174] CALL call #t~ret18 := isnan_double(~res~0); VAL [#in~x=6.44245095E9, #NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=6.44245095E9, #NULL.base=0, #NULL.offset=0, #res=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~x=6.44245095E9] [L16] ensures true; VAL [#in~x=6.44245095E9, #NULL.base=0, #NULL.offset=0, #res=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~x=6.44245095E9] [L174] RET call #t~ret18 := isnan_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret18=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret18=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174-L177] assume 0 == #t~ret18; [L174] havoc #t~ret18; VAL [#NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L175] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#Zero_fmod~0.base=6442450957, ~#Zero_fmod~0.offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450954, #NULL!offset=6442450945, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450945, old(~#Zero_fmod~0!base)=6442450958, old(~#Zero_fmod~0!offset)=6442450953, old(~one_fmod~0)=6.442450961E9, ~#Zero_fmod~0!base=6442450958, ~#Zero_fmod~0!offset=6442450953, ~one_fmod~0=6.442450961E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18-L21] ~one_fmod~0 := 1.0; [L18-L21] FCALL call ~#Zero_fmod~0 := #Ultimate.alloc(16); [L18-L21] FCALL call write~init~real(0.0, { base: ~#Zero_fmod~0!base, offset: ~#Zero_fmod~0!offset }, 8); [L18-L21] FCALL call write~init~real(~someUnaryDOUBLEoperation(0.0), { base: ~#Zero_fmod~0!base, offset: 8 + ~#Zero_fmod~0!offset }, 8); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450945, old(~#Zero_fmod~0!base)=6442450958, old(~#Zero_fmod~0!offset)=6442450953, old(~one_fmod~0)=6.442450961E9, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [L169] ~x~0 := #t~nondet16; [L169] havoc #t~nondet16; [L170] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~x~0=6.442450948E9] [L171] CALL call #t~ret17 := fmod_double(~x~0, ~y~0); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [L23-L161] ~x := #in~x; [L23-L161] ~y := #in~y; [L24] havoc ~n~0; [L24] havoc ~hx~0; [L24] havoc ~hy~0; [L24] havoc ~hz~0; [L24] havoc ~ix~0; [L24] havoc ~iy~0; [L24] havoc ~sx~0; [L24] havoc ~i~0; [L25] havoc ~lx~0; [L25] havoc ~ly~0; [L25] havoc ~lz~0; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L28] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L29] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L30] ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L30] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] havoc #t~union1; [L30] havoc #t~mem0; [L31] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L31] ~lx~0 := #t~mem2; [L31] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L31] havoc #t~union3; [L31] havoc #t~mem2; [L28] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L28] havoc ~#ew_u~0; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~hx~0=3, ~lx~0=6442450960, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L34] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L35] FCALL call write~real(~y, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L36] FCALL call #t~mem4 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L36] ~hy~0 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] FCALL call write~real(#t~union5, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L37] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L37] ~ly~0 := #t~mem6; [L37] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L37] havoc #t~mem6; [L37] havoc #t~union7; [L34] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L34] havoc ~#ew_u~1; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~hx~0=3, ~hy~0=-2147483648, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L39] ~sx~0 := (if ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L40] ~hx~0 := ~bitwiseXor(~hx~0, ~sx~0); [L41] ~hy~0 := ~bitwiseAnd(~hy~0, 2147483647); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~sx~0=0, ~x=6.442450948E9, ~y=6.442450959E9] [L43-L44] COND TRUE (0 == ~bitwiseOr(~hy~0, ~ly~0) % 4294967296 || ~hx~0 >= 2146435072) || ~bitwiseOr(~hy~0, ~bitwiseOr(~ly~0, -~ly~0) / 2147483648) % 4294967296 > 2146435072 [L45] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~y), ~someBinaryArithmeticDOUBLEoperation(~x, ~y)); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~hx~0=2146435072, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~sx~0=0, ~x=6.442450948E9, ~y=6.442450959E9] [L171] RET call #t~ret17 := fmod_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=6.44245095E9, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L171] ~res~0 := #t~ret17; [L171] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174] CALL call #t~ret18 := isnan_double(~res~0); VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, #res=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~x=6.44245095E9] [L174] RET call #t~ret18 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret18=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret18=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174] COND TRUE 0 == #t~ret18 [L174] havoc #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L175] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450954, #NULL!offset=6442450945, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450945, old(~#Zero_fmod~0!base)=6442450958, old(~#Zero_fmod~0!offset)=6442450953, old(~one_fmod~0)=6.442450961E9, ~#Zero_fmod~0!base=6442450958, ~#Zero_fmod~0!offset=6442450953, ~one_fmod~0=6.442450961E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18-L21] ~one_fmod~0 := 1.0; [L18-L21] FCALL call ~#Zero_fmod~0 := #Ultimate.alloc(16); [L18-L21] FCALL call write~init~real(0.0, { base: ~#Zero_fmod~0!base, offset: ~#Zero_fmod~0!offset }, 8); [L18-L21] FCALL call write~init~real(~someUnaryDOUBLEoperation(0.0), { base: ~#Zero_fmod~0!base, offset: 8 + ~#Zero_fmod~0!offset }, 8); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450945, old(~#Zero_fmod~0!base)=6442450958, old(~#Zero_fmod~0!offset)=6442450953, old(~one_fmod~0)=6.442450961E9, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [L169] ~x~0 := #t~nondet16; [L169] havoc #t~nondet16; [L170] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~x~0=6.442450948E9] [L171] CALL call #t~ret17 := fmod_double(~x~0, ~y~0); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [L23-L161] ~x := #in~x; [L23-L161] ~y := #in~y; [L24] havoc ~n~0; [L24] havoc ~hx~0; [L24] havoc ~hy~0; [L24] havoc ~hz~0; [L24] havoc ~ix~0; [L24] havoc ~iy~0; [L24] havoc ~sx~0; [L24] havoc ~i~0; [L25] havoc ~lx~0; [L25] havoc ~ly~0; [L25] havoc ~lz~0; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L28] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L29] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L30] ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L30] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] havoc #t~union1; [L30] havoc #t~mem0; [L31] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L31] ~lx~0 := #t~mem2; [L31] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L31] havoc #t~union3; [L31] havoc #t~mem2; [L28] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L28] havoc ~#ew_u~0; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~hx~0=3, ~lx~0=6442450960, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L34] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L35] FCALL call write~real(~y, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L36] FCALL call #t~mem4 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L36] ~hy~0 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] FCALL call write~real(#t~union5, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L37] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L37] ~ly~0 := #t~mem6; [L37] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L37] havoc #t~mem6; [L37] havoc #t~union7; [L34] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L34] havoc ~#ew_u~1; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~hx~0=3, ~hy~0=-2147483648, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L39] ~sx~0 := (if ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L40] ~hx~0 := ~bitwiseXor(~hx~0, ~sx~0); [L41] ~hy~0 := ~bitwiseAnd(~hy~0, 2147483647); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~sx~0=0, ~x=6.442450948E9, ~y=6.442450959E9] [L43-L44] COND TRUE (0 == ~bitwiseOr(~hy~0, ~ly~0) % 4294967296 || ~hx~0 >= 2146435072) || ~bitwiseOr(~hy~0, ~bitwiseOr(~ly~0, -~ly~0) / 2147483648) % 4294967296 > 2146435072 [L45] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~y), ~someBinaryArithmeticDOUBLEoperation(~x, ~y)); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~hx~0=2146435072, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~sx~0=0, ~x=6.442450948E9, ~y=6.442450959E9] [L171] RET call #t~ret17 := fmod_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=6.44245095E9, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L171] ~res~0 := #t~ret17; [L171] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174] CALL call #t~ret18 := isnan_double(~res~0); VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, #res=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~x=6.44245095E9] [L174] RET call #t~ret18 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret18=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret18=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174] COND TRUE 0 == #t~ret18 [L174] havoc #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L175] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450954, #NULL!offset=6442450945, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450945, old(~#Zero_fmod~0!base)=6442450958, old(~#Zero_fmod~0!offset)=6442450953, old(~one_fmod~0)=6.442450961E9, ~#Zero_fmod~0!base=6442450958, ~#Zero_fmod~0!offset=6442450953, ~one_fmod~0=6.442450961E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18-L21] ~one_fmod~0 := 1.0; [L18-L21] FCALL call ~#Zero_fmod~0 := #Ultimate.alloc(16); [L18-L21] FCALL call write~init~real(0.0, { base: ~#Zero_fmod~0!base, offset: ~#Zero_fmod~0!offset }, 8); [L18-L21] FCALL call write~init~real(~someUnaryDOUBLEoperation(0.0), { base: ~#Zero_fmod~0!base, offset: 8 + ~#Zero_fmod~0!offset }, 8); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450945, old(~#Zero_fmod~0!base)=6442450958, old(~#Zero_fmod~0!offset)=6442450953, old(~one_fmod~0)=6.442450961E9, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [L169] ~x~0 := #t~nondet16; [L169] havoc #t~nondet16; [L170] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~x~0=6.442450948E9] [L171] CALL call #t~ret17 := fmod_double(~x~0, ~y~0); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [L23-L161] ~x := #in~x; [L23-L161] ~y := #in~y; [L24] havoc ~n~0; [L24] havoc ~hx~0; [L24] havoc ~hy~0; [L24] havoc ~hz~0; [L24] havoc ~ix~0; [L24] havoc ~iy~0; [L24] havoc ~sx~0; [L24] havoc ~i~0; [L25] havoc ~lx~0; [L25] havoc ~ly~0; [L25] havoc ~lz~0; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L28] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L29] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L30] ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L30] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] havoc #t~union1; [L30] havoc #t~mem0; [L31] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L31] ~lx~0 := #t~mem2; [L31] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L31] havoc #t~union3; [L31] havoc #t~mem2; [L28] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L28] havoc ~#ew_u~0; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~hx~0=3, ~lx~0=6442450960, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L34] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L35] FCALL call write~real(~y, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L36] FCALL call #t~mem4 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L36] ~hy~0 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] FCALL call write~real(#t~union5, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L37] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L37] ~ly~0 := #t~mem6; [L37] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L37] havoc #t~mem6; [L37] havoc #t~union7; [L34] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L34] havoc ~#ew_u~1; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~hx~0=3, ~hy~0=-2147483648, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L39] ~sx~0 := (if ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L40] ~hx~0 := ~bitwiseXor(~hx~0, ~sx~0); [L41] ~hy~0 := ~bitwiseAnd(~hy~0, 2147483647); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~sx~0=0, ~x=6.442450948E9, ~y=6.442450959E9] [L43-L44] COND TRUE (0 == ~bitwiseOr(~hy~0, ~ly~0) % 4294967296 || ~hx~0 >= 2146435072) || ~bitwiseOr(~hy~0, ~bitwiseOr(~ly~0, -~ly~0) / 2147483648) % 4294967296 > 2146435072 [L45] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~y), ~someBinaryArithmeticDOUBLEoperation(~x, ~y)); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~hx~0=2146435072, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~sx~0=0, ~x=6.442450948E9, ~y=6.442450959E9] [L171] RET call #t~ret17 := fmod_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=6.44245095E9, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L171] ~res~0 := #t~ret17; [L171] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174] CALL call #t~ret18 := isnan_double(~res~0); VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, #res=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~x=6.44245095E9] [L174] RET call #t~ret18 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret18=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret18=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174] COND TRUE 0 == #t~ret18 [L174] havoc #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L175] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450954, #NULL!offset=6442450945, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450945, old(~#Zero_fmod~0!base)=6442450958, old(~#Zero_fmod~0!offset)=6442450953, old(~one_fmod~0)=6.442450961E9, ~#Zero_fmod~0!base=6442450958, ~#Zero_fmod~0!offset=6442450953, ~one_fmod~0=6.442450961E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18-L21] ~one_fmod~0 := 1.0; [L18-L21] FCALL call ~#Zero_fmod~0 := #Ultimate.alloc(16); [L18-L21] FCALL call write~init~real(0.0, { base: ~#Zero_fmod~0!base, offset: ~#Zero_fmod~0!offset }, 8); [L18-L21] FCALL call write~init~real(~someUnaryDOUBLEoperation(0.0), { base: ~#Zero_fmod~0!base, offset: 8 + ~#Zero_fmod~0!offset }, 8); VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450945, old(~#Zero_fmod~0!base)=6442450958, old(~#Zero_fmod~0!offset)=6442450953, old(~one_fmod~0)=6.442450961E9, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [?] CALL call #t~ret19 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [L169] ~x~0 := #t~nondet16; [L169] havoc #t~nondet16; [L170] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~x~0=6.442450948E9] [L171] CALL call #t~ret17 := fmod_double(~x~0, ~y~0); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [L23-L161] ~x := #in~x; [L23-L161] ~y := #in~y; [L24] havoc ~n~0; [L24] havoc ~hx~0; [L24] havoc ~hy~0; [L24] havoc ~hz~0; [L24] havoc ~ix~0; [L24] havoc ~iy~0; [L24] havoc ~sx~0; [L24] havoc ~i~0; [L25] havoc ~lx~0; [L25] havoc ~ly~0; [L25] havoc ~lz~0; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L28] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L29] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L30] ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L30] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] havoc #t~union1; [L30] havoc #t~mem0; [L31] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L31] ~lx~0 := #t~mem2; [L31] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L31] havoc #t~union3; [L31] havoc #t~mem2; [L28] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L28] havoc ~#ew_u~0; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~hx~0=3, ~lx~0=6442450960, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L34] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L35] FCALL call write~real(~y, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L36] FCALL call #t~mem4 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L36] ~hy~0 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] FCALL call write~real(#t~union5, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L37] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L37] ~ly~0 := #t~mem6; [L37] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L37] havoc #t~mem6; [L37] havoc #t~union7; [L34] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L34] havoc ~#ew_u~1; VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~hx~0=3, ~hy~0=-2147483648, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~x=6.442450948E9, ~y=6.442450959E9] [L39] ~sx~0 := (if ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L40] ~hx~0 := ~bitwiseXor(~hx~0, ~sx~0); [L41] ~hy~0 := ~bitwiseAnd(~hy~0, 2147483647); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~sx~0=0, ~x=6.442450948E9, ~y=6.442450959E9] [L43-L44] COND TRUE (0 == ~bitwiseOr(~hy~0, ~ly~0) % 4294967296 || ~hx~0 >= 2146435072) || ~bitwiseOr(~hy~0, ~bitwiseOr(~ly~0, -~ly~0) / 2147483648) % 4294967296 > 2146435072 [L45] #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~y), ~someBinaryArithmeticDOUBLEoperation(~x, ~y)); VAL [#in~x=6.442450948E9, #in~y=6.442450959E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~hx~0=2146435072, ~lx~0=6442450960, ~ly~0=6442450952, ~one_fmod~0=1.0, ~sx~0=0, ~x=6.442450948E9, ~y=6.442450959E9] [L171] RET call #t~ret17 := fmod_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=6.44245095E9, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L171] ~res~0 := #t~ret17; [L171] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174] CALL call #t~ret18 := isnan_double(~res~0); VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=6.44245095E9, #NULL!base=0, #NULL!offset=0, #res=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~x=6.44245095E9] [L174] RET call #t~ret18 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret18=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret18=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L174] COND TRUE 0 == #t~ret18 [L174] havoc #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L175] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#Zero_fmod~0!base=6442450957, ~#Zero_fmod~0!offset=0, ~one_fmod~0=1.0, ~res~0=6.44245095E9, ~x~0=6.442450948E9, ~y~0=6.442450959E9] [L18-L21] static const double one_fmod = 1.0, Zero_fmod[] = { 0.0, -0.0, }; VAL [\old(one_fmod)=6442450961, \old(Zero_fmod)=6442450958, \old(Zero_fmod)=6442450953, one_fmod=1, Zero_fmod={6442450957:0}] [L169] double x = __VERIFIER_nondet_double(); [L170] double y = -0.0; VAL [one_fmod=1, x=6442450948, Zero_fmod={6442450957:0}] [L171] CALL, EXPR fmod_double(x, y) VAL [\old(x)=6442450948, \old(y)=6442450959, one_fmod=1, Zero_fmod={6442450957:0}] [L24] __int32_t n, hx, hy, hz, ix, iy, sx, i; [L25] __uint32_t lx, ly, lz; VAL [\old(x)=6442450948, \old(y)=6442450959, one_fmod=1, x=6442450948, y=6442450959, Zero_fmod={6442450957:0}] [L28] ieee_double_shape_type ew_u; [L29] ew_u.value = (x) [L30] EXPR ew_u.parts.msw [L30] (hx) = ew_u.parts.msw [L31] EXPR ew_u.parts.lsw [L31] (lx) = ew_u.parts.lsw [L34] ieee_double_shape_type ew_u; [L35] ew_u.value = (y) [L36] EXPR ew_u.parts.msw [L36] (hy) = ew_u.parts.msw [L37] EXPR ew_u.parts.lsw [L37] (ly) = ew_u.parts.lsw [L39] sx = hx & 0x80000000 [L40] hx ^= sx [L41] hy &= 0x7fffffff VAL [\old(x)=6442450948, \old(y)=6442450959, lx=6442450960, ly=6442450952, one_fmod=1, sx=0, x=6442450948, y=6442450959, Zero_fmod={6442450957:0}] [L43-L44] COND TRUE (hy | ly) == 0 || (hx >= 0x7ff00000) || ((hy | ((ly | -ly) >> 31)) > 0x7ff00000) [L45] return (x * y) / (x * y); VAL [\old(x)=6442450948, \old(y)=6442450959, hx=2146435072, lx=6442450960, ly=6442450952, one_fmod=1, sx=0, x=6442450948, y=6442450959, Zero_fmod={6442450957:0}] [L171] RET, EXPR fmod_double(x, y) VAL [fmod_double(x, y)=6442450950, one_fmod=1, x=6442450948, y=6442450959, Zero_fmod={6442450957:0}] [L171] double res = fmod_double(x, y); [L174] CALL, EXPR isnan_double(res) VAL [\old(x)=6442450950, one_fmod=1, Zero_fmod={6442450957:0}] [L16] return x != x; VAL [\old(x)=6442450950, \result=0, one_fmod=1, x=6442450950, Zero_fmod={6442450957:0}] [L174] RET, EXPR isnan_double(res) VAL [isnan_double(res)=0, one_fmod=1, res=6442450950, x=6442450948, y=6442450959, Zero_fmod={6442450957:0}] [L174] COND TRUE !isnan_double(res) [L175] __VERIFIER_error() VAL [one_fmod=1, res=6442450950, x=6442450948, y=6442450959, Zero_fmod={6442450957:0}] ----- [2018-11-23 00:05:15,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:05:15 BoogieIcfgContainer [2018-11-23 00:05:15,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:05:15,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:05:15,138 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:05:15,138 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:05:15,138 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:14" (3/4) ... [2018-11-23 00:05:15,141 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 00:05:15,142 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:05:15,142 INFO L168 Benchmark]: Toolchain (without parser) took 1086.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 961.9 MB in the beginning and 1.0 GB in the end (delta: -87.7 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:05:15,144 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:05:15,144 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.45 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:05:15,144 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:05:15,145 INFO L168 Benchmark]: Boogie Preprocessor took 32.31 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 00:05:15,145 INFO L168 Benchmark]: RCFGBuilder took 400.23 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: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:05:15,146 INFO L168 Benchmark]: TraceAbstraction took 373.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 11.5 GB. [2018-11-23 00:05:15,146 INFO L168 Benchmark]: Witness Printer took 4.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:05:15,149 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 219.45 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 400.23 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: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 373.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 175]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 44, overapproximation of someUnaryDOUBLEoperation at line 170, overapproximation of bitwiseAnd at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 16, overapproximation of bitwiseXor at line 40. Possible FailurePath: [L18-L21] static const double one_fmod = 1.0, Zero_fmod[] = { 0.0, -0.0, }; VAL [\old(one_fmod)=6442450961, \old(Zero_fmod)=6442450958, \old(Zero_fmod)=6442450953, one_fmod=1, Zero_fmod={6442450957:0}] [L169] double x = __VERIFIER_nondet_double(); [L170] double y = -0.0; VAL [one_fmod=1, x=6442450948, Zero_fmod={6442450957:0}] [L171] CALL, EXPR fmod_double(x, y) VAL [\old(x)=6442450948, \old(y)=6442450959, one_fmod=1, Zero_fmod={6442450957:0}] [L24] __int32_t n, hx, hy, hz, ix, iy, sx, i; [L25] __uint32_t lx, ly, lz; VAL [\old(x)=6442450948, \old(y)=6442450959, one_fmod=1, x=6442450948, y=6442450959, Zero_fmod={6442450957:0}] [L28] ieee_double_shape_type ew_u; [L29] ew_u.value = (x) [L30] EXPR ew_u.parts.msw [L30] (hx) = ew_u.parts.msw [L31] EXPR ew_u.parts.lsw [L31] (lx) = ew_u.parts.lsw [L34] ieee_double_shape_type ew_u; [L35] ew_u.value = (y) [L36] EXPR ew_u.parts.msw [L36] (hy) = ew_u.parts.msw [L37] EXPR ew_u.parts.lsw [L37] (ly) = ew_u.parts.lsw [L39] sx = hx & 0x80000000 [L40] hx ^= sx [L41] hy &= 0x7fffffff VAL [\old(x)=6442450948, \old(y)=6442450959, lx=6442450960, ly=6442450952, one_fmod=1, sx=0, x=6442450948, y=6442450959, Zero_fmod={6442450957:0}] [L43-L44] COND TRUE (hy | ly) == 0 || (hx >= 0x7ff00000) || ((hy | ((ly | -ly) >> 31)) > 0x7ff00000) [L45] return (x * y) / (x * y); VAL [\old(x)=6442450948, \old(y)=6442450959, hx=2146435072, lx=6442450960, ly=6442450952, one_fmod=1, sx=0, x=6442450948, y=6442450959, Zero_fmod={6442450957:0}] [L171] RET, EXPR fmod_double(x, y) VAL [fmod_double(x, y)=6442450950, one_fmod=1, x=6442450948, y=6442450959, Zero_fmod={6442450957:0}] [L171] double res = fmod_double(x, y); [L174] CALL, EXPR isnan_double(res) VAL [\old(x)=6442450950, one_fmod=1, Zero_fmod={6442450957:0}] [L16] return x != x; VAL [\old(x)=6442450950, \result=0, one_fmod=1, x=6442450950, Zero_fmod={6442450957:0}] [L174] RET, EXPR isnan_double(res) VAL [isnan_double(res)=0, one_fmod=1, res=6442450950, x=6442450948, y=6442450959, Zero_fmod={6442450957:0}] [L174] COND TRUE !isnan_double(res) [L175] __VERIFIER_error() VAL [one_fmod=1, res=6442450950, x=6442450948, y=6442450959, Zero_fmod={6442450957:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 68 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 94 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=68occurred 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, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 441 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 00:05:16,568 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:05:16,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:05:16,576 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:05:16,577 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:05:16,577 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:05:16,578 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:05:16,579 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:05:16,580 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:05:16,581 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:05:16,581 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:05:16,582 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:05:16,582 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:05:16,583 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:05:16,584 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:05:16,585 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:05:16,585 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:05:16,586 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:05:16,588 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:05:16,589 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:05:16,590 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:05:16,590 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:05:16,593 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:05:16,593 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:05:16,593 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:05:16,594 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:05:16,594 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:05:16,595 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:05:16,595 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:05:16,596 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:05:16,596 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:05:16,597 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:05:16,597 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:05:16,597 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:05:16,598 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:05:16,598 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:05:16,598 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 00:05:16,610 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:05:16,610 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:05:16,611 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:05:16,611 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:05:16,611 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 00:05:16,611 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 00:05:16,611 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 00:05:16,611 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 00:05:16,611 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 00:05:16,611 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 00:05:16,612 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:05:16,612 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:05:16,612 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:05:16,612 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:05:16,612 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:05:16,612 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:05:16,612 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:05:16,613 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 00:05:16,613 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 00:05:16,613 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:05:16,613 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:05:16,613 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:05:16,613 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:05:16,613 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:05:16,613 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:05:16,613 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:05:16,614 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:05:16,614 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:05:16,614 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:05:16,614 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:05:16,614 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:05:16,614 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 00:05:16,614 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:05:16,614 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 00:05:16,614 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 00:05:16,614 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_38ab8606-b5aa-47f1-8ebe-a000915a39a9/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 -> 1c6c05365b181d4eacf1f0a2b19f094d722c4a6a [2018-11-23 00:05:16,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:05:16,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:05:16,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:05:16,655 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:05:16,655 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:05:16,656 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1121b_true-unreach-call.c [2018-11-23 00:05:16,691 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/data/2f7eff681/903f47c8e7f24166afba2164ee2631c3/FLAG01f2bd7df [2018-11-23 00:05:17,006 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:05:17,007 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/sv-benchmarks/c/float-newlib/double_req_bl_1121b_true-unreach-call.c [2018-11-23 00:05:17,012 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/data/2f7eff681/903f47c8e7f24166afba2164ee2631c3/FLAG01f2bd7df [2018-11-23 00:05:17,020 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/data/2f7eff681/903f47c8e7f24166afba2164ee2631c3 [2018-11-23 00:05:17,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:05:17,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:05:17,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:05:17,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:05:17,026 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:05:17,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:17" (1/1) ... [2018-11-23 00:05:17,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d6a5f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17, skipping insertion in model container [2018-11-23 00:05:17,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:17" (1/1) ... [2018-11-23 00:05:17,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:05:17,056 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:05:17,222 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:05:17,227 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:05:17,262 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:05:17,278 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:05:17,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17 WrapperNode [2018-11-23 00:05:17,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:05:17,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:05:17,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:05:17,279 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:05:17,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 00:05:17,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 00:05:17,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:05:17,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:05:17,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:05:17,340 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:05:17,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 00:05:17,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 00:05:17,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 00:05:17,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 00:05:17,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 00:05:17,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 00:05:17,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 00:05:17,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:05:17,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:05:17,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:05:17,379 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:05:17,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/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 00:05:17,412 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 00:05:17,412 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 00:05:17,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 00:05:17,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 00:05:17,412 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:05:17,413 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:05:17,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:05:17,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:05:17,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2018-11-23 00:05:17,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:05:17,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 00:05:17,413 INFO L130 BoogieDeclarations]: Found specification of procedure fmod_double [2018-11-23 00:05:17,414 INFO L138 BoogieDeclarations]: Found implementation of procedure fmod_double [2018-11-23 00:05:17,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:05:17,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:05:17,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 00:05:17,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:05:17,516 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:05:17,571 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:05:17,610 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:05:20,412 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:05:20,412 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 00:05:20,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:20 BoogieIcfgContainer [2018-11-23 00:05:20,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:05:20,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:05:20,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:05:20,416 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:05:20,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:05:17" (1/3) ... [2018-11-23 00:05:20,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f8d659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:20, skipping insertion in model container [2018-11-23 00:05:20,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (2/3) ... [2018-11-23 00:05:20,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f8d659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:20, skipping insertion in model container [2018-11-23 00:05:20,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:20" (3/3) ... [2018-11-23 00:05:20,419 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1121b_true-unreach-call.c [2018-11-23 00:05:20,425 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:05:20,430 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:05:20,439 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:05:20,459 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:05:20,459 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:05:20,460 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:05:20,460 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:05:20,460 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:05:20,460 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:05:20,460 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:05:20,460 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:05:20,460 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:05:20,471 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2018-11-23 00:05:20,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 00:05:20,475 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:05:20,476 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] [2018-11-23 00:05:20,477 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:05:20,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:05:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash 976306344, now seen corresponding path program 1 times [2018-11-23 00:05:20,483 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:05:20,483 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/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 00:05:20,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:05:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:05:21,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:05:21,266 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 00:05:21,267 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:05:21,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:05:21,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:05:21,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 00:05:21,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 00:05:21,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 00:05:21,296 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 2 states. [2018-11-23 00:05:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:05:21,315 INFO L93 Difference]: Finished difference Result 126 states and 208 transitions. [2018-11-23 00:05:21,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 00:05:21,316 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 00:05:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:05:21,325 INFO L225 Difference]: With dead ends: 126 [2018-11-23 00:05:21,325 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 00:05:21,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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 00:05:21,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 00:05:21,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-23 00:05:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 00:05:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2018-11-23 00:05:21,356 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 21 [2018-11-23 00:05:21,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:05:21,356 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2018-11-23 00:05:21,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 00:05:21,356 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2018-11-23 00:05:21,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 00:05:21,357 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:05:21,357 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] [2018-11-23 00:05:21,357 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:05:21,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:05:21,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2037518261, now seen corresponding path program 1 times [2018-11-23 00:05:21,358 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:05:21,358 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/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 00:05:21,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:05:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:05:22,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:05:25,267 WARN L832 $PredicateComparison]: unable to prove that (exists ((fmod_double_~x (_ FloatingPoint 11 53))) (= (let ((.cse0 (fp.mul roundNearestTiesToEven fmod_double_~x |c_fmod_double_#in~y|))) (fp.div roundNearestTiesToEven .cse0 .cse0)) |c_fmod_double_#res|)) is different from false [2018-11-23 00:05:30,658 WARN L854 $PredicateComparison]: unable to prove that (exists ((fmod_double_~x (_ FloatingPoint 11 53))) (= (let ((.cse0 (fp.mul roundNearestTiesToEven fmod_double_~x (fp.neg (_ +zero 11 53))))) (fp.div roundNearestTiesToEven .cse0 .cse0)) |c_main_#t~ret17|)) is different from true [2018-11-23 00:05:42,756 WARN L180 SmtUtils]: Spent 3.19 s on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 00:05:50,716 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 00:05:50,717 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:05:50,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:05:50,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 00:05:50,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 00:05:50,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 00:05:50,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=32, Unknown=3, NotChecked=22, Total=72 [2018-11-23 00:05:50,735 INFO L87 Difference]: Start difference. First operand 63 states and 89 transitions. Second operand 9 states. [2018-11-23 00:06:15,868 WARN L180 SmtUtils]: Spent 8.42 s on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 00:06:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:06:19,494 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2018-11-23 00:06:19,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 00:06:19,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 00:06:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:06:19,496 INFO L225 Difference]: With dead ends: 70 [2018-11-23 00:06:19,496 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 00:06:19,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=19, Invalid=42, Unknown=3, NotChecked=26, Total=90 [2018-11-23 00:06:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 00:06:19,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-23 00:06:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 00:06:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2018-11-23 00:06:19,505 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 23 [2018-11-23 00:06:19,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:06:19,505 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2018-11-23 00:06:19,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 00:06:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2018-11-23 00:06:19,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 00:06:19,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:06:19,507 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] [2018-11-23 00:06:19,507 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:06:19,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:06:19,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1706768295, now seen corresponding path program 1 times [2018-11-23 00:06:19,508 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:06:19,508 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/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 00:06:19,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:06:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:06:19,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:06:19,667 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:06:19,669 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:06:19,669 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:06:19,670 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:06:19,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2018-11-23 00:06:19,790 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:06:19,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-11-23 00:06:19,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:19,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 00:06:19,826 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:19,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-23 00:06:19,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 00:06:19,875 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:19,879 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:19,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:19,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 00:06:19,902 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:71, output treesize:23 [2018-11-23 00:06:20,029 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 00:06:20,029 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:06:20,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:06:20,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 00:06:20,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 00:06:20,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:06:20,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:06:20,044 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand 7 states. [2018-11-23 00:06:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:06:23,434 INFO L93 Difference]: Finished difference Result 65 states and 90 transitions. [2018-11-23 00:06:23,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 00:06:23,436 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 00:06:23,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:06:23,437 INFO L225 Difference]: With dead ends: 65 [2018-11-23 00:06:23,437 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 00:06:23,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 00:06:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 00:06:23,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 00:06:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 00:06:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 00:06:23,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-11-23 00:06:23,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:06:23,438 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:06:23,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 00:06:23,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 00:06:23,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 00:06:23,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 00:06:26,634 WARN L180 SmtUtils]: Spent 3.02 s on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 00:06:26,739 INFO L451 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 16) the Hoare annotation is: true [2018-11-23 00:06:26,739 INFO L448 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 16) no Hoare annotation was computed. [2018-11-23 00:06:26,739 INFO L448 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 16) no Hoare annotation was computed. [2018-11-23 00:06:26,739 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 00:06:26,739 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 00:06:26,740 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 00:06:26,740 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 119) no Hoare annotation was computed. [2018-11-23 00:06:26,740 INFO L448 ceAbstractionStarter]: For program point L118-2(lines 23 161) no Hoare annotation was computed. [2018-11-23 00:06:26,740 INFO L448 ceAbstractionStarter]: For program point L69-2(lines 69 70) no Hoare annotation was computed. [2018-11-23 00:06:26,740 INFO L444 ceAbstractionStarter]: At program point L69-3(lines 69 70) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_prenex_11 (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) v_prenex_11))) (and (not (= (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_4|)) .cse0) (_ bv0 32))) (= |fmod_double_#in~y| (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= .cse0 ((_ extract 31 0) |v_q#valueAsBitvector_4|))))) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_prenex_11 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) v_prenex_11))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_4|)) fmod_double_~hy~0) (= fmod_double_~ly~0 .cse1) (= |fmod_double_#in~y| (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= .cse1 ((_ extract 31 0) |v_q#valueAsBitvector_4|))))) (= |fmod_double_#in~y| fmod_double_~y)) [2018-11-23 00:06:26,740 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 157) no Hoare annotation was computed. [2018-11-23 00:06:26,740 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 140 159) no Hoare annotation was computed. [2018-11-23 00:06:26,740 INFO L448 ceAbstractionStarter]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2018-11-23 00:06:26,741 INFO L448 ceAbstractionStarter]: For program point L53(lines 23 161) no Hoare annotation was computed. [2018-11-23 00:06:26,741 INFO L448 ceAbstractionStarter]: For program point fmod_doubleFINAL(lines 23 161) no Hoare annotation was computed. [2018-11-23 00:06:26,741 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 161) no Hoare annotation was computed. [2018-11-23 00:06:26,741 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 60) no Hoare annotation was computed. [2018-11-23 00:06:26,741 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 105) no Hoare annotation was computed. [2018-11-23 00:06:26,741 INFO L448 ceAbstractionStarter]: For program point L104-2(lines 101 115) no Hoare annotation was computed. [2018-11-23 00:06:26,741 INFO L448 ceAbstractionStarter]: For program point L55-2(lines 55 56) no Hoare annotation was computed. [2018-11-23 00:06:26,741 INFO L444 ceAbstractionStarter]: At program point L55-3(lines 55 56) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_prenex_11 (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) v_prenex_11))) (and (not (= (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_4|)) .cse0) (_ bv0 32))) (= |fmod_double_#in~y| (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= .cse0 ((_ extract 31 0) |v_q#valueAsBitvector_4|))))) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_prenex_11 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) v_prenex_11))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_4|)) fmod_double_~hy~0) (= fmod_double_~ly~0 .cse1) (= |fmod_double_#in~y| (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= .cse1 ((_ extract 31 0) |v_q#valueAsBitvector_4|))))) (= |fmod_double_#in~y| fmod_double_~y)) [2018-11-23 00:06:26,742 INFO L444 ceAbstractionStarter]: At program point L106-1(lines 101 115) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_prenex_11 (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) v_prenex_11))) (and (not (= (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_4|)) .cse0) (_ bv0 32))) (= |fmod_double_#in~y| (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= .cse0 ((_ extract 31 0) |v_q#valueAsBitvector_4|))))) (= |fmod_double_#in~y| fmod_double_~y)) [2018-11-23 00:06:26,742 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 97) no Hoare annotation was computed. [2018-11-23 00:06:26,742 INFO L448 ceAbstractionStarter]: For program point L91-2(lines 87 98) no Hoare annotation was computed. [2018-11-23 00:06:26,742 INFO L448 ceAbstractionStarter]: For program point L58-2(lines 58 59) no Hoare annotation was computed. [2018-11-23 00:06:26,742 INFO L444 ceAbstractionStarter]: At program point L58-3(lines 58 59) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_prenex_11 (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) v_prenex_11))) (and (not (= (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_4|)) .cse0) (_ bv0 32))) (= |fmod_double_#in~y| (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= .cse0 ((_ extract 31 0) |v_q#valueAsBitvector_4|))))) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_prenex_11 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) v_prenex_11))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_4|)) fmod_double_~hy~0) (= fmod_double_~ly~0 .cse1) (= |fmod_double_#in~y| (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= .cse1 ((_ extract 31 0) |v_q#valueAsBitvector_4|))))) (= |fmod_double_#in~y| fmod_double_~y)) [2018-11-23 00:06:26,742 INFO L451 ceAbstractionStarter]: At program point fmod_doubleENTRY(lines 23 161) the Hoare annotation is: true [2018-11-23 00:06:26,742 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 151) no Hoare annotation was computed. [2018-11-23 00:06:26,742 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 45) no Hoare annotation was computed. [2018-11-23 00:06:26,743 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 27 32) no Hoare annotation was computed. [2018-11-23 00:06:26,743 INFO L444 ceAbstractionStarter]: At program point L27-2(lines 27 32) the Hoare annotation is: (= |fmod_double_#in~y| fmod_double_~y) [2018-11-23 00:06:26,743 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 111) no Hoare annotation was computed. [2018-11-23 00:06:26,743 INFO L444 ceAbstractionStarter]: At program point L127-2(lines 127 131) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_prenex_11 (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) v_prenex_11))) (and (not (= (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_4|)) .cse0) (_ bv0 32))) (= |fmod_double_#in~y| (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= .cse0 ((_ extract 31 0) |v_q#valueAsBitvector_4|))))) (= |fmod_double_#in~y| fmod_double_~y)) [2018-11-23 00:06:26,743 INFO L448 ceAbstractionStarter]: For program point L127-3(lines 23 161) no Hoare annotation was computed. [2018-11-23 00:06:26,743 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 151) no Hoare annotation was computed. [2018-11-23 00:06:26,743 INFO L448 ceAbstractionStarter]: For program point L79(lines 79 85) no Hoare annotation was computed. [2018-11-23 00:06:26,743 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 51) no Hoare annotation was computed. [2018-11-23 00:06:26,743 INFO L448 ceAbstractionStarter]: For program point L79-2(lines 23 161) no Hoare annotation was computed. [2018-11-23 00:06:26,744 INFO L448 ceAbstractionStarter]: For program point L46-2(lines 23 161) no Hoare annotation was computed. [2018-11-23 00:06:26,744 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 48) no Hoare annotation was computed. [2018-11-23 00:06:26,744 INFO L448 ceAbstractionStarter]: For program point L64(lines 23 161) no Hoare annotation was computed. [2018-11-23 00:06:26,744 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 71) no Hoare annotation was computed. [2018-11-23 00:06:26,744 INFO L448 ceAbstractionStarter]: For program point fmod_doubleEXIT(lines 23 161) no Hoare annotation was computed. [2018-11-23 00:06:26,744 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 50) no Hoare annotation was computed. [2018-11-23 00:06:26,744 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 159) no Hoare annotation was computed. [2018-11-23 00:06:26,744 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2018-11-23 00:06:26,744 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 161) no Hoare annotation was computed. [2018-11-23 00:06:26,744 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 66 67) no Hoare annotation was computed. [2018-11-23 00:06:26,744 INFO L448 ceAbstractionStarter]: For program point L33-2(lines 33 38) no Hoare annotation was computed. [2018-11-23 00:06:26,745 INFO L444 ceAbstractionStarter]: At program point L66-3(lines 66 67) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_prenex_11 (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) v_prenex_11))) (and (not (= (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_4|)) .cse0) (_ bv0 32))) (= |fmod_double_#in~y| (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= .cse0 ((_ extract 31 0) |v_q#valueAsBitvector_4|))))) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_prenex_11 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) v_prenex_11))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_4|)) fmod_double_~hy~0) (= fmod_double_~ly~0 .cse1) (= |fmod_double_#in~y| (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= .cse1 ((_ extract 31 0) |v_q#valueAsBitvector_4|))))) (= |fmod_double_#in~y| fmod_double_~y)) [2018-11-23 00:06:26,745 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 134 139) no Hoare annotation was computed. [2018-11-23 00:06:26,745 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 101 115) no Hoare annotation was computed. [2018-11-23 00:06:26,745 INFO L444 ceAbstractionStarter]: At program point L134-2(lines 134 139) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_prenex_11 (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) v_prenex_11))) (and (not (= (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_4|)) .cse0) (_ bv0 32))) (= |fmod_double_#in~y| (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= .cse0 ((_ extract 31 0) |v_q#valueAsBitvector_4|))))) (= |fmod_double_#in~y| fmod_double_~y)) [2018-11-23 00:06:26,745 INFO L448 ceAbstractionStarter]: For program point L101-3(lines 101 115) no Hoare annotation was computed. [2018-11-23 00:06:26,745 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 00:06:26,745 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 00:06:26,745 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 00:06:26,746 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 00:06:26,746 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-23 00:06:26,746 INFO L444 ceAbstractionStarter]: At program point L174(line 174) the Hoare annotation is: (exists ((fmod_double_~x (_ FloatingPoint 11 53))) (= (let ((.cse0 (fp.mul roundNearestTiesToEven fmod_double_~x (fp.neg (_ +zero 11 53))))) (fp.div roundNearestTiesToEven .cse0 .cse0)) main_~res~0)) [2018-11-23 00:06:26,746 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 163 180) the Hoare annotation is: true [2018-11-23 00:06:26,746 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 174 177) no Hoare annotation was computed. [2018-11-23 00:06:26,746 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 163 180) no Hoare annotation was computed. [2018-11-23 00:06:26,746 INFO L444 ceAbstractionStarter]: At program point L171(line 171) the Hoare annotation is: (= main_~y~0 (fp.neg (_ +zero 11 53))) [2018-11-23 00:06:26,746 INFO L448 ceAbstractionStarter]: For program point L171-1(line 171) no Hoare annotation was computed. [2018-11-23 00:06:26,746 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 163 180) no Hoare annotation was computed. [2018-11-23 00:06:26,747 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-11-23 00:06:26,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,753 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,765 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,771 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,772 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,773 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,779 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,779 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,779 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,779 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,779 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:06:26 BoogieIcfgContainer [2018-11-23 00:06:26,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:06:26,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:06:26,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:06:26,788 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:06:26,789 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:20" (3/4) ... [2018-11-23 00:06:26,791 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 00:06:26,795 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_double [2018-11-23 00:06:26,795 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 00:06:26,795 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fmod_double [2018-11-23 00:06:26,796 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 00:06:26,800 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-11-23 00:06:26,800 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-23 00:06:26,800 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 00:06:26,800 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 00:06:26,817 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(y) == y [2018-11-23 00:06:26,826 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_38ab8606-b5aa-47f1-8ebe-a000915a39a9/bin-2019/utaipan/witness.graphml [2018-11-23 00:06:26,826 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:06:26,827 INFO L168 Benchmark]: Toolchain (without parser) took 69804.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 950.8 MB in the beginning and 923.5 MB in the end (delta: 27.4 MB). Peak memory consumption was 163.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:06:26,827 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:06:26,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.51 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:06:26,828 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:06:26,828 INFO L168 Benchmark]: Boogie Preprocessor took 38.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:06:26,829 INFO L168 Benchmark]: RCFGBuilder took 3034.36 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.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:06:26,829 INFO L168 Benchmark]: TraceAbstraction took 66374.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 930.3 MB in the end (delta: 152.8 MB). Peak memory consumption was 152.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:06:26,829 INFO L168 Benchmark]: Witness Printer took 38.58 ms. Allocated memory is still 1.2 GB. Free memory was 930.3 MB in the beginning and 923.5 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-23 00:06:26,831 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.51 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3034.36 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.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 66374.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 930.3 MB in the end (delta: 152.8 MB). Peak memory consumption was 152.8 MB. Max. memory is 11.5 GB. * Witness Printer took 38.58 ms. Allocated memory is still 1.2 GB. Free memory was 930.3 MB in the beginning and 923.5 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 58]: Loop Invariant [2018-11-23 00:06:26,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,839 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,843 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: ((\exists v_q#valueAsBitvector_4 : bv64, v_prenex_11 : bv64 :: (!(~bvor32(~bvand32(2147483647bv32, v_q#valueAsBitvector_4[63:32]), v_prenex_11[31:0]) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && v_prenex_11[31:0] == v_q#valueAsBitvector_4[31:0]) && (\exists v_q#valueAsBitvector_4 : bv64, v_prenex_11 : bv64 :: ((~bvand32(2147483647bv32, v_q#valueAsBitvector_4[63:32]) == hy && ly == v_prenex_11[31:0]) && \old(y) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && v_prenex_11[31:0] == v_q#valueAsBitvector_4[31:0])) && \old(y) == y - InvariantResult [Line: 69]: Loop Invariant [2018-11-23 00:06:26,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: ((\exists v_q#valueAsBitvector_4 : bv64, v_prenex_11 : bv64 :: (!(~bvor32(~bvand32(2147483647bv32, v_q#valueAsBitvector_4[63:32]), v_prenex_11[31:0]) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && v_prenex_11[31:0] == v_q#valueAsBitvector_4[31:0]) && (\exists v_q#valueAsBitvector_4 : bv64, v_prenex_11 : bv64 :: ((~bvand32(2147483647bv32, v_q#valueAsBitvector_4[63:32]) == hy && ly == v_prenex_11[31:0]) && \old(y) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && v_prenex_11[31:0] == v_q#valueAsBitvector_4[31:0])) && \old(y) == y - InvariantResult [Line: 127]: Loop Invariant [2018-11-23 00:06:26,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,850 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: (\exists v_q#valueAsBitvector_4 : bv64, v_prenex_11 : bv64 :: (!(~bvor32(~bvand32(2147483647bv32, v_q#valueAsBitvector_4[63:32]), v_prenex_11[31:0]) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && v_prenex_11[31:0] == v_q#valueAsBitvector_4[31:0]) && \old(y) == y - InvariantResult [Line: 55]: Loop Invariant [2018-11-23 00:06:26,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,855 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: ((\exists v_q#valueAsBitvector_4 : bv64, v_prenex_11 : bv64 :: (!(~bvor32(~bvand32(2147483647bv32, v_q#valueAsBitvector_4[63:32]), v_prenex_11[31:0]) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && v_prenex_11[31:0] == v_q#valueAsBitvector_4[31:0]) && (\exists v_q#valueAsBitvector_4 : bv64, v_prenex_11 : bv64 :: ((~bvand32(2147483647bv32, v_q#valueAsBitvector_4[63:32]) == hy && ly == v_prenex_11[31:0]) && \old(y) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && v_prenex_11[31:0] == v_q#valueAsBitvector_4[31:0])) && \old(y) == y - InvariantResult [Line: 134]: Loop Invariant [2018-11-23 00:06:26,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: (\exists v_q#valueAsBitvector_4 : bv64, v_prenex_11 : bv64 :: (!(~bvor32(~bvand32(2147483647bv32, v_q#valueAsBitvector_4[63:32]), v_prenex_11[31:0]) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && v_prenex_11[31:0] == v_q#valueAsBitvector_4[31:0]) && \old(y) == y - InvariantResult [Line: 66]: Loop Invariant [2018-11-23 00:06:26,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,860 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: ((\exists v_q#valueAsBitvector_4 : bv64, v_prenex_11 : bv64 :: (!(~bvor32(~bvand32(2147483647bv32, v_q#valueAsBitvector_4[63:32]), v_prenex_11[31:0]) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && v_prenex_11[31:0] == v_q#valueAsBitvector_4[31:0]) && (\exists v_q#valueAsBitvector_4 : bv64, v_prenex_11 : bv64 :: ((~bvand32(2147483647bv32, v_q#valueAsBitvector_4[63:32]) == hy && ly == v_prenex_11[31:0]) && \old(y) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && v_prenex_11[31:0] == v_q#valueAsBitvector_4[31:0])) && \old(y) == y - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: \old(y) == y - InvariantResult [Line: 101]: Loop Invariant [2018-11-23 00:06:26,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-11-23 00:06:26,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-11-23 00:06:26,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: (\exists v_q#valueAsBitvector_4 : bv64, v_prenex_11 : bv64 :: (!(~bvor32(~bvand32(2147483647bv32, v_q#valueAsBitvector_4[63:32]), v_prenex_11[31:0]) == 0bv32) && \old(y) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && v_prenex_11[31:0] == v_q#valueAsBitvector_4[31:0]) && \old(y) == y - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 67 locations, 1 error locations. SAFE Result, 66.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 32.1s AutomataDifference, 0.0s DeadEndRemovalTime, 3.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 243 SDtfs, 230 SDslu, 522 SDs, 0 SdLazy, 97 SolverSat, 7 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 40.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 18 PreInvPairs, 27 NumberOfFragments, 342 HoareAnnotationTreeSize, 18 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 28.3s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 66 ConstructedInterpolants, 11 QuantifiedInterpolants, 8046 SizeOfPredicates, 9 NumberOfNonLiveVariables, 269 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...