./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1211b_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_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1211b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/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 206a1fa9646ae2b913e15c72bee749b0ae7b465a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1211b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/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 206a1fa9646ae2b913e15c72bee749b0ae7b465a .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:41:10,243 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:41:10,244 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:41:10,250 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:41:10,250 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:41:10,251 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:41:10,252 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:41:10,253 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:41:10,254 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:41:10,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:41:10,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:41:10,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:41:10,256 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:41:10,256 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:41:10,257 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:41:10,257 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:41:10,258 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:41:10,259 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:41:10,260 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:41:10,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:41:10,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:41:10,262 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:41:10,264 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:41:10,264 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:41:10,264 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:41:10,264 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:41:10,265 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:41:10,265 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:41:10,266 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:41:10,266 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:41:10,266 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:41:10,267 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:41:10,267 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:41:10,267 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:41:10,267 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:41:10,268 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:41:10,268 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 09:41:10,278 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:41:10,278 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:41:10,278 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:41:10,279 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:41:10,279 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 09:41:10,279 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 09:41:10,279 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 09:41:10,279 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 09:41:10,279 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 09:41:10,279 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 09:41:10,280 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 09:41:10,280 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 09:41:10,280 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 09:41:10,280 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:41:10,280 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:41:10,281 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:41:10,281 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:41:10,281 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:41:10,281 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:41:10,281 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:41:10,281 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:41:10,281 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:41:10,281 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:41:10,282 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:41:10,282 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:41:10,282 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:41:10,282 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:41:10,282 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:41:10,282 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:41:10,282 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:41:10,283 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:41:10,283 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:41:10,283 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:41:10,283 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 09:41:10,283 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:41:10,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 09:41:10,283 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:41:10,283 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_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/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 -> 206a1fa9646ae2b913e15c72bee749b0ae7b465a [2018-11-23 09:41:10,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:41:10,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:41:10,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:41:10,319 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:41:10,320 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:41:10,320 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1211b_true-unreach-call.c [2018-11-23 09:41:10,357 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/data/9dc55d210/fba178427a4d4fe6bd0f70ff29713372/FLAGa546934b3 [2018-11-23 09:41:10,779 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:41:10,780 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/sv-benchmarks/c/float-newlib/float_req_bl_1211b_true-unreach-call.c [2018-11-23 09:41:10,786 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/data/9dc55d210/fba178427a4d4fe6bd0f70ff29713372/FLAGa546934b3 [2018-11-23 09:41:10,795 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/data/9dc55d210/fba178427a4d4fe6bd0f70ff29713372 [2018-11-23 09:41:10,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:41:10,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:41:10,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:41:10,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:41:10,801 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:41:10,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:41:10" (1/1) ... [2018-11-23 09:41:10,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294ae5d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:10, skipping insertion in model container [2018-11-23 09:41:10,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:41:10" (1/1) ... [2018-11-23 09:41:10,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:41:10,825 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:41:10,953 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:41:10,961 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:41:10,984 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:41:10,994 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:41:10,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:10 WrapperNode [2018-11-23 09:41:10,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:41:10,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:41:10,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:41:10,995 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:41:11,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:10" (1/1) ... [2018-11-23 09:41:11,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:10" (1/1) ... [2018-11-23 09:41:11,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:41:11,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:41:11,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:41:11,048 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:41:11,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:10" (1/1) ... [2018-11-23 09:41:11,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:10" (1/1) ... [2018-11-23 09:41:11,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:10" (1/1) ... [2018-11-23 09:41:11,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:10" (1/1) ... [2018-11-23 09:41:11,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:10" (1/1) ... [2018-11-23 09:41:11,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:10" (1/1) ... [2018-11-23 09:41:11,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:10" (1/1) ... [2018-11-23 09:41:11,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:41:11,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:41:11,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:41:11,074 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:41:11,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/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 09:41:11,106 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:41:11,106 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:41:11,106 INFO L130 BoogieDeclarations]: Found specification of procedure modf_float [2018-11-23 09:41:11,106 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_float [2018-11-23 09:41:11,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 09:41:11,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 09:41:11,107 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-11-23 09:41:11,107 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-11-23 09:41:11,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:41:11,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:41:11,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 09:41:11,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:41:11,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:41:11,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:41:11,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2018-11-23 09:41:11,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 09:41:11,108 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-11-23 09:41:11,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-11-23 09:41:11,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:41:11,374 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:41:11,374 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-23 09:41:11,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:41:11 BoogieIcfgContainer [2018-11-23 09:41:11,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:41:11,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:41:11,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:41:11,378 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:41:11,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:41:10" (1/3) ... [2018-11-23 09:41:11,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674bb454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:41:11, skipping insertion in model container [2018-11-23 09:41:11,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:10" (2/3) ... [2018-11-23 09:41:11,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674bb454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:41:11, skipping insertion in model container [2018-11-23 09:41:11,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:41:11" (3/3) ... [2018-11-23 09:41:11,381 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1211b_true-unreach-call.c [2018-11-23 09:41:11,389 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:41:11,395 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:41:11,408 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:41:11,428 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:41:11,428 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:41:11,428 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:41:11,428 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:41:11,428 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:41:11,428 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:41:11,428 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:41:11,428 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:41:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-23 09:41:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 09:41:11,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:41:11,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:41:11,445 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:41:11,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:41:11,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1328912444, now seen corresponding path program 1 times [2018-11-23 09:41:11,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:41:11,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:41:11,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:41:11,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:41:11,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:41:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:41:11,544 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 09:41:11,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:41:11,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:41:11,546 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:41:11,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:41:11,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:41:11,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:41:11,564 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-11-23 09:41:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:41:11,583 INFO L93 Difference]: Finished difference Result 110 states and 158 transitions. [2018-11-23 09:41:11,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:41:11,584 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 09:41:11,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:41:11,591 INFO L225 Difference]: With dead ends: 110 [2018-11-23 09:41:11,592 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 09:41:11,594 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 09:41:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 09:41:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 09:41:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 09:41:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-23 09:41:11,621 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 27 [2018-11-23 09:41:11,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:41:11,621 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-23 09:41:11,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:41:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 09:41:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 09:41:11,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:41:11,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:41:11,622 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:41:11,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:41:11,622 INFO L82 PathProgramCache]: Analyzing trace with hash -2017954314, now seen corresponding path program 1 times [2018-11-23 09:41:11,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:41:11,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:41:11,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:41:11,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:41:11,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:41:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:41:11,679 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 09:41:11,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:41:11,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:41:11,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:41:11,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:41:11,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:41:11,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:41:11,681 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 3 states. [2018-11-23 09:41:11,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:41:11,697 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-23 09:41:11,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:41:11,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 09:41:11,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:41:11,698 INFO L225 Difference]: With dead ends: 58 [2018-11-23 09:41:11,698 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 09:41:11,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:41:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 09:41:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 09:41:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 09:41:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-11-23 09:41:11,702 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 30 [2018-11-23 09:41:11,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:41:11,703 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-11-23 09:41:11,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:41:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-11-23 09:41:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 09:41:11,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:41:11,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:41:11,704 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:41:11,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:41:11,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2060718957, now seen corresponding path program 1 times [2018-11-23 09:41:11,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:41:11,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:41:11,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:41:11,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:41:11,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:41:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:41:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:41:11,768 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=11, |#NULL.offset|=6, |old(#NULL.base)|=11, |old(#NULL.offset)|=6, |old(~one_modf~0)|=9.0, ~one_modf~0=9.0] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~one_modf~0 := 1.0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=11, |old(#NULL.offset)|=6, |old(~one_modf~0)|=9.0, ~one_modf~0=1.0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=11, |old(#NULL.offset)|=6, |old(~one_modf~0)|=9.0, ~one_modf~0=1.0] [?] RET #170#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_modf~0=1.0] [?] CALL call #t~ret24 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_modf~0=1.0] [?] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.alloc(4);call write~init~real(#t~nondet17, ~#iptr~0.base, ~#iptr~0.offset, 4);havoc #t~nondet17; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] CALL call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~j0~0;havoc ~i~0; VAL [modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] goto; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] assume ~j0~0 < 23; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~j0~0=(- 1), modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] assume ~j0~0 < 0; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~j0~0=(- 1), modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.alloc(4);call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4);call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4);call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4);havoc #t~mem2;call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset);havoc ~#sf_u~0.base, ~#sf_u~0.offset; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~j0~0=(- 1), modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] goto; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~j0~0=(- 1), modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, ~one_modf~0=1.0] [?] #res := ~x; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~j0~0=(- 1), modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, |modf_float_#res|=7.0, ~one_modf~0=1.0] [?] assume true; VAL [modf_float_~i0~0=5, modf_float_~iptr.base=21, modf_float_~iptr.offset=0, modf_float_~j0~0=(- 1), modf_float_~x=7.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_float_#in~iptr.base|=21, |modf_float_#in~iptr.offset|=0, |modf_float_#in~x|=7.0, |modf_float_#res|=7.0, ~one_modf~0=1.0] [?] RET #164#return; VAL [main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret18|=7.0, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] ~res~0 := #t~ret18;havoc #t~ret18;call #t~mem19 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); VAL [main_~res~0=7.0, main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem19|=19.0, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] CALL call #t~ret20 := isinf_float(#t~mem19); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=19.0, ~one_modf~0=1.0] [?] ~x := #in~x;havoc ~ix~2; VAL [isinf_float_~x=19.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=19.0, ~one_modf~0=1.0] [?] call ~#gf_u~4.base, ~#gf_u~4.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~4.base, ~#gf_u~4.offset, 4);call #t~mem15 := read~int(~#gf_u~4.base, ~#gf_u~4.offset, 4);~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union16, ~#gf_u~4.base, ~#gf_u~4.offset, 4);havoc #t~union16;havoc #t~mem15;call ULTIMATE.dealloc(~#gf_u~4.base, ~#gf_u~4.offset);havoc ~#gf_u~4.base, ~#gf_u~4.offset; VAL [isinf_float_~ix~2=2, isinf_float_~x=19.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=19.0, ~one_modf~0=1.0] [?] goto; VAL [isinf_float_~ix~2=2, isinf_float_~x=19.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=19.0, ~one_modf~0=1.0] [?] ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647);#res := (if 2139095040 == ~ix~2 then 1 else 0); VAL [isinf_float_~ix~2=2139095040, isinf_float_~x=19.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=19.0, |isinf_float_#res|=1, ~one_modf~0=1.0] [?] assume true; VAL [isinf_float_~ix~2=2139095040, isinf_float_~x=19.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_float_#in~x|=19.0, |isinf_float_#res|=1, ~one_modf~0=1.0] [?] RET #166#return; VAL [main_~res~0=7.0, main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem19|=19.0, |main_#t~ret20|=1, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647;#t~short23 := 0 != #t~ret20; VAL [main_~res~0=7.0, main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem19|=19.0, |main_#t~ret20|=1, |main_#t~short23|=true, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume #t~short23;#t~short22 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [main_~res~0=7.0, main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem19|=19.0, |main_#t~ret20|=1, |main_#t~short22|=false, |main_#t~short23|=true, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume !#t~short22; VAL [main_~res~0=7.0, main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem19|=19.0, |main_#t~ret20|=1, |main_#t~short22|=false, |main_#t~short23|=true, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] #t~short23 := !#t~short22; VAL [main_~res~0=7.0, main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem19|=19.0, |main_#t~ret20|=1, |main_#t~short22|=false, |main_#t~short23|=true, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume #t~short23;havoc #t~short22;havoc #t~ret20;havoc #t~mem19;havoc #t~ret21;havoc #t~short23; VAL [main_~res~0=7.0, main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume !false; VAL [main_~res~0=7.0, main_~x~0=7.0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#iptr~0.base|=21, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=11, #NULL.offset=6, old(#NULL.base)=11, old(#NULL.offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=9.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L12] ~one_modf~0 := 1.0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=1.0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret24 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L104] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); [L105] call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.alloc(4); [L105] call write~init~real(#t~nondet17, ~#iptr~0.base, ~#iptr~0.offset, 4); [L105] havoc #t~nondet17; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0] [L106] CALL call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L14-L71] ~x := #in~x; [L14-L71] ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; [L15] havoc ~i0~0; [L15] havoc ~j0~0; [L16] havoc ~i~0; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~iptr.base=21, ~iptr.offset=0, ~one_modf~0=1.0, ~x=7.0] [L18] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L19] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L18] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L18] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~one_modf~0=1.0, ~x=7.0] [L22] ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~one_modf~0=1.0, ~x=7.0] [L23-L70] assume ~j0~0 < 23; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L24-L55] assume ~j0~0 < 0; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L26] call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.alloc(4); [L27] call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4); [L28] call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4); [L28] call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4); [L28] havoc #t~mem2; [L26] call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset); [L26] havoc ~#sf_u~0.base, ~#sf_u~0.offset; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L30] #res := ~x; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, #res=7.0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L14-L71] ensures true; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, #res=7.0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L106] RET call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret18=7.0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~x~0=7.0] [L106] ~res~0 := #t~ret18; [L106] havoc #t~ret18; [L109] call #t~mem19 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] CALL call #t~ret20 := isinf_float(#t~mem19); VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L86-L95] ~x := #in~x; [L87] havoc ~ix~2; VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0, ~x=19.0] [L89] call ~#gf_u~4.base, ~#gf_u~4.offset := #Ultimate.alloc(4); [L90] call write~real(~x, ~#gf_u~4.base, ~#gf_u~4.offset, 4); [L91] call #t~mem15 := read~int(~#gf_u~4.base, ~#gf_u~4.offset, 4); [L91] ~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296); [L91] call write~real(#t~union16, ~#gf_u~4.base, ~#gf_u~4.offset, 4); [L91] havoc #t~union16; [L91] havoc #t~mem15; [L89] call ULTIMATE.dealloc(~#gf_u~4.base, ~#gf_u~4.offset); [L89] havoc ~#gf_u~4.base, ~#gf_u~4.offset; VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, ~ix~2=2, ~one_modf~0=1.0, ~x=19.0] [L93] ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647); [L94] #res := (if 2139095040 == ~ix~2 then 1 else 0); VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, #res=1, ~ix~2=2139095040, ~one_modf~0=1.0, ~x=19.0] [L86-L95] ensures true; VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, #res=1, ~ix~2=2139095040, ~one_modf~0=1.0, ~x=19.0] [L109] RET call #t~ret20 := isinf_float(#t~mem19); VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; [L109] #t~short23 := 0 != #t~ret20; VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, #t~short23=true, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume #t~short23; [L109] #t~short22 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume !#t~short22; VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] #t~short23 := !#t~short22; VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109-L112] assume #t~short23; [L109] havoc #t~short22; [L109] havoc #t~ret20; [L109] havoc #t~mem19; [L109] havoc #t~ret21; [L109] havoc #t~short23; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L110] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=11, #NULL.offset=6, old(#NULL.base)=11, old(#NULL.offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=9.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L12] ~one_modf~0 := 1.0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=1.0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret24 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L104] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); [L105] call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.alloc(4); [L105] call write~init~real(#t~nondet17, ~#iptr~0.base, ~#iptr~0.offset, 4); [L105] havoc #t~nondet17; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0] [L106] CALL call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L14-L71] ~x := #in~x; [L14-L71] ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; [L15] havoc ~i0~0; [L15] havoc ~j0~0; [L16] havoc ~i~0; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~iptr.base=21, ~iptr.offset=0, ~one_modf~0=1.0, ~x=7.0] [L18] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L19] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L18] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L18] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~one_modf~0=1.0, ~x=7.0] [L22] ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~one_modf~0=1.0, ~x=7.0] [L23-L70] assume ~j0~0 < 23; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L24-L55] assume ~j0~0 < 0; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L26] call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.alloc(4); [L27] call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4); [L28] call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4); [L28] call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4); [L28] havoc #t~mem2; [L26] call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset); [L26] havoc ~#sf_u~0.base, ~#sf_u~0.offset; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L30] #res := ~x; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, #res=7.0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L14-L71] ensures true; VAL [#in~iptr.base=21, #in~iptr.offset=0, #in~x=7.0, #NULL.base=0, #NULL.offset=0, #res=7.0, ~i0~0=5, ~iptr.base=21, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L106] RET call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret18=7.0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~x~0=7.0] [L106] ~res~0 := #t~ret18; [L106] havoc #t~ret18; [L109] call #t~mem19 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] CALL call #t~ret20 := isinf_float(#t~mem19); VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L86-L95] ~x := #in~x; [L87] havoc ~ix~2; VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0, ~x=19.0] [L89] call ~#gf_u~4.base, ~#gf_u~4.offset := #Ultimate.alloc(4); [L90] call write~real(~x, ~#gf_u~4.base, ~#gf_u~4.offset, 4); [L91] call #t~mem15 := read~int(~#gf_u~4.base, ~#gf_u~4.offset, 4); [L91] ~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296); [L91] call write~real(#t~union16, ~#gf_u~4.base, ~#gf_u~4.offset, 4); [L91] havoc #t~union16; [L91] havoc #t~mem15; [L89] call ULTIMATE.dealloc(~#gf_u~4.base, ~#gf_u~4.offset); [L89] havoc ~#gf_u~4.base, ~#gf_u~4.offset; VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, ~ix~2=2, ~one_modf~0=1.0, ~x=19.0] [L93] ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647); [L94] #res := (if 2139095040 == ~ix~2 then 1 else 0); VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, #res=1, ~ix~2=2139095040, ~one_modf~0=1.0, ~x=19.0] [L86-L95] ensures true; VAL [#in~x=19.0, #NULL.base=0, #NULL.offset=0, #res=1, ~ix~2=2139095040, ~one_modf~0=1.0, ~x=19.0] [L109] RET call #t~ret20 := isinf_float(#t~mem19); VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; [L109] #t~short23 := 0 != #t~ret20; VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, #t~short23=true, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume #t~short23; [L109] #t~short22 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume !#t~short22; VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] #t~short23 := !#t~short22; VAL [#NULL.base=0, #NULL.offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109-L112] assume #t~short23; [L109] havoc #t~short22; [L109] havoc #t~ret20; [L109] havoc #t~mem19; [L109] havoc #t~ret21; [L109] havoc #t~short23; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L110] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=21, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=6, old(#NULL!base)=11, old(#NULL!offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=9.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_modf~0 := 1.0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L104] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); [L105] FCALL call ~#iptr~0 := #Ultimate.alloc(4); [L105] FCALL call write~init~real(#t~nondet17, ~#iptr~0, 4); [L105] havoc #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0] [L106] CALL call #t~ret18 := modf_float(~x~0, ~#iptr~0); VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L14-L71] ~x := #in~x; [L14-L71] ~iptr := #in~iptr; [L15] havoc ~i0~0; [L15] havoc ~j0~0; [L16] havoc ~i~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L18] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L19] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L18] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L18] havoc ~#gf_u~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L22] ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L23] COND TRUE ~j0~0 < 23 VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L24] COND TRUE ~j0~0 < 0 VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L26] FCALL call ~#sf_u~0 := #Ultimate.alloc(4); [L27] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#sf_u~0!base, offset: ~#sf_u~0!offset }, 4); [L28] FCALL call #t~mem2 := read~real({ base: ~#sf_u~0!base, offset: ~#sf_u~0!offset }, 4); [L28] FCALL call write~real(#t~mem2, ~iptr, 4); [L28] havoc #t~mem2; [L26] FCALL call ULTIMATE.dealloc(~#sf_u~0); [L26] havoc ~#sf_u~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L30] #res := ~x; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, #res=7.0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L106] RET call #t~ret18 := modf_float(~x~0, ~#iptr~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret18=7.0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~x~0=7.0] [L106] ~res~0 := #t~ret18; [L106] havoc #t~ret18; [L109] FCALL call #t~mem19 := read~real(~#iptr~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] CALL call #t~ret20 := isinf_float(#t~mem19); VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L86-L95] ~x := #in~x; [L87] havoc ~ix~2; VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0, ~x=19.0] [L89] FCALL call ~#gf_u~4 := #Ultimate.alloc(4); [L90] FCALL call write~real(~x, { base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] FCALL call #t~mem15 := read~int({ base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] ~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296); [L91] FCALL call write~real(#t~union16, { base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] havoc #t~union16; [L91] havoc #t~mem15; [L89] FCALL call ULTIMATE.dealloc(~#gf_u~4); [L89] havoc ~#gf_u~4; VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~ix~2=2, ~one_modf~0=1.0, ~x=19.0] [L93] ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647); [L94] #res := (if 2139095040 == ~ix~2 then 1 else 0); VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, #res=1, ~ix~2=2139095040, ~one_modf~0=1.0, ~x=19.0] [L109] RET call #t~ret20 := isinf_float(#t~mem19); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; [L109] #t~short23 := 0 != #t~ret20; VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND TRUE #t~short23 [L109] #t~short22 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND FALSE !(#t~short22) VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] #t~short23 := !#t~short22; VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND TRUE #t~short23 [L109] havoc #t~short22; [L109] havoc #t~ret20; [L109] havoc #t~mem19; [L109] havoc #t~ret21; [L109] havoc #t~short23; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L110] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=6, old(#NULL!base)=11, old(#NULL!offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=9.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_modf~0 := 1.0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L104] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); [L105] FCALL call ~#iptr~0 := #Ultimate.alloc(4); [L105] FCALL call write~init~real(#t~nondet17, ~#iptr~0, 4); [L105] havoc #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0] [L106] CALL call #t~ret18 := modf_float(~x~0, ~#iptr~0); VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L14-L71] ~x := #in~x; [L14-L71] ~iptr := #in~iptr; [L15] havoc ~i0~0; [L15] havoc ~j0~0; [L16] havoc ~i~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L18] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L19] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L18] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L18] havoc ~#gf_u~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L22] ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L23] COND TRUE ~j0~0 < 23 VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L24] COND TRUE ~j0~0 < 0 VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L26] FCALL call ~#sf_u~0 := #Ultimate.alloc(4); [L27] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#sf_u~0!base, offset: ~#sf_u~0!offset }, 4); [L28] FCALL call #t~mem2 := read~real({ base: ~#sf_u~0!base, offset: ~#sf_u~0!offset }, 4); [L28] FCALL call write~real(#t~mem2, ~iptr, 4); [L28] havoc #t~mem2; [L26] FCALL call ULTIMATE.dealloc(~#sf_u~0); [L26] havoc ~#sf_u~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L30] #res := ~x; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, #res=7.0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L106] RET call #t~ret18 := modf_float(~x~0, ~#iptr~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret18=7.0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~x~0=7.0] [L106] ~res~0 := #t~ret18; [L106] havoc #t~ret18; [L109] FCALL call #t~mem19 := read~real(~#iptr~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] CALL call #t~ret20 := isinf_float(#t~mem19); VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L86-L95] ~x := #in~x; [L87] havoc ~ix~2; VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0, ~x=19.0] [L89] FCALL call ~#gf_u~4 := #Ultimate.alloc(4); [L90] FCALL call write~real(~x, { base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] FCALL call #t~mem15 := read~int({ base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] ~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296); [L91] FCALL call write~real(#t~union16, { base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] havoc #t~union16; [L91] havoc #t~mem15; [L89] FCALL call ULTIMATE.dealloc(~#gf_u~4); [L89] havoc ~#gf_u~4; VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~ix~2=2, ~one_modf~0=1.0, ~x=19.0] [L93] ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647); [L94] #res := (if 2139095040 == ~ix~2 then 1 else 0); VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, #res=1, ~ix~2=2139095040, ~one_modf~0=1.0, ~x=19.0] [L109] RET call #t~ret20 := isinf_float(#t~mem19); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; [L109] #t~short23 := 0 != #t~ret20; VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND TRUE #t~short23 [L109] #t~short22 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND FALSE !(#t~short22) VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] #t~short23 := !#t~short22; VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND TRUE #t~short23 [L109] havoc #t~short22; [L109] havoc #t~ret20; [L109] havoc #t~mem19; [L109] havoc #t~ret21; [L109] havoc #t~short23; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L110] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=6, old(#NULL!base)=11, old(#NULL!offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=9.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_modf~0 := 1.0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L104] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); [L105] FCALL call ~#iptr~0 := #Ultimate.alloc(4); [L105] FCALL call write~init~real(#t~nondet17, ~#iptr~0, 4); [L105] havoc #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0] [L106] CALL call #t~ret18 := modf_float(~x~0, ~#iptr~0); VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L14-L71] ~x := #in~x; [L14-L71] ~iptr := #in~iptr; [L15] havoc ~i0~0; [L15] havoc ~j0~0; [L16] havoc ~i~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L18] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L19] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L18] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L18] havoc ~#gf_u~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L22] ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L23] COND TRUE ~j0~0 < 23 VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L24] COND TRUE ~j0~0 < 0 VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L26] FCALL call ~#sf_u~0 := #Ultimate.alloc(4); [L27] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#sf_u~0!base, offset: ~#sf_u~0!offset }, 4); [L28] FCALL call #t~mem2 := read~real({ base: ~#sf_u~0!base, offset: ~#sf_u~0!offset }, 4); [L28] FCALL call write~real(#t~mem2, ~iptr, 4); [L28] havoc #t~mem2; [L26] FCALL call ULTIMATE.dealloc(~#sf_u~0); [L26] havoc ~#sf_u~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L30] #res := ~x; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, #res=7.0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L106] RET call #t~ret18 := modf_float(~x~0, ~#iptr~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret18=7.0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~x~0=7.0] [L106] ~res~0 := #t~ret18; [L106] havoc #t~ret18; [L109] FCALL call #t~mem19 := read~real(~#iptr~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] CALL call #t~ret20 := isinf_float(#t~mem19); VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L86-L95] ~x := #in~x; [L87] havoc ~ix~2; VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0, ~x=19.0] [L89] FCALL call ~#gf_u~4 := #Ultimate.alloc(4); [L90] FCALL call write~real(~x, { base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] FCALL call #t~mem15 := read~int({ base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] ~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296); [L91] FCALL call write~real(#t~union16, { base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] havoc #t~union16; [L91] havoc #t~mem15; [L89] FCALL call ULTIMATE.dealloc(~#gf_u~4); [L89] havoc ~#gf_u~4; VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~ix~2=2, ~one_modf~0=1.0, ~x=19.0] [L93] ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647); [L94] #res := (if 2139095040 == ~ix~2 then 1 else 0); VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, #res=1, ~ix~2=2139095040, ~one_modf~0=1.0, ~x=19.0] [L109] RET call #t~ret20 := isinf_float(#t~mem19); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; [L109] #t~short23 := 0 != #t~ret20; VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND TRUE #t~short23 [L109] #t~short22 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND FALSE !(#t~short22) VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] #t~short23 := !#t~short22; VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND TRUE #t~short23 [L109] havoc #t~short22; [L109] havoc #t~ret20; [L109] havoc #t~mem19; [L109] havoc #t~ret21; [L109] havoc #t~short23; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L110] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=6, old(#NULL!base)=11, old(#NULL!offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=9.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_modf~0 := 1.0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=6, old(~one_modf~0)=9.0, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret24 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L104] ~x~0 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0); [L105] FCALL call ~#iptr~0 := #Ultimate.alloc(4); [L105] FCALL call write~init~real(#t~nondet17, ~#iptr~0, 4); [L105] havoc #t~nondet17; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0] [L106] CALL call #t~ret18 := modf_float(~x~0, ~#iptr~0); VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L14-L71] ~x := #in~x; [L14-L71] ~iptr := #in~iptr; [L15] havoc ~i0~0; [L15] havoc ~j0~0; [L16] havoc ~i~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L18] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L19] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L20] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L20] havoc #t~union1; [L20] havoc #t~mem0; [L18] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L18] havoc ~#gf_u~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L22] ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~one_modf~0=1.0, ~x=7.0] [L23] COND TRUE ~j0~0 < 23 VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L24] COND TRUE ~j0~0 < 0 VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L26] FCALL call ~#sf_u~0 := #Ultimate.alloc(4); [L27] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#sf_u~0!base, offset: ~#sf_u~0!offset }, 4); [L28] FCALL call #t~mem2 := read~real({ base: ~#sf_u~0!base, offset: ~#sf_u~0!offset }, 4); [L28] FCALL call write~real(#t~mem2, ~iptr, 4); [L28] havoc #t~mem2; [L26] FCALL call ULTIMATE.dealloc(~#sf_u~0); [L26] havoc ~#sf_u~0; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L30] #res := ~x; VAL [#in~iptr!base=21, #in~iptr!offset=0, #in~x=7.0, #NULL!base=0, #NULL!offset=0, #res=7.0, ~i0~0=5, ~iptr!base=21, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=7.0] [L106] RET call #t~ret18 := modf_float(~x~0, ~#iptr~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret18=7.0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~x~0=7.0] [L106] ~res~0 := #t~ret18; [L106] havoc #t~ret18; [L109] FCALL call #t~mem19 := read~real(~#iptr~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] CALL call #t~ret20 := isinf_float(#t~mem19); VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L86-L95] ~x := #in~x; [L87] havoc ~ix~2; VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0, ~x=19.0] [L89] FCALL call ~#gf_u~4 := #Ultimate.alloc(4); [L90] FCALL call write~real(~x, { base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] FCALL call #t~mem15 := read~int({ base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] ~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296); [L91] FCALL call write~real(#t~union16, { base: ~#gf_u~4!base, offset: ~#gf_u~4!offset }, 4); [L91] havoc #t~union16; [L91] havoc #t~mem15; [L89] FCALL call ULTIMATE.dealloc(~#gf_u~4); [L89] havoc ~#gf_u~4; VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, ~ix~2=2, ~one_modf~0=1.0, ~x=19.0] [L93] ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647); [L94] #res := (if 2139095040 == ~ix~2 then 1 else 0); VAL [#in~x=19.0, #NULL!base=0, #NULL!offset=0, #res=1, ~ix~2=2139095040, ~one_modf~0=1.0, ~x=19.0] [L109] RET call #t~ret20 := isinf_float(#t~mem19); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647; [L109] #t~short23 := 0 != #t~ret20; VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND TRUE #t~short23 [L109] #t~short22 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND FALSE !(#t~short22) VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] #t~short23 := !#t~short22; VAL [#NULL!base=0, #NULL!offset=0, #t~mem19=19.0, #t~ret20=1, #t~short22=false, #t~short23=true, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L109] COND TRUE #t~short23 [L109] havoc #t~short22; [L109] havoc #t~ret20; [L109] havoc #t~mem19; [L109] havoc #t~ret21; [L109] havoc #t~short23; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L110] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=21, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=7.0, ~x~0=7.0] [L12] static const float one_modf = 1.0; VAL [\old(one_modf)=9, one_modf=1] [L104] float x = -1.0f / 0.0f; [L105] float iptr = __VERIFIER_nondet_float(); [L106] CALL, EXPR modf_float(x, &iptr) VAL [\old(x)=7, iptr={21:0}, one_modf=1] [L15] __int32_t i0, j0; [L16] __uint32_t i; VAL [\old(x)=7, iptr={21:0}, iptr={21:0}, one_modf=1, x=7] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (i0) = gf_u.word [L22] j0 = ((i0 >> 23) & 0xff) - 0x7f VAL [\old(x)=7, i0=5, iptr={21:0}, iptr={21:0}, one_modf=1, x=7] [L23] COND TRUE j0 < 23 VAL [\old(x)=7, i0=5, iptr={21:0}, iptr={21:0}, j0=-1, one_modf=1, x=7] [L24] COND TRUE j0 < 0 VAL [\old(x)=7, i0=5, iptr={21:0}, iptr={21:0}, j0=-1, one_modf=1, x=7] [L26] ieee_float_shape_type sf_u; [L27] sf_u.word = (i0 & 0x80000000) [L28] EXPR sf_u.value [L28] (*iptr) = sf_u.value [L30] return x; VAL [\old(x)=7, \result=7, i0=5, iptr={21:0}, iptr={21:0}, j0=-1, one_modf=1, x=7] [L106] RET, EXPR modf_float(x, &iptr) VAL [iptr={21:0}, modf_float(x, &iptr)=7, one_modf=1, x=7] [L106] float res = modf_float(x, &iptr); [L109] EXPR \read(iptr) VAL [\read(iptr)=19, iptr={21:0}, one_modf=1, res=7, x=7] [L109] CALL, EXPR isinf_float(iptr) VAL [\old(x)=19, one_modf=1] [L87] __int32_t ix; VAL [\old(x)=19, one_modf=1, x=19] [L89] ieee_float_shape_type gf_u; [L90] gf_u.value = (x) [L91] EXPR gf_u.word [L91] (ix) = gf_u.word [L93] ix &= 0x7fffffff [L94] return ((ix) == 0x7f800000L); VAL [\old(x)=19, \result=1, ix=2139095040, one_modf=1, x=19] [L109] RET, EXPR isinf_float(iptr) VAL [\read(iptr)=19, iptr={21:0}, isinf_float(iptr)=1, one_modf=1, res=7, x=7] [L109] isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1) [L109] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [\read(iptr)=19, iptr={21:0}, isinf_float(iptr)=1, isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1)=1, one_modf=1, res=7, res == -0.0f && __signbit_float(res) == 1=0, x=7] [L109] isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1) VAL [\read(iptr)=19, iptr={21:0}, isinf_float(iptr)=1, isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1)=1, one_modf=1, res=7, res == -0.0f && __signbit_float(res) == 1=0, x=7] [L109] COND TRUE isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1) [L110] __VERIFIER_error() VAL [iptr={21:0}, one_modf=1, res=7, x=7] ----- [2018-11-23 09:41:11,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:41:11 BoogieIcfgContainer [2018-11-23 09:41:11,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 09:41:11,814 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:41:11,814 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:41:11,814 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:41:11,815 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:41:11" (3/4) ... [2018-11-23 09:41:11,818 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 09:41:11,818 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:41:11,819 INFO L168 Benchmark]: Toolchain (without parser) took 1020.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 960.8 MB in the beginning and 1.1 GB in the end (delta: -95.7 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2018-11-23 09:41:11,820 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 09:41:11,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.64 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 944.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 09:41:11,821 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 09:41:11,821 INFO L168 Benchmark]: Boogie Preprocessor took 25.97 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 09:41:11,822 INFO L168 Benchmark]: RCFGBuilder took 301.11 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-11-23 09:41:11,822 INFO L168 Benchmark]: TraceAbstraction took 438.39 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: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2018-11-23 09:41:11,823 INFO L168 Benchmark]: Witness Printer took 4.03 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 09:41:11,826 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 195.64 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 944.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 52.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.97 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 301.11 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 438.39 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: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 110]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryArithmeticFLOAToperation at line 104, overapproximation of bitwiseAnd at line 93. Possible FailurePath: [L12] static const float one_modf = 1.0; VAL [\old(one_modf)=9, one_modf=1] [L104] float x = -1.0f / 0.0f; [L105] float iptr = __VERIFIER_nondet_float(); [L106] CALL, EXPR modf_float(x, &iptr) VAL [\old(x)=7, iptr={21:0}, one_modf=1] [L15] __int32_t i0, j0; [L16] __uint32_t i; VAL [\old(x)=7, iptr={21:0}, iptr={21:0}, one_modf=1, x=7] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (i0) = gf_u.word [L22] j0 = ((i0 >> 23) & 0xff) - 0x7f VAL [\old(x)=7, i0=5, iptr={21:0}, iptr={21:0}, one_modf=1, x=7] [L23] COND TRUE j0 < 23 VAL [\old(x)=7, i0=5, iptr={21:0}, iptr={21:0}, j0=-1, one_modf=1, x=7] [L24] COND TRUE j0 < 0 VAL [\old(x)=7, i0=5, iptr={21:0}, iptr={21:0}, j0=-1, one_modf=1, x=7] [L26] ieee_float_shape_type sf_u; [L27] sf_u.word = (i0 & 0x80000000) [L28] EXPR sf_u.value [L28] (*iptr) = sf_u.value [L30] return x; VAL [\old(x)=7, \result=7, i0=5, iptr={21:0}, iptr={21:0}, j0=-1, one_modf=1, x=7] [L106] RET, EXPR modf_float(x, &iptr) VAL [iptr={21:0}, modf_float(x, &iptr)=7, one_modf=1, x=7] [L106] float res = modf_float(x, &iptr); [L109] EXPR \read(iptr) VAL [\read(iptr)=19, iptr={21:0}, one_modf=1, res=7, x=7] [L109] CALL, EXPR isinf_float(iptr) VAL [\old(x)=19, one_modf=1] [L87] __int32_t ix; VAL [\old(x)=19, one_modf=1, x=19] [L89] ieee_float_shape_type gf_u; [L90] gf_u.value = (x) [L91] EXPR gf_u.word [L91] (ix) = gf_u.word [L93] ix &= 0x7fffffff [L94] return ((ix) == 0x7f800000L); VAL [\old(x)=19, \result=1, ix=2139095040, one_modf=1, x=19] [L109] RET, EXPR isinf_float(iptr) VAL [\read(iptr)=19, iptr={21:0}, isinf_float(iptr)=1, one_modf=1, res=7, x=7] [L109] isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1) [L109] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [\read(iptr)=19, iptr={21:0}, isinf_float(iptr)=1, isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1)=1, one_modf=1, res=7, res == -0.0f && __signbit_float(res) == 1=0, x=7] [L109] isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1) VAL [\read(iptr)=19, iptr={21:0}, isinf_float(iptr)=1, isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1)=1, one_modf=1, res=7, res == -0.0f && __signbit_float(res) == 1=0, x=7] [L109] COND TRUE isinf_float(iptr) && !(res == -0.0f && __signbit_float(res) == 1) [L110] __VERIFIER_error() VAL [iptr={21:0}, one_modf=1, res=7, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 59 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 122 SDtfs, 0 SDslu, 54 SDs, 0 SdLazy, 4 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 1546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 09:41:13,244 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:41:13,245 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:41:13,254 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:41:13,254 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:41:13,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:41:13,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:41:13,256 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:41:13,257 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:41:13,258 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:41:13,258 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:41:13,259 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:41:13,259 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:41:13,260 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:41:13,261 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:41:13,261 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:41:13,262 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:41:13,263 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:41:13,264 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:41:13,265 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:41:13,266 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:41:13,266 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:41:13,268 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:41:13,268 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:41:13,268 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:41:13,269 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:41:13,269 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:41:13,270 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:41:13,270 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:41:13,271 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:41:13,271 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:41:13,272 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:41:13,272 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:41:13,272 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:41:13,273 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:41:13,273 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:41:13,273 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 09:41:13,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:41:13,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:41:13,284 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:41:13,284 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:41:13,284 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 09:41:13,284 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 09:41:13,285 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 09:41:13,285 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 09:41:13,285 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 09:41:13,285 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 09:41:13,285 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:41:13,286 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:41:13,286 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:41:13,286 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:41:13,286 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:41:13,286 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:41:13,286 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:41:13,286 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:41:13,286 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:41:13,287 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:41:13,287 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:41:13,287 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:41:13,287 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:41:13,287 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:41:13,287 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:41:13,287 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:41:13,288 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:41:13,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:41:13,288 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:41:13,288 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:41:13,288 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:41:13,288 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 09:41:13,288 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:41:13,288 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:41:13,289 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:41:13,289 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_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/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 -> 206a1fa9646ae2b913e15c72bee749b0ae7b465a [2018-11-23 09:41:13,319 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:41:13,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:41:13,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:41:13,332 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:41:13,332 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:41:13,333 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1211b_true-unreach-call.c [2018-11-23 09:41:13,372 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/data/c1dc7eabe/ee642d0d2fa44b8197024823b39b5a4d/FLAGf1329be24 [2018-11-23 09:41:13,700 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:41:13,701 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/sv-benchmarks/c/float-newlib/float_req_bl_1211b_true-unreach-call.c [2018-11-23 09:41:13,705 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/data/c1dc7eabe/ee642d0d2fa44b8197024823b39b5a4d/FLAGf1329be24 [2018-11-23 09:41:14,130 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/data/c1dc7eabe/ee642d0d2fa44b8197024823b39b5a4d [2018-11-23 09:41:14,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:41:14,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:41:14,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:41:14,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:41:14,137 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:41:14,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:41:14" (1/1) ... [2018-11-23 09:41:14,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f841f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:14, skipping insertion in model container [2018-11-23 09:41:14,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:41:14" (1/1) ... [2018-11-23 09:41:14,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:41:14,160 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:41:14,291 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:41:14,302 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:41:14,326 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:41:14,337 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:41:14,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:14 WrapperNode [2018-11-23 09:41:14,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:41:14,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:41:14,338 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:41:14,338 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:41:14,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:14" (1/1) ... [2018-11-23 09:41:14,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:14" (1/1) ... [2018-11-23 09:41:14,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:41:14,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:41:14,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:41:14,355 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:41:14,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:14" (1/1) ... [2018-11-23 09:41:14,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:14" (1/1) ... [2018-11-23 09:41:14,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:14" (1/1) ... [2018-11-23 09:41:14,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:14" (1/1) ... [2018-11-23 09:41:14,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:14" (1/1) ... [2018-11-23 09:41:14,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:14" (1/1) ... [2018-11-23 09:41:14,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:14" (1/1) ... [2018-11-23 09:41:14,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:41:14,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:41:14,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:41:14,385 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:41:14,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/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 09:41:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2018-11-23 09:41:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:41:14,467 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:41:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-23 09:41:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure modf_float [2018-11-23 09:41:14,467 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_float [2018-11-23 09:41:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-11-23 09:41:14,468 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-11-23 09:41:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:41:14,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:41:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:41:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:41:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:41:14,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:41:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 09:41:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-11-23 09:41:14,469 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-11-23 09:41:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 09:41:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:41:14,617 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 09:41:14,647 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 09:41:14,653 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 09:41:14,740 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 09:41:14,768 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 09:41:14,784 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 09:41:14,794 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 09:41:14,826 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 09:41:14,831 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:41:14,831 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-23 09:41:14,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:41:14 BoogieIcfgContainer [2018-11-23 09:41:14,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:41:14,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:41:14,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:41:14,834 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:41:14,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:41:14" (1/3) ... [2018-11-23 09:41:14,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d4dfe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:41:14, skipping insertion in model container [2018-11-23 09:41:14,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:14" (2/3) ... [2018-11-23 09:41:14,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d4dfe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:41:14, skipping insertion in model container [2018-11-23 09:41:14,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:41:14" (3/3) ... [2018-11-23 09:41:14,836 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1211b_true-unreach-call.c [2018-11-23 09:41:14,842 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:41:14,847 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:41:14,856 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:41:14,876 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:41:14,876 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:41:14,876 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:41:14,876 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:41:14,877 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:41:14,877 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:41:14,877 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:41:14,877 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:41:14,877 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:41:14,887 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-23 09:41:14,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 09:41:14,890 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:41:14,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:41:14,892 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:41:14,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:41:14,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1328912444, now seen corresponding path program 1 times [2018-11-23 09:41:14,898 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:41:14,899 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/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 09:41:14,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:41:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:41:15,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:41:15,031 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 09:41:15,031 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:41:15,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:41:15,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:41:15,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:41:15,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:41:15,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:41:15,059 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-11-23 09:41:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:41:15,078 INFO L93 Difference]: Finished difference Result 110 states and 158 transitions. [2018-11-23 09:41:15,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:41:15,079 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 09:41:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:41:15,087 INFO L225 Difference]: With dead ends: 110 [2018-11-23 09:41:15,087 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 09:41:15,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:41:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 09:41:15,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 09:41:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 09:41:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-23 09:41:15,112 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 27 [2018-11-23 09:41:15,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:41:15,112 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-23 09:41:15,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:41:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 09:41:15,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 09:41:15,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:41:15,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:41:15,113 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:41:15,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:41:15,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2017954314, now seen corresponding path program 1 times [2018-11-23 09:41:15,114 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:41:15,114 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/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 09:41:15,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:41:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:41:15,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:41:15,279 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 09:41:15,280 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:41:15,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:41:15,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 09:41:15,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 09:41:15,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 09:41:15,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:41:15,292 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 7 states. [2018-11-23 09:41:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:41:16,049 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-11-23 09:41:16,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 09:41:16,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-23 09:41:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:41:16,051 INFO L225 Difference]: With dead ends: 82 [2018-11-23 09:41:16,051 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 09:41:16,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 09:41:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 09:41:16,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 09:41:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 09:41:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 09:41:16,056 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 30 [2018-11-23 09:41:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:41:16,056 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 09:41:16,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 09:41:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 09:41:16,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 09:41:16,057 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:41:16,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:41:16,057 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:41:16,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:41:16,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1555916386, now seen corresponding path program 1 times [2018-11-23 09:41:16,058 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:41:16,058 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/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 09:41:16,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:41:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:41:16,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:41:16,159 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 09:41:16,160 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:41:16,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:41:16,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:41:16,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:41:16,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:41:16,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:41:16,168 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 3 states. [2018-11-23 09:41:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:41:16,180 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-23 09:41:16,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:41:16,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 09:41:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:41:16,181 INFO L225 Difference]: With dead ends: 45 [2018-11-23 09:41:16,181 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 09:41:16,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:41:16,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 09:41:16,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 09:41:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 09:41:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-23 09:41:16,185 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 31 [2018-11-23 09:41:16,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:41:16,185 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-23 09:41:16,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:41:16,186 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 09:41:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 09:41:16,186 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:41:16,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:41:16,187 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:41:16,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:41:16,187 INFO L82 PathProgramCache]: Analyzing trace with hash -597431019, now seen corresponding path program 1 times [2018-11-23 09:41:16,187 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:41:16,187 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 09:41:16,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:41:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:41:16,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:41:16,342 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 09:41:16,342 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:41:16,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:41:16,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 09:41:16,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 09:41:16,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 09:41:16,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:41:16,351 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 7 states. [2018-11-23 09:41:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:41:16,532 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2018-11-23 09:41:16,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 09:41:16,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-23 09:41:16,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:41:16,533 INFO L225 Difference]: With dead ends: 46 [2018-11-23 09:41:16,533 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 09:41:16,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 09:41:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 09:41:16,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 09:41:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 09:41:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2018-11-23 09:41:16,537 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 33 [2018-11-23 09:41:16,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:41:16,537 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2018-11-23 09:41:16,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 09:41:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2018-11-23 09:41:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 09:41:16,538 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:41:16,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:41:16,538 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:41:16,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:41:16,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1539485821, now seen corresponding path program 1 times [2018-11-23 09:41:16,539 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:41:16,539 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 09:41:16,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:41:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:41:16,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:41:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:41:16,897 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:41:16,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:41:16,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 09:41:16,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 09:41:16,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 09:41:16,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-23 09:41:16,907 INFO L87 Difference]: Start difference. First operand 42 states and 41 transitions. Second operand 15 states. [2018-11-23 09:41:17,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:41:17,886 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2018-11-23 09:41:17,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 09:41:17,886 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-11-23 09:41:17,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:41:17,886 INFO L225 Difference]: With dead ends: 42 [2018-11-23 09:41:17,886 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 09:41:17,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-11-23 09:41:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 09:41:17,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 09:41:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 09:41:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 09:41:17,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-11-23 09:41:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:41:17,887 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 09:41:17,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 09:41:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 09:41:17,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:41:17,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 09:41:18,103 INFO L448 ceAbstractionStarter]: For program point L88-1(lines 88 92) no Hoare annotation was computed. [2018-11-23 09:41:18,103 INFO L451 ceAbstractionStarter]: At program point L88-2(lines 88 92) the Hoare annotation is: true [2018-11-23 09:41:18,103 INFO L448 ceAbstractionStarter]: For program point L88-3(lines 88 92) no Hoare annotation was computed. [2018-11-23 09:41:18,103 INFO L451 ceAbstractionStarter]: At program point isinf_floatENTRY(lines 86 95) the Hoare annotation is: true [2018-11-23 09:41:18,103 INFO L448 ceAbstractionStarter]: For program point isinf_floatEXIT(lines 86 95) no Hoare annotation was computed. [2018-11-23 09:41:18,104 INFO L448 ceAbstractionStarter]: For program point isinf_floatFINAL(lines 86 95) no Hoare annotation was computed. [2018-11-23 09:41:18,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 09:41:18,104 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 09:41:18,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 09:41:18,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 09:41:18,104 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 09:41:18,104 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 09:41:18,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 09:41:18,104 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 97 115) no Hoare annotation was computed. [2018-11-23 09:41:18,104 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-23 09:41:18,104 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 97 115) no Hoare annotation was computed. [2018-11-23 09:41:18,105 INFO L444 ceAbstractionStarter]: At program point L106(line 106) the Hoare annotation is: (= main_~x~0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) [2018-11-23 09:41:18,105 INFO L448 ceAbstractionStarter]: For program point L106-1(line 106) no Hoare annotation was computed. [2018-11-23 09:41:18,105 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 97 115) the Hoare annotation is: true [2018-11-23 09:41:18,105 INFO L444 ceAbstractionStarter]: At program point L109(line 109) the Hoare annotation is: (and (exists ((modf_float_~ix~1 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) modf_float_~ix~1) ((_ extract 30 23) modf_float_~ix~1) ((_ extract 22 0) modf_float_~ix~1)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= (let ((.cse0 (bvand (_ bv2147483648 32) modf_float_~ix~1))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) main_~res~0))) (= main_~x~0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))) [2018-11-23 09:41:18,105 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2018-11-23 09:41:18,105 INFO L448 ceAbstractionStarter]: For program point L109-1(line 109) no Hoare annotation was computed. [2018-11-23 09:41:18,105 INFO L448 ceAbstractionStarter]: For program point L109-2(line 109) no Hoare annotation was computed. [2018-11-23 09:41:18,105 INFO L448 ceAbstractionStarter]: For program point L109-3(line 109) no Hoare annotation was computed. [2018-11-23 09:41:18,106 INFO L444 ceAbstractionStarter]: At program point L109-4(line 109) the Hoare annotation is: (and (exists ((modf_float_~ix~1 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) modf_float_~ix~1) ((_ extract 30 23) modf_float_~ix~1) ((_ extract 22 0) modf_float_~ix~1)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= (let ((.cse0 (bvand (_ bv2147483648 32) modf_float_~ix~1))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) main_~res~0))) (= main_~x~0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) |main_#t~short22|) [2018-11-23 09:41:18,106 INFO L448 ceAbstractionStarter]: For program point L109-5(line 109) no Hoare annotation was computed. [2018-11-23 09:41:18,106 INFO L448 ceAbstractionStarter]: For program point L109-7(line 109) no Hoare annotation was computed. [2018-11-23 09:41:18,106 INFO L448 ceAbstractionStarter]: For program point L109-9(lines 109 112) no Hoare annotation was computed. [2018-11-23 09:41:18,106 INFO L448 ceAbstractionStarter]: For program point L64(lines 64 68) no Hoare annotation was computed. [2018-11-23 09:41:18,106 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 56 70) no Hoare annotation was computed. [2018-11-23 09:41:18,106 INFO L448 ceAbstractionStarter]: For program point L64-2(lines 64 68) no Hoare annotation was computed. [2018-11-23 09:41:18,106 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 70) no Hoare annotation was computed. [2018-11-23 09:41:18,106 INFO L448 ceAbstractionStarter]: For program point modf_floatEXIT(lines 14 71) no Hoare annotation was computed. [2018-11-23 09:41:18,107 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2018-11-23 09:41:18,107 INFO L444 ceAbstractionStarter]: At program point L48-2(lines 48 52) the Hoare annotation is: (and (= modf_float_~x |modf_float_#in~x|) (exists ((modf_float_~i0~0 (_ BitVec 32))) (and (= (bvadd modf_float_~j0~0 (_ bv127 32)) (bvand (_ bv255 32) (bvashr modf_float_~i0~0 (_ bv23 32)))) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|))) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|) (exists ((modf_float_~i0~0 (_ BitVec 32))) (and (bvslt (bvadd (bvand (_ bv255 32) (bvashr modf_float_~i0~0 (_ bv23 32))) (_ bv4294967169 32)) (_ bv23 32)) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|)))) [2018-11-23 09:41:18,107 INFO L448 ceAbstractionStarter]: For program point L48-3(lines 48 52) no Hoare annotation was computed. [2018-11-23 09:41:18,107 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 36 40) no Hoare annotation was computed. [2018-11-23 09:41:18,107 INFO L444 ceAbstractionStarter]: At program point L36-2(lines 36 40) the Hoare annotation is: (and (= modf_float_~x |modf_float_#in~x|) (exists ((modf_float_~i0~0 (_ BitVec 32))) (and (= (bvadd modf_float_~j0~0 (_ bv127 32)) (bvand (_ bv255 32) (bvashr modf_float_~i0~0 (_ bv23 32)))) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|))) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|) (exists ((modf_float_~i0~0 (_ BitVec 32))) (and (bvslt (bvadd (bvand (_ bv255 32) (bvashr modf_float_~i0~0 (_ bv23 32))) (_ bv4294967169 32)) (_ bv23 32)) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|)))) [2018-11-23 09:41:18,107 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 55) no Hoare annotation was computed. [2018-11-23 09:41:18,107 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 45) no Hoare annotation was computed. [2018-11-23 09:41:18,107 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 33 47) no Hoare annotation was computed. [2018-11-23 09:41:18,107 INFO L448 ceAbstractionStarter]: For program point L41-2(lines 41 45) no Hoare annotation was computed. [2018-11-23 09:41:18,108 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 54) no Hoare annotation was computed. [2018-11-23 09:41:18,108 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 25 29) no Hoare annotation was computed. [2018-11-23 09:41:18,108 INFO L444 ceAbstractionStarter]: At program point L25-2(lines 25 29) the Hoare annotation is: (and (= modf_float_~x |modf_float_#in~x|) (exists ((modf_float_~i0~0 (_ BitVec 32))) (and (= (bvadd modf_float_~j0~0 (_ bv127 32)) (bvand (_ bv255 32) (bvashr modf_float_~i0~0 (_ bv23 32)))) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|))) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|) (exists ((modf_float_~i0~0 (_ BitVec 32))) (and (bvslt (bvadd (bvand (_ bv255 32) (bvashr modf_float_~i0~0 (_ bv23 32))) (_ bv4294967169 32)) (_ bv23 32)) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|)))) [2018-11-23 09:41:18,108 INFO L448 ceAbstractionStarter]: For program point L25-3(lines 25 29) no Hoare annotation was computed. [2018-11-23 09:41:18,108 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2018-11-23 09:41:18,108 INFO L444 ceAbstractionStarter]: At program point L17-2(lines 17 21) the Hoare annotation is: (= modf_float_~x |modf_float_#in~x|) [2018-11-23 09:41:18,108 INFO L448 ceAbstractionStarter]: For program point L17-3(lines 17 21) no Hoare annotation was computed. [2018-11-23 09:41:18,108 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 59 63) no Hoare annotation was computed. [2018-11-23 09:41:18,108 INFO L444 ceAbstractionStarter]: At program point L59-2(lines 59 63) the Hoare annotation is: (and (= modf_float_~x |modf_float_#in~x|) (exists ((modf_float_~i0~0 (_ BitVec 32))) (and (= (bvadd modf_float_~j0~0 (_ bv127 32)) (bvand (_ bv255 32) (bvashr modf_float_~i0~0 (_ bv23 32)))) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|))) (= (fp ((_ extract 31 31) modf_float_~i0~0) ((_ extract 30 23) modf_float_~i0~0) ((_ extract 22 0) modf_float_~i0~0)) |modf_float_#in~x|)) [2018-11-23 09:41:18,108 INFO L451 ceAbstractionStarter]: At program point modf_floatENTRY(lines 14 71) the Hoare annotation is: true [2018-11-23 09:41:18,109 INFO L448 ceAbstractionStarter]: For program point modf_floatFINAL(lines 14 71) no Hoare annotation was computed. [2018-11-23 09:41:18,109 INFO L448 ceAbstractionStarter]: For program point __signbit_floatFINAL(lines 73 83) no Hoare annotation was computed. [2018-11-23 09:41:18,109 INFO L451 ceAbstractionStarter]: At program point __signbit_floatENTRY(lines 73 83) the Hoare annotation is: true [2018-11-23 09:41:18,109 INFO L448 ceAbstractionStarter]: For program point __signbit_floatEXIT(lines 73 83) no Hoare annotation was computed. [2018-11-23 09:41:18,109 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2018-11-23 09:41:18,109 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: (= |__signbit_float_#in~x| __signbit_float_~x) [2018-11-23 09:41:18,109 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 76 80) no Hoare annotation was computed. [2018-11-23 09:41:18,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,121 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,121 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,121 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,121 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,127 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,127 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,127 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:41:18 BoogieIcfgContainer [2018-11-23 09:41:18,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 09:41:18,135 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:41:18,135 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:41:18,135 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:41:18,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:41:14" (3/4) ... [2018-11-23 09:41:18,138 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 09:41:18,143 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_float [2018-11-23 09:41:18,143 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 09:41:18,143 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 09:41:18,143 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure modf_float [2018-11-23 09:41:18,144 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_float [2018-11-23 09:41:18,148 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-11-23 09:41:18,148 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-23 09:41:18,148 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 09:41:18,166 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-11-23 09:41:18,166 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 09:41:18,167 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == \old(x) && (\exists modf_float_~i0~0 : bv32 :: ~bvadd64(j0, 127bv32) == ~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x))) && ~fp~LONGDOUBLE(i0[31:31], i0[30:23], i0[22:0]) == \old(x)) && (\exists modf_float_~i0~0 : bv32 :: ~bvslt32(~bvadd64(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 4294967169bv32), 23bv32) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x)) [2018-11-23 09:41:18,167 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (x == \old(x) && (\exists modf_float_~i0~0 : bv32 :: ~bvadd64(j0, 127bv32) == ~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x))) && ~fp~LONGDOUBLE(i0[31:31], i0[30:23], i0[22:0]) == \old(x) [2018-11-23 09:41:18,167 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == \old(x) && (\exists modf_float_~i0~0 : bv32 :: ~bvadd64(j0, 127bv32) == ~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x))) && ~fp~LONGDOUBLE(i0[31:31], i0[30:23], i0[22:0]) == \old(x)) && (\exists modf_float_~i0~0 : bv32 :: ~bvslt32(~bvadd64(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 4294967169bv32), 23bv32) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x)) [2018-11-23 09:41:18,167 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == \old(x) && (\exists modf_float_~i0~0 : bv32 :: ~bvadd64(j0, 127bv32) == ~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x))) && ~fp~LONGDOUBLE(i0[31:31], i0[30:23], i0[22:0]) == \old(x)) && (\exists modf_float_~i0~0 : bv32 :: ~bvslt32(~bvadd64(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 4294967169bv32), 23bv32) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x)) [2018-11-23 09:41:18,190 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a5167d3d-ae65-4ae9-abd0-74fdac9924e6/bin-2019/utaipan/witness.graphml [2018-11-23 09:41:18,190 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:41:18,191 INFO L168 Benchmark]: Toolchain (without parser) took 4057.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 949.7 MB in the beginning and 830.6 MB in the end (delta: 119.1 MB). Peak memory consumption was 245.0 MB. Max. memory is 11.5 GB. [2018-11-23 09:41:18,191 INFO L168 Benchmark]: CDTParser took 0.15 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 09:41:18,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.11 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 09:41:18,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.26 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:41:18,192 INFO L168 Benchmark]: Boogie Preprocessor took 28.93 ms. Allocated memory is still 1.0 GB. Free memory was 933.6 MB in the beginning and 928.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 09:41:18,192 INFO L168 Benchmark]: RCFGBuilder took 447.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 928.3 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:41:18,193 INFO L168 Benchmark]: TraceAbstraction took 3302.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 837.3 MB in the end (delta: 251.8 MB). Peak memory consumption was 251.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:41:18,193 INFO L168 Benchmark]: Witness Printer took 55.05 ms. Allocated memory is still 1.2 GB. Free memory was 837.3 MB in the beginning and 830.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:41:18,195 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 203.11 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 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 17.26 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.93 ms. Allocated memory is still 1.0 GB. Free memory was 933.6 MB in the beginning and 928.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 447.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 928.3 MB in the beginning and 1.1 GB in the end (delta: -160.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3302.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 837.3 MB in the end (delta: 251.8 MB). Peak memory consumption was 251.8 MB. Max. memory is 11.5 GB. * Witness Printer took 55.05 ms. Allocated memory is still 1.2 GB. Free memory was 837.3 MB in the beginning and 830.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 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[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 110]: 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: 17]: Loop Invariant Derived loop invariant: x == \old(x) - InvariantResult [Line: 48]: Loop Invariant [2018-11-23 09:41:18,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] Derived loop invariant: ((x == \old(x) && (\exists modf_float_~i0~0 : bv32 :: ~bvadd64(j0, 127bv32) == ~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x))) && ~fp~LONGDOUBLE(i0[31:31], i0[30:23], i0[22:0]) == \old(x)) && (\exists modf_float_~i0~0 : bv32 :: ~bvslt32(~bvadd64(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 4294967169bv32), 23bv32) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x)) - InvariantResult [Line: 59]: Loop Invariant [2018-11-23 09:41:18,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] Derived loop invariant: (x == \old(x) && (\exists modf_float_~i0~0 : bv32 :: ~bvadd64(j0, 127bv32) == ~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x))) && ~fp~LONGDOUBLE(i0[31:31], i0[30:23], i0[22:0]) == \old(x) - InvariantResult [Line: 36]: Loop Invariant [2018-11-23 09:41:18,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] Derived loop invariant: ((x == \old(x) && (\exists modf_float_~i0~0 : bv32 :: ~bvadd64(j0, 127bv32) == ~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x))) && ~fp~LONGDOUBLE(i0[31:31], i0[30:23], i0[22:0]) == \old(x)) && (\exists modf_float_~i0~0 : bv32 :: ~bvslt32(~bvadd64(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 4294967169bv32), 23bv32) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 25]: Loop Invariant [2018-11-23 09:41:18,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] [2018-11-23 09:41:18,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[modf_float_~i0~0,QUANTIFIED] Derived loop invariant: ((x == \old(x) && (\exists modf_float_~i0~0 : bv32 :: ~bvadd64(j0, 127bv32) == ~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x))) && ~fp~LONGDOUBLE(i0[31:31], i0[30:23], i0[22:0]) == \old(x)) && (\exists modf_float_~i0~0 : bv32 :: ~bvslt32(~bvadd64(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 4294967169bv32), 23bv32) && ~fp~LONGDOUBLE(modf_float_~i0~0[31:31], modf_float_~i0~0[30:23], modf_float_~i0~0[22:0]) == \old(x)) - InvariantResult [Line: 88]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 59 locations, 1 error locations. SAFE Result, 3.2s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 212 SDtfs, 120 SDslu, 656 SDs, 0 SdLazy, 249 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 25 PreInvPairs, 34 NumberOfFragments, 300 HoareAnnotationTreeSize, 25 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 32 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 157 ConstructedInterpolants, 27 QuantifiedInterpolants, 30602 SizeOfPredicates, 16 NumberOfNonLiveVariables, 485 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...