./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1211a_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_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1211a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/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 98b359d4210eaa0693e17be51fa07ce179f3b890 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1211a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/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 98b359d4210eaa0693e17be51fa07ce179f3b890 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:23:48,650 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:23:48,651 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:23:48,658 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:23:48,658 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:23:48,658 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:23:48,659 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:23:48,660 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:23:48,661 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:23:48,662 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:23:48,662 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:23:48,663 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:23:48,663 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:23:48,664 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:23:48,664 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:23:48,665 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:23:48,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:23:48,667 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:23:48,668 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:23:48,669 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:23:48,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:23:48,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:23:48,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:23:48,672 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:23:48,672 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:23:48,673 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:23:48,673 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:23:48,674 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:23:48,674 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:23:48,675 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:23:48,675 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:23:48,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:23:48,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:23:48,676 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:23:48,676 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:23:48,677 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:23:48,677 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 03:23:48,686 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:23:48,686 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:23:48,686 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:23:48,687 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:23:48,687 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 03:23:48,687 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 03:23:48,687 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 03:23:48,687 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 03:23:48,687 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 03:23:48,687 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 03:23:48,687 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 03:23:48,688 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 03:23:48,688 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 03:23:48,688 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:23:48,688 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:23:48,688 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:23:48,689 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:23:48,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:23:48,689 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:23:48,689 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:23:48,689 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:23:48,689 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:23:48,689 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:23:48,689 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:23:48,690 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:23:48,690 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:23:48,690 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:23:48,690 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:23:48,690 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:23:48,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:23:48,690 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:23:48,691 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:23:48,691 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:23:48,691 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 03:23:48,691 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:23:48,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:23:48,691 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 03:23:48,691 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_cc20eefa-bc42-4f87-9d54-850a538ecdde/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 -> 98b359d4210eaa0693e17be51fa07ce179f3b890 [2018-11-23 03:23:48,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:23:48,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:23:48,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:23:48,724 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:23:48,724 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:23:48,724 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1211a_true-unreach-call.c [2018-11-23 03:23:48,759 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/data/5ae251620/e5efe9299618422f8a86d4799c369d59/FLAG315ddb099 [2018-11-23 03:23:49,181 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:23:49,181 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/sv-benchmarks/c/float-newlib/double_req_bl_1211a_true-unreach-call.c [2018-11-23 03:23:49,186 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/data/5ae251620/e5efe9299618422f8a86d4799c369d59/FLAG315ddb099 [2018-11-23 03:23:49,195 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/data/5ae251620/e5efe9299618422f8a86d4799c369d59 [2018-11-23 03:23:49,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:23:49,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:23:49,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:23:49,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:23:49,201 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:23:49,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:23:49" (1/1) ... [2018-11-23 03:23:49,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52fb40ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:49, skipping insertion in model container [2018-11-23 03:23:49,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:23:49" (1/1) ... [2018-11-23 03:23:49,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:23:49,227 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:23:49,348 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:23:49,356 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:23:49,384 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:23:49,429 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:23:49,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:49 WrapperNode [2018-11-23 03:23:49,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:23:49,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:23:49,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:23:49,430 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:23:49,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:49" (1/1) ... [2018-11-23 03:23:49,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:49" (1/1) ... [2018-11-23 03:23:49,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:23:49,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:23:49,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:23:49,447 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:23:49,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:49" (1/1) ... [2018-11-23 03:23:49,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:49" (1/1) ... [2018-11-23 03:23:49,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:49" (1/1) ... [2018-11-23 03:23:49,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:49" (1/1) ... [2018-11-23 03:23:49,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:49" (1/1) ... [2018-11-23 03:23:49,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:49" (1/1) ... [2018-11-23 03:23:49,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:49" (1/1) ... [2018-11-23 03:23:49,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:23:49,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:23:49,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:23:49,477 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:23:49,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/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 03:23:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 03:23:49,510 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 03:23:49,510 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 03:23:49,510 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 03:23:49,511 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:23:49,511 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:23:49,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 03:23:49,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:23:49,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:23:49,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:23:49,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 03:23:49,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:23:49,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:23:49,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:23:49,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2018-11-23 03:23:49,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:23:49,512 INFO L130 BoogieDeclarations]: Found specification of procedure modf_double [2018-11-23 03:23:49,512 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_double [2018-11-23 03:23:49,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:23:49,849 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:23:49,850 INFO L280 CfgBuilder]: Removed 24 assue(true) statements. [2018-11-23 03:23:49,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:23:49 BoogieIcfgContainer [2018-11-23 03:23:49,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:23:49,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:23:49,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:23:49,853 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:23:49,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:23:49" (1/3) ... [2018-11-23 03:23:49,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a551263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:23:49, skipping insertion in model container [2018-11-23 03:23:49,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:49" (2/3) ... [2018-11-23 03:23:49,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a551263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:23:49, skipping insertion in model container [2018-11-23 03:23:49,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:23:49" (3/3) ... [2018-11-23 03:23:49,856 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211a_true-unreach-call.c [2018-11-23 03:23:49,861 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:23:49,866 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:23:49,876 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:23:49,894 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:23:49,895 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:23:49,895 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:23:49,895 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:23:49,895 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:23:49,895 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:23:49,895 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:23:49,895 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:23:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-11-23 03:23:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 03:23:49,909 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:23:49,909 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 03:23:49,911 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:23:49,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:23:49,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1736210886, now seen corresponding path program 1 times [2018-11-23 03:23:49,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:23:49,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:23:49,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:23:49,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:23:49,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:23:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:23:50,010 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 03:23:50,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:23:50,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:23:50,012 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 03:23:50,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 03:23:50,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:23:50,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:23:50,023 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 2 states. [2018-11-23 03:23:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:23:50,040 INFO L93 Difference]: Finished difference Result 130 states and 194 transitions. [2018-11-23 03:23:50,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:23:50,041 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 03:23:50,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:23:50,049 INFO L225 Difference]: With dead ends: 130 [2018-11-23 03:23:50,049 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 03:23:50,052 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 03:23:50,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 03:23:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 03:23:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 03:23:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-11-23 03:23:50,076 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 27 [2018-11-23 03:23:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:23:50,077 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-11-23 03:23:50,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 03:23:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-11-23 03:23:50,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 03:23:50,078 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:23:50,078 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 03:23:50,078 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:23:50,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:23:50,078 INFO L82 PathProgramCache]: Analyzing trace with hash 884713430, now seen corresponding path program 1 times [2018-11-23 03:23:50,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:23:50,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:23:50,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:23:50,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:23:50,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:23:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:23:50,142 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 03:23:50,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:23:50,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:23:50,143 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 03:23:50,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:23:50,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:23:50,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:23:50,145 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 3 states. [2018-11-23 03:23:50,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:23:50,161 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-11-23 03:23:50,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:23:50,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 03:23:50,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:23:50,162 INFO L225 Difference]: With dead ends: 68 [2018-11-23 03:23:50,162 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 03:23:50,163 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 03:23:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 03:23:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 03:23:50,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 03:23:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-11-23 03:23:50,168 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 30 [2018-11-23 03:23:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:23:50,168 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-11-23 03:23:50,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:23:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-11-23 03:23:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 03:23:50,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:23:50,170 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 03:23:50,170 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:23:50,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:23:50,170 INFO L82 PathProgramCache]: Analyzing trace with hash -204320499, now seen corresponding path program 1 times [2018-11-23 03:23:50,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 03:23:50,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:23:50,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:23:50,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:23:50,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 03:23:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:23:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:23:50,277 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6442450954, |#NULL.offset|=6442450946, |old(#NULL.base)|=6442450954, |old(#NULL.offset)|=6442450946, |old(~one_modf~0)|=6442450951.0, ~one_modf~0=6442450951.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)|=6442450954, |old(#NULL.offset)|=6442450946, |old(~one_modf~0)|=6442450951.0, ~one_modf~0=1.0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450954, |old(#NULL.offset)|=6442450946, |old(~one_modf~0)|=6442450951.0, ~one_modf~0=1.0] [?] RET #215#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_modf~0=1.0] [?] CALL call #t~ret34 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~one_modf~0=1.0] [?] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0);call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.alloc(8);call write~init~real(#t~nondet27, ~#iptr~0.base, ~#iptr~0.offset, 8);havoc #t~nondet27; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] CALL call #t~ret28 := modf_double(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~i1~0;havoc ~j0~0;havoc ~i~0; VAL [modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union1;havoc #t~mem0;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] goto; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] assume ~j0~0 < 20; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~j0~0=(- 1), modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] assume ~j0~0 < 0; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~j0~0=(- 1), modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] call ~#iw_u~0.base, ~#iw_u~0.offset := #Ultimate.alloc(8);call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#iw_u~0.base, 4 + ~#iw_u~0.offset, 4);call write~int(0, ~#iw_u~0.base, ~#iw_u~0.offset, 4);call #t~mem4 := read~real(~#iw_u~0.base, ~#iw_u~0.offset, 8);call write~real(#t~mem4, ~iptr.base, ~iptr.offset, 8);havoc #t~mem4;call ULTIMATE.dealloc(~#iw_u~0.base, ~#iw_u~0.offset);havoc ~#iw_u~0.base, ~#iw_u~0.offset; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~j0~0=(- 1), modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] goto; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~j0~0=(- 1), modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, ~one_modf~0=1.0] [?] #res := ~x; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~j0~0=(- 1), modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, |modf_double_#res|=6442450962.0, ~one_modf~0=1.0] [?] assume true; VAL [modf_double_~i0~0=5, modf_double_~i1~0=2, modf_double_~iptr.base=6442450955, modf_double_~iptr.offset=0, modf_double_~j0~0=(- 1), modf_double_~x=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |modf_double_#in~iptr.base|=6442450955, |modf_double_#in~iptr.offset|=0, |modf_double_#in~x|=6442450962.0, |modf_double_#res|=6442450962.0, ~one_modf~0=1.0] [?] RET #209#return; VAL [main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret28|=6442450962.0, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] ~res~0 := #t~ret28;havoc #t~ret28;call #t~mem29 := read~real(~#iptr~0.base, ~#iptr~0.offset, 8); VAL [main_~res~0=6442450962.0, main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem29|=6442450953.0, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] CALL call #t~ret30 := isinf_double(#t~mem29); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450953.0, ~one_modf~0=1.0] [?] ~x := #in~x;havoc ~hx~0;havoc ~lx~0; VAL [isinf_double_~x=6442450953.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450953.0, ~one_modf~0=1.0] [?] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8);call #t~mem21 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4);~hx~0 := (if #t~mem21 % 4294967296 % 4294967296 <= 2147483647 then #t~mem21 % 4294967296 % 4294967296 else #t~mem21 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union22, ~#ew_u~1.base, ~#ew_u~1.offset, 8);havoc #t~union22;havoc #t~mem21;call #t~mem23 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4);~lx~0 := (if #t~mem23 % 4294967296 % 4294967296 <= 2147483647 then #t~mem23 % 4294967296 % 4294967296 else #t~mem23 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union24, ~#ew_u~1.base, ~#ew_u~1.offset, 8);havoc #t~union24;havoc #t~mem23;call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset);havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [isinf_double_~hx~0=2147483647, isinf_double_~lx~0=(- 2147483648), isinf_double_~x=6442450953.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450953.0, ~one_modf~0=1.0] [?] goto; VAL [isinf_double_~hx~0=2147483647, isinf_double_~lx~0=(- 2147483648), isinf_double_~x=6442450953.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450953.0, ~one_modf~0=1.0] [?] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647);~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);~hx~0 := 2146435072 - ~hx~0;#res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [isinf_double_~hx~0=2146435072, isinf_double_~lx~0=(- 2147483648), isinf_double_~x=6442450953.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450953.0, |isinf_double_#res|=2, ~one_modf~0=1.0] [?] assume true; VAL [isinf_double_~hx~0=2146435072, isinf_double_~lx~0=(- 2147483648), isinf_double_~x=6442450953.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450953.0, |isinf_double_#res|=2, ~one_modf~0=1.0] [?] RET #211#return; VAL [main_~res~0=6442450962.0, main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem29|=6442450953.0, |main_#t~ret30|=2, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647;#t~short33 := 0 != #t~ret30; VAL [main_~res~0=6442450962.0, main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem29|=6442450953.0, |main_#t~ret30|=2, |main_#t~short33|=true, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume #t~short33;#t~short32 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [main_~res~0=6442450962.0, main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem29|=6442450953.0, |main_#t~ret30|=2, |main_#t~short32|=false, |main_#t~short33|=true, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume !#t~short32; VAL [main_~res~0=6442450962.0, main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem29|=6442450953.0, |main_#t~ret30|=2, |main_#t~short32|=false, |main_#t~short33|=true, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] #t~short33 := !#t~short32; VAL [main_~res~0=6442450962.0, main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem29|=6442450953.0, |main_#t~ret30|=2, |main_#t~short32|=false, |main_#t~short33|=true, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume #t~short33;havoc #t~ret30;havoc #t~mem29;havoc #t~short32;havoc #t~short33;havoc #t~ret31; VAL [main_~res~0=6442450962.0, main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] assume !false; VAL [main_~res~0=6442450962.0, main_~x~0=6442450962.0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#iptr~0.base|=6442450955, |main_~#iptr~0.offset|=0, ~one_modf~0=1.0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450954, #NULL.offset=6442450946, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=6.442450951E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L18] ~one_modf~0 := 1.0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=1.0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret34 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L144] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L145] call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.alloc(8); [L145] call write~init~real(#t~nondet27, ~#iptr~0.base, ~#iptr~0.offset, 8); [L145] havoc #t~nondet27; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0] [L146] CALL call #t~ret28 := modf_double(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L20-L108] ~x := #in~x; [L20-L108] ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; [L21] havoc ~i0~0; [L21] havoc ~i1~0; [L21] havoc ~j0~0; [L22] havoc ~i~0; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~iptr.base=6442450955, ~iptr.offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L24] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L25] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L26] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L26] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L27] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L27] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L27] havoc #t~union3; [L27] havoc #t~mem2; [L24] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L24] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L29] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L30-L107] assume ~j0~0 < 20; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L31-L65] assume ~j0~0 < 0; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L33] call ~#iw_u~0.base, ~#iw_u~0.offset := #Ultimate.alloc(8); [L34] call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#iw_u~0.base, 4 + ~#iw_u~0.offset, 4); [L35] call write~int(0, ~#iw_u~0.base, ~#iw_u~0.offset, 4); [L36] call #t~mem4 := read~real(~#iw_u~0.base, ~#iw_u~0.offset, 8); [L36] call write~real(#t~mem4, ~iptr.base, ~iptr.offset, 8); [L36] havoc #t~mem4; [L33] call ULTIMATE.dealloc(~#iw_u~0.base, ~#iw_u~0.offset); [L33] havoc ~#iw_u~0.base, ~#iw_u~0.offset; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L38] #res := ~x; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, #res=6.442450962E9, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L20-L108] ensures true; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, #res=6.442450962E9, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L146] RET call #t~ret28 := modf_double(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret28=6.442450962E9, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~x~0=6.442450962E9] [L146] ~res~0 := #t~ret28; [L146] havoc #t~ret28; [L149] call #t~mem29 := read~real(~#iptr~0.base, ~#iptr~0.offset, 8); VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] CALL call #t~ret30 := isinf_double(#t~mem29); VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L111-L123] ~x := #in~x; [L112] havoc ~hx~0; [L112] havoc ~lx~0; VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0, ~x=6.442450953E9] [L114] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8); [L115] call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L116] call #t~mem21 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4); [L116] ~hx~0 := (if #t~mem21 % 4294967296 % 4294967296 <= 2147483647 then #t~mem21 % 4294967296 % 4294967296 else #t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] call write~real(#t~union22, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L116] havoc #t~union22; [L116] havoc #t~mem21; [L117] call #t~mem23 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4); [L117] ~lx~0 := (if #t~mem23 % 4294967296 % 4294967296 <= 2147483647 then #t~mem23 % 4294967296 % 4294967296 else #t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] call write~real(#t~union24, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L117] havoc #t~union24; [L117] havoc #t~mem23; [L114] call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset); [L114] havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, ~hx~0=2147483647, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L119] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L120] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] ~hx~0 := 2146435072 - ~hx~0; [L122] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, #res=2, ~hx~0=2146435072, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L111-L123] ensures true; VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, #res=2, ~hx~0=2146435072, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L149] RET call #t~ret30 := isinf_double(#t~mem29); VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647; [L149] #t~short33 := 0 != #t~ret30; VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short33=true, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume #t~short33; [L149] #t~short32 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume !#t~short32; VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] #t~short33 := !#t~short32; VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149-L152] assume #t~short33; [L149] havoc #t~ret30; [L149] havoc #t~mem29; [L149] havoc #t~short32; [L149] havoc #t~short33; [L149] havoc #t~ret31; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L150] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450954, #NULL.offset=6442450946, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=6.442450951E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L18] ~one_modf~0 := 1.0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=1.0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450954, old(#NULL.offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret34 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L144] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L145] call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.alloc(8); [L145] call write~init~real(#t~nondet27, ~#iptr~0.base, ~#iptr~0.offset, 8); [L145] havoc #t~nondet27; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0] [L146] CALL call #t~ret28 := modf_double(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L20-L108] ~x := #in~x; [L20-L108] ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; [L21] havoc ~i0~0; [L21] havoc ~i1~0; [L21] havoc ~j0~0; [L22] havoc ~i~0; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~iptr.base=6442450955, ~iptr.offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L24] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L25] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L26] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L26] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L27] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L27] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L27] havoc #t~union3; [L27] havoc #t~mem2; [L24] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L24] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L29] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L30-L107] assume ~j0~0 < 20; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L31-L65] assume ~j0~0 < 0; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L33] call ~#iw_u~0.base, ~#iw_u~0.offset := #Ultimate.alloc(8); [L34] call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#iw_u~0.base, 4 + ~#iw_u~0.offset, 4); [L35] call write~int(0, ~#iw_u~0.base, ~#iw_u~0.offset, 4); [L36] call #t~mem4 := read~real(~#iw_u~0.base, ~#iw_u~0.offset, 8); [L36] call write~real(#t~mem4, ~iptr.base, ~iptr.offset, 8); [L36] havoc #t~mem4; [L33] call ULTIMATE.dealloc(~#iw_u~0.base, ~#iw_u~0.offset); [L33] havoc ~#iw_u~0.base, ~#iw_u~0.offset; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L38] #res := ~x; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, #res=6.442450962E9, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L20-L108] ensures true; VAL [#in~iptr.base=6442450955, #in~iptr.offset=0, #in~x=6.442450962E9, #NULL.base=0, #NULL.offset=0, #res=6.442450962E9, ~i0~0=5, ~i1~0=2, ~iptr.base=6442450955, ~iptr.offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L146] RET call #t~ret28 := modf_double(~x~0, ~#iptr~0.base, ~#iptr~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret28=6.442450962E9, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~x~0=6.442450962E9] [L146] ~res~0 := #t~ret28; [L146] havoc #t~ret28; [L149] call #t~mem29 := read~real(~#iptr~0.base, ~#iptr~0.offset, 8); VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] CALL call #t~ret30 := isinf_double(#t~mem29); VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0] [L111-L123] ~x := #in~x; [L112] havoc ~hx~0; [L112] havoc ~lx~0; VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, ~one_modf~0=1.0, ~x=6.442450953E9] [L114] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8); [L115] call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L116] call #t~mem21 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4); [L116] ~hx~0 := (if #t~mem21 % 4294967296 % 4294967296 <= 2147483647 then #t~mem21 % 4294967296 % 4294967296 else #t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] call write~real(#t~union22, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L116] havoc #t~union22; [L116] havoc #t~mem21; [L117] call #t~mem23 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4); [L117] ~lx~0 := (if #t~mem23 % 4294967296 % 4294967296 <= 2147483647 then #t~mem23 % 4294967296 % 4294967296 else #t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] call write~real(#t~union24, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L117] havoc #t~union24; [L117] havoc #t~mem23; [L114] call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset); [L114] havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, ~hx~0=2147483647, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L119] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L120] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] ~hx~0 := 2146435072 - ~hx~0; [L122] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, #res=2, ~hx~0=2146435072, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L111-L123] ensures true; VAL [#in~x=6.442450953E9, #NULL.base=0, #NULL.offset=0, #res=2, ~hx~0=2146435072, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L149] RET call #t~ret30 := isinf_double(#t~mem29); VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647; [L149] #t~short33 := 0 != #t~ret30; VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short33=true, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume #t~short33; [L149] #t~short32 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume !#t~short32; VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] #t~short33 := !#t~short32; VAL [#NULL.base=0, #NULL.offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149-L152] assume #t~short33; [L149] havoc #t~ret30; [L149] havoc #t~mem29; [L149] havoc #t~short32; [L149] havoc #t~short33; [L149] havoc #t~ret31; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L150] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#iptr~0.base=6442450955, ~#iptr~0.offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450954, #NULL!offset=6442450946, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=6.442450951E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18] ~one_modf~0 := 1.0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret34 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L144] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L145] FCALL call ~#iptr~0 := #Ultimate.alloc(8); [L145] FCALL call write~init~real(#t~nondet27, ~#iptr~0, 8); [L145] havoc #t~nondet27; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0] [L146] CALL call #t~ret28 := modf_double(~x~0, ~#iptr~0); VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L20-L108] ~x := #in~x; [L20-L108] ~iptr := #in~iptr; [L21] havoc ~i0~0; [L21] havoc ~i1~0; [L21] havoc ~j0~0; [L22] havoc ~i~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L24] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L25] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L26] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L27] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L27] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L27] havoc #t~union3; [L27] havoc #t~mem2; [L24] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L24] havoc ~#ew_u~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L29] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L30] COND TRUE ~j0~0 < 20 VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L31] COND TRUE ~j0~0 < 0 VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L33] FCALL call ~#iw_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#iw_u~0!base, offset: 4 + ~#iw_u~0!offset }, 4); [L35] FCALL call write~int(0, { base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 8); [L36] FCALL call write~real(#t~mem4, ~iptr, 8); [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#iw_u~0); [L33] havoc ~#iw_u~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L38] #res := ~x; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, #res=6.442450962E9, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L146] RET call #t~ret28 := modf_double(~x~0, ~#iptr~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret28=6.442450962E9, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~x~0=6.442450962E9] [L146] ~res~0 := #t~ret28; [L146] havoc #t~ret28; [L149] FCALL call #t~mem29 := read~real(~#iptr~0, 8); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] CALL call #t~ret30 := isinf_double(#t~mem29); VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L111-L123] ~x := #in~x; [L112] havoc ~hx~0; [L112] havoc ~lx~0; VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0, ~x=6.442450953E9] [L114] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L115] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] FCALL call #t~mem21 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L116] ~hx~0 := (if #t~mem21 % 4294967296 % 4294967296 <= 2147483647 then #t~mem21 % 4294967296 % 4294967296 else #t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] FCALL call write~real(#t~union22, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] havoc #t~union22; [L116] havoc #t~mem21; [L117] FCALL call #t~mem23 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L117] ~lx~0 := (if #t~mem23 % 4294967296 % 4294967296 <= 2147483647 then #t~mem23 % 4294967296 % 4294967296 else #t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] FCALL call write~real(#t~union24, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L117] havoc #t~union24; [L117] havoc #t~mem23; [L114] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L114] havoc ~#ew_u~1; VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~hx~0=2147483647, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L119] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L120] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] ~hx~0 := 2146435072 - ~hx~0; [L122] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, #res=2, ~hx~0=2146435072, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L149] RET call #t~ret30 := isinf_double(#t~mem29); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647; [L149] #t~short33 := 0 != #t~ret30; VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND TRUE #t~short33 [L149] #t~short32 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND FALSE !(#t~short32) VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] #t~short33 := !#t~short32; VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND TRUE #t~short33 [L149] havoc #t~ret30; [L149] havoc #t~mem29; [L149] havoc #t~short32; [L149] havoc #t~short33; [L149] havoc #t~ret31; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L150] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450954, #NULL!offset=6442450946, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=6.442450951E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18] ~one_modf~0 := 1.0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret34 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L144] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L145] FCALL call ~#iptr~0 := #Ultimate.alloc(8); [L145] FCALL call write~init~real(#t~nondet27, ~#iptr~0, 8); [L145] havoc #t~nondet27; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0] [L146] CALL call #t~ret28 := modf_double(~x~0, ~#iptr~0); VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L20-L108] ~x := #in~x; [L20-L108] ~iptr := #in~iptr; [L21] havoc ~i0~0; [L21] havoc ~i1~0; [L21] havoc ~j0~0; [L22] havoc ~i~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L24] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L25] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L26] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L27] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L27] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L27] havoc #t~union3; [L27] havoc #t~mem2; [L24] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L24] havoc ~#ew_u~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L29] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L30] COND TRUE ~j0~0 < 20 VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L31] COND TRUE ~j0~0 < 0 VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L33] FCALL call ~#iw_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#iw_u~0!base, offset: 4 + ~#iw_u~0!offset }, 4); [L35] FCALL call write~int(0, { base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 8); [L36] FCALL call write~real(#t~mem4, ~iptr, 8); [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#iw_u~0); [L33] havoc ~#iw_u~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L38] #res := ~x; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, #res=6.442450962E9, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L146] RET call #t~ret28 := modf_double(~x~0, ~#iptr~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret28=6.442450962E9, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~x~0=6.442450962E9] [L146] ~res~0 := #t~ret28; [L146] havoc #t~ret28; [L149] FCALL call #t~mem29 := read~real(~#iptr~0, 8); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] CALL call #t~ret30 := isinf_double(#t~mem29); VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L111-L123] ~x := #in~x; [L112] havoc ~hx~0; [L112] havoc ~lx~0; VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0, ~x=6.442450953E9] [L114] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L115] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] FCALL call #t~mem21 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L116] ~hx~0 := (if #t~mem21 % 4294967296 % 4294967296 <= 2147483647 then #t~mem21 % 4294967296 % 4294967296 else #t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] FCALL call write~real(#t~union22, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] havoc #t~union22; [L116] havoc #t~mem21; [L117] FCALL call #t~mem23 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L117] ~lx~0 := (if #t~mem23 % 4294967296 % 4294967296 <= 2147483647 then #t~mem23 % 4294967296 % 4294967296 else #t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] FCALL call write~real(#t~union24, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L117] havoc #t~union24; [L117] havoc #t~mem23; [L114] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L114] havoc ~#ew_u~1; VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~hx~0=2147483647, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L119] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L120] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] ~hx~0 := 2146435072 - ~hx~0; [L122] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, #res=2, ~hx~0=2146435072, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L149] RET call #t~ret30 := isinf_double(#t~mem29); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647; [L149] #t~short33 := 0 != #t~ret30; VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND TRUE #t~short33 [L149] #t~short32 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND FALSE !(#t~short32) VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] #t~short33 := !#t~short32; VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND TRUE #t~short33 [L149] havoc #t~ret30; [L149] havoc #t~mem29; [L149] havoc #t~short32; [L149] havoc #t~short33; [L149] havoc #t~ret31; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L150] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450954, #NULL!offset=6442450946, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=6.442450951E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18] ~one_modf~0 := 1.0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret34 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L144] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L145] FCALL call ~#iptr~0 := #Ultimate.alloc(8); [L145] FCALL call write~init~real(#t~nondet27, ~#iptr~0, 8); [L145] havoc #t~nondet27; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0] [L146] CALL call #t~ret28 := modf_double(~x~0, ~#iptr~0); VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L20-L108] ~x := #in~x; [L20-L108] ~iptr := #in~iptr; [L21] havoc ~i0~0; [L21] havoc ~i1~0; [L21] havoc ~j0~0; [L22] havoc ~i~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L24] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L25] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L26] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L27] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L27] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L27] havoc #t~union3; [L27] havoc #t~mem2; [L24] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L24] havoc ~#ew_u~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L29] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L30] COND TRUE ~j0~0 < 20 VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L31] COND TRUE ~j0~0 < 0 VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L33] FCALL call ~#iw_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#iw_u~0!base, offset: 4 + ~#iw_u~0!offset }, 4); [L35] FCALL call write~int(0, { base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 8); [L36] FCALL call write~real(#t~mem4, ~iptr, 8); [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#iw_u~0); [L33] havoc ~#iw_u~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L38] #res := ~x; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, #res=6.442450962E9, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L146] RET call #t~ret28 := modf_double(~x~0, ~#iptr~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret28=6.442450962E9, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~x~0=6.442450962E9] [L146] ~res~0 := #t~ret28; [L146] havoc #t~ret28; [L149] FCALL call #t~mem29 := read~real(~#iptr~0, 8); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] CALL call #t~ret30 := isinf_double(#t~mem29); VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L111-L123] ~x := #in~x; [L112] havoc ~hx~0; [L112] havoc ~lx~0; VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0, ~x=6.442450953E9] [L114] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L115] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] FCALL call #t~mem21 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L116] ~hx~0 := (if #t~mem21 % 4294967296 % 4294967296 <= 2147483647 then #t~mem21 % 4294967296 % 4294967296 else #t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] FCALL call write~real(#t~union22, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] havoc #t~union22; [L116] havoc #t~mem21; [L117] FCALL call #t~mem23 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L117] ~lx~0 := (if #t~mem23 % 4294967296 % 4294967296 <= 2147483647 then #t~mem23 % 4294967296 % 4294967296 else #t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] FCALL call write~real(#t~union24, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L117] havoc #t~union24; [L117] havoc #t~mem23; [L114] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L114] havoc ~#ew_u~1; VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~hx~0=2147483647, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L119] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L120] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] ~hx~0 := 2146435072 - ~hx~0; [L122] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, #res=2, ~hx~0=2146435072, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L149] RET call #t~ret30 := isinf_double(#t~mem29); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647; [L149] #t~short33 := 0 != #t~ret30; VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND TRUE #t~short33 [L149] #t~short32 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND FALSE !(#t~short32) VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] #t~short33 := !#t~short32; VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND TRUE #t~short33 [L149] havoc #t~ret30; [L149] havoc #t~mem29; [L149] havoc #t~short32; [L149] havoc #t~short33; [L149] havoc #t~ret31; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L150] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450954, #NULL!offset=6442450946, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=6.442450951E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L18] ~one_modf~0 := 1.0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450954, old(#NULL!offset)=6442450946, old(~one_modf~0)=6.442450951E9, ~one_modf~0=1.0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [?] CALL call #t~ret34 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L144] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L145] FCALL call ~#iptr~0 := #Ultimate.alloc(8); [L145] FCALL call write~init~real(#t~nondet27, ~#iptr~0, 8); [L145] havoc #t~nondet27; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0] [L146] CALL call #t~ret28 := modf_double(~x~0, ~#iptr~0); VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L20-L108] ~x := #in~x; [L20-L108] ~iptr := #in~iptr; [L21] havoc ~i0~0; [L21] havoc ~i1~0; [L21] havoc ~j0~0; [L22] havoc ~i~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L24] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L25] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L26] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union1; [L26] havoc #t~mem0; [L27] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L27] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L27] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L27] havoc #t~union3; [L27] havoc #t~mem2; [L24] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L24] havoc ~#ew_u~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L29] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~one_modf~0=1.0, ~x=6.442450962E9] [L30] COND TRUE ~j0~0 < 20 VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L31] COND TRUE ~j0~0 < 0 VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L33] FCALL call ~#iw_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~int(~bitwiseAnd(~i0~0, 2147483648), { base: ~#iw_u~0!base, offset: 4 + ~#iw_u~0!offset }, 4); [L35] FCALL call write~int(0, { base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#iw_u~0!base, offset: ~#iw_u~0!offset }, 8); [L36] FCALL call write~real(#t~mem4, ~iptr, 8); [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#iw_u~0); [L33] havoc ~#iw_u~0; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L38] #res := ~x; VAL [#in~iptr!base=6442450955, #in~iptr!offset=0, #in~x=6.442450962E9, #NULL!base=0, #NULL!offset=0, #res=6.442450962E9, ~i0~0=5, ~i1~0=2, ~iptr!base=6442450955, ~iptr!offset=0, ~j0~0=-1, ~one_modf~0=1.0, ~x=6.442450962E9] [L146] RET call #t~ret28 := modf_double(~x~0, ~#iptr~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret28=6.442450962E9, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~x~0=6.442450962E9] [L146] ~res~0 := #t~ret28; [L146] havoc #t~ret28; [L149] FCALL call #t~mem29 := read~real(~#iptr~0, 8); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] CALL call #t~ret30 := isinf_double(#t~mem29); VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0] [L111-L123] ~x := #in~x; [L112] havoc ~hx~0; [L112] havoc ~lx~0; VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~one_modf~0=1.0, ~x=6.442450953E9] [L114] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L115] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] FCALL call #t~mem21 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L116] ~hx~0 := (if #t~mem21 % 4294967296 % 4294967296 <= 2147483647 then #t~mem21 % 4294967296 % 4294967296 else #t~mem21 % 4294967296 % 4294967296 - 4294967296); [L116] FCALL call write~real(#t~union22, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L116] havoc #t~union22; [L116] havoc #t~mem21; [L117] FCALL call #t~mem23 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L117] ~lx~0 := (if #t~mem23 % 4294967296 % 4294967296 <= 2147483647 then #t~mem23 % 4294967296 % 4294967296 else #t~mem23 % 4294967296 % 4294967296 - 4294967296); [L117] FCALL call write~real(#t~union24, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L117] havoc #t~union24; [L117] havoc #t~mem23; [L114] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L114] havoc ~#ew_u~1; VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, ~hx~0=2147483647, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L119] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L120] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L121] ~hx~0 := 2146435072 - ~hx~0; [L122] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450953E9, #NULL!base=0, #NULL!offset=0, #res=2, ~hx~0=2146435072, ~lx~0=-2147483648, ~one_modf~0=1.0, ~x=6.442450953E9] [L149] RET call #t~ret30 := isinf_double(#t~mem29); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647; [L149] #t~short33 := 0 != #t~ret30; VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND TRUE #t~short33 [L149] #t~short32 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND FALSE !(#t~short32) VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] #t~short33 := !#t~short32; VAL [#NULL!base=0, #NULL!offset=0, #t~mem29=6.442450953E9, #t~ret30=2, #t~short32=false, #t~short33=true, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L149] COND TRUE #t~short33 [L149] havoc #t~ret30; [L149] havoc #t~mem29; [L149] havoc #t~short32; [L149] havoc #t~short33; [L149] havoc #t~ret31; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L150] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#iptr~0!base=6442450955, ~#iptr~0!offset=0, ~one_modf~0=1.0, ~res~0=6.442450962E9, ~x~0=6.442450962E9] [L18] static const double one_modf = 1.0; VAL [\old(one_modf)=6442450951, one_modf=1] [L144] double x = 1.0 / 0.0; [L145] double iptr = __VERIFIER_nondet_double(); [L146] CALL, EXPR modf_double(x, &iptr) VAL [\old(x)=6442450962, iptr={6442450955:0}, one_modf=1] [L21] __int32_t i0, i1, j0; [L22] __uint32_t i; VAL [\old(x)=6442450962, iptr={6442450955:0}, iptr={6442450955:0}, one_modf=1, x=6442450962] [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (i0) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (i1) = ew_u.parts.lsw [L29] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=6442450962, i0=5, i1=2, iptr={6442450955:0}, iptr={6442450955:0}, one_modf=1, x=6442450962] [L30] COND TRUE j0 < 20 VAL [\old(x)=6442450962, i0=5, i1=2, iptr={6442450955:0}, iptr={6442450955:0}, j0=-1, one_modf=1, x=6442450962] [L31] COND TRUE j0 < 0 VAL [\old(x)=6442450962, i0=5, i1=2, iptr={6442450955:0}, iptr={6442450955:0}, j0=-1, one_modf=1, x=6442450962] [L33] ieee_double_shape_type iw_u; [L34] iw_u.parts.msw = (i0 & 0x80000000) [L35] iw_u.parts.lsw = (0) [L36] EXPR iw_u.value [L36] (*iptr) = iw_u.value [L38] return x; VAL [\old(x)=6442450962, \result=6442450962, i0=5, i1=2, iptr={6442450955:0}, iptr={6442450955:0}, j0=-1, one_modf=1, x=6442450962] [L146] RET, EXPR modf_double(x, &iptr) VAL [iptr={6442450955:0}, modf_double(x, &iptr)=6442450962, one_modf=1, x=6442450962] [L146] double res = modf_double(x, &iptr); [L149] EXPR \read(iptr) VAL [\read(iptr)=6442450953, iptr={6442450955:0}, one_modf=1, res=6442450962, x=6442450962] [L149] CALL, EXPR isinf_double(iptr) VAL [\old(x)=6442450953, one_modf=1] [L112] __int32_t hx, lx; VAL [\old(x)=6442450953, one_modf=1, x=6442450953] [L114] ieee_double_shape_type ew_u; [L115] ew_u.value = (x) [L116] EXPR ew_u.parts.msw [L116] (hx) = ew_u.parts.msw [L117] EXPR ew_u.parts.lsw [L117] (lx) = ew_u.parts.lsw [L119] hx &= 0x7fffffff [L120] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L121] hx = 0x7ff00000 - hx [L122] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=6442450953, \result=2, hx=2146435072, lx=-2147483648, one_modf=1, x=6442450953] [L149] RET, EXPR isinf_double(iptr) VAL [\read(iptr)=6442450953, iptr={6442450955:0}, isinf_double(iptr)=2, one_modf=1, res=6442450962, x=6442450962] [L149] isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) [L149] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [\read(iptr)=6442450953, iptr={6442450955:0}, isinf_double(iptr)=2, isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0)=1, one_modf=1, res=6442450962, res == 0.0 && __signbit_double(res) == 0=0, x=6442450962] [L149] isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) VAL [\read(iptr)=6442450953, iptr={6442450955:0}, isinf_double(iptr)=2, isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0)=1, one_modf=1, res=6442450962, res == 0.0 && __signbit_double(res) == 0=0, x=6442450962] [L149] COND TRUE isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) [L150] __VERIFIER_error() VAL [iptr={6442450955:0}, one_modf=1, res=6442450962, x=6442450962] ----- [2018-11-23 03:23:50,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:23:50 BoogieIcfgContainer [2018-11-23 03:23:50,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:23:50,342 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:23:50,342 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:23:50,342 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:23:50,343 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:23:49" (3/4) ... [2018-11-23 03:23:50,346 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:23:50,346 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:23:50,347 INFO L168 Benchmark]: Toolchain (without parser) took 1149.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 958.1 MB in the beginning and 1.0 GB in the end (delta: -89.5 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:23:50,348 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:23:50,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:23:50,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.94 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:23:50,350 INFO L168 Benchmark]: Boogie Preprocessor took 29.14 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:23:50,350 INFO L168 Benchmark]: RCFGBuilder took 373.95 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: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:23:50,351 INFO L168 Benchmark]: TraceAbstraction took 491.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. [2018-11-23 03:23:50,351 INFO L168 Benchmark]: Witness Printer took 4.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:23:50,354 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 230.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.94 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.14 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 373.95 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: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 491.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 150]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 144, overapproximation of bitwiseAnd at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 149. Possible FailurePath: [L18] static const double one_modf = 1.0; VAL [\old(one_modf)=6442450951, one_modf=1] [L144] double x = 1.0 / 0.0; [L145] double iptr = __VERIFIER_nondet_double(); [L146] CALL, EXPR modf_double(x, &iptr) VAL [\old(x)=6442450962, iptr={6442450955:0}, one_modf=1] [L21] __int32_t i0, i1, j0; [L22] __uint32_t i; VAL [\old(x)=6442450962, iptr={6442450955:0}, iptr={6442450955:0}, one_modf=1, x=6442450962] [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (i0) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (i1) = ew_u.parts.lsw [L29] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=6442450962, i0=5, i1=2, iptr={6442450955:0}, iptr={6442450955:0}, one_modf=1, x=6442450962] [L30] COND TRUE j0 < 20 VAL [\old(x)=6442450962, i0=5, i1=2, iptr={6442450955:0}, iptr={6442450955:0}, j0=-1, one_modf=1, x=6442450962] [L31] COND TRUE j0 < 0 VAL [\old(x)=6442450962, i0=5, i1=2, iptr={6442450955:0}, iptr={6442450955:0}, j0=-1, one_modf=1, x=6442450962] [L33] ieee_double_shape_type iw_u; [L34] iw_u.parts.msw = (i0 & 0x80000000) [L35] iw_u.parts.lsw = (0) [L36] EXPR iw_u.value [L36] (*iptr) = iw_u.value [L38] return x; VAL [\old(x)=6442450962, \result=6442450962, i0=5, i1=2, iptr={6442450955:0}, iptr={6442450955:0}, j0=-1, one_modf=1, x=6442450962] [L146] RET, EXPR modf_double(x, &iptr) VAL [iptr={6442450955:0}, modf_double(x, &iptr)=6442450962, one_modf=1, x=6442450962] [L146] double res = modf_double(x, &iptr); [L149] EXPR \read(iptr) VAL [\read(iptr)=6442450953, iptr={6442450955:0}, one_modf=1, res=6442450962, x=6442450962] [L149] CALL, EXPR isinf_double(iptr) VAL [\old(x)=6442450953, one_modf=1] [L112] __int32_t hx, lx; VAL [\old(x)=6442450953, one_modf=1, x=6442450953] [L114] ieee_double_shape_type ew_u; [L115] ew_u.value = (x) [L116] EXPR ew_u.parts.msw [L116] (hx) = ew_u.parts.msw [L117] EXPR ew_u.parts.lsw [L117] (lx) = ew_u.parts.lsw [L119] hx &= 0x7fffffff [L120] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L121] hx = 0x7ff00000 - hx [L122] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=6442450953, \result=2, hx=2146435072, lx=-2147483648, one_modf=1, x=6442450953] [L149] RET, EXPR isinf_double(iptr) VAL [\read(iptr)=6442450953, iptr={6442450955:0}, isinf_double(iptr)=2, one_modf=1, res=6442450962, x=6442450962] [L149] isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) [L149] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [\read(iptr)=6442450953, iptr={6442450955:0}, isinf_double(iptr)=2, isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0)=1, one_modf=1, res=6442450962, res == 0.0 && __signbit_double(res) == 0=0, x=6442450962] [L149] isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) VAL [\read(iptr)=6442450953, iptr={6442450955:0}, isinf_double(iptr)=2, isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0)=1, one_modf=1, res=6442450962, res == 0.0 && __signbit_double(res) == 0=0, x=6442450962] [L149] COND TRUE isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) [L150] __VERIFIER_error() VAL [iptr={6442450955:0}, one_modf=1, res=6442450962, x=6442450962] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 69 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 146 SDtfs, 0 SDslu, 66 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=69occurred 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 03:23:51,791 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:23:51,792 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:23:51,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:23:51,801 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:23:51,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:23:51,803 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:23:51,804 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:23:51,805 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:23:51,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:23:51,806 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:23:51,806 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:23:51,807 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:23:51,807 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:23:51,808 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:23:51,809 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:23:51,809 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:23:51,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:23:51,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:23:51,813 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:23:51,813 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:23:51,814 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:23:51,816 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:23:51,816 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:23:51,816 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:23:51,817 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:23:51,817 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:23:51,818 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:23:51,818 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:23:51,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:23:51,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:23:51,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:23:51,820 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:23:51,820 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:23:51,821 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:23:51,821 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:23:51,821 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 03:23:51,832 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:23:51,832 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:23:51,833 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:23:51,833 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:23:51,833 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 03:23:51,833 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 03:23:51,833 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 03:23:51,833 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 03:23:51,834 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 03:23:51,834 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 03:23:51,834 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:23:51,834 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:23:51,834 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:23:51,835 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:23:51,835 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:23:51,835 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:23:51,835 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:23:51,835 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 03:23:51,835 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 03:23:51,835 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:23:51,835 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:23:51,836 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:23:51,836 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:23:51,836 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:23:51,836 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:23:51,836 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:23:51,836 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:23:51,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:23:51,837 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:23:51,837 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:23:51,837 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:23:51,837 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 03:23:51,837 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:23:51,837 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 03:23:51,837 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 03:23:51,837 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_cc20eefa-bc42-4f87-9d54-850a538ecdde/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 -> 98b359d4210eaa0693e17be51fa07ce179f3b890 [2018-11-23 03:23:51,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:23:51,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:23:51,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:23:51,875 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:23:51,875 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:23:51,876 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1211a_true-unreach-call.c [2018-11-23 03:23:51,909 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/data/b29e7ce1e/98429b9f555c4d3d83f18a6312f8cba4/FLAG97c32bd4e [2018-11-23 03:23:52,209 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:23:52,209 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/sv-benchmarks/c/float-newlib/double_req_bl_1211a_true-unreach-call.c [2018-11-23 03:23:52,213 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/data/b29e7ce1e/98429b9f555c4d3d83f18a6312f8cba4/FLAG97c32bd4e [2018-11-23 03:23:52,221 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/data/b29e7ce1e/98429b9f555c4d3d83f18a6312f8cba4 [2018-11-23 03:23:52,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:23:52,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:23:52,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:23:52,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:23:52,227 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:23:52,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:23:52" (1/1) ... [2018-11-23 03:23:52,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@748ee420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:52, skipping insertion in model container [2018-11-23 03:23:52,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:23:52" (1/1) ... [2018-11-23 03:23:52,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:23:52,258 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:23:52,404 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:23:52,415 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:23:52,448 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:23:52,462 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:23:52,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:52 WrapperNode [2018-11-23 03:23:52,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:23:52,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:23:52,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:23:52,464 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:23:52,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:52" (1/1) ... [2018-11-23 03:23:52,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:52" (1/1) ... [2018-11-23 03:23:52,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:23:52,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:23:52,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:23:52,485 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:23:52,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:52" (1/1) ... [2018-11-23 03:23:52,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:52" (1/1) ... [2018-11-23 03:23:52,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:52" (1/1) ... [2018-11-23 03:23:52,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:52" (1/1) ... [2018-11-23 03:23:52,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:52" (1/1) ... [2018-11-23 03:23:52,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:52" (1/1) ... [2018-11-23 03:23:52,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:52" (1/1) ... [2018-11-23 03:23:52,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:23:52,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:23:52,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:23:52,560 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:23:52,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/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 03:23:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 03:23:52,592 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 03:23:52,592 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 03:23:52,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 03:23:52,593 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 03:23:52,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 03:23:52,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:23:52,593 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:23:52,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:23:52,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:23:52,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2018-11-23 03:23:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:23:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 03:23:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:23:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:23:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure modf_double [2018-11-23 03:23:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_double [2018-11-23 03:23:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 03:23:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:23:52,713 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:23:52,742 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:23:52,774 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:23:53,102 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:23:53,118 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:23:53,139 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:23:53,152 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:23:53,183 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:23:53,195 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:23:53,271 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:23:53,282 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:23:53,292 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:23:53,327 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:23:53,329 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:23:53,330 INFO L280 CfgBuilder]: Removed 24 assue(true) statements. [2018-11-23 03:23:53,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:23:53 BoogieIcfgContainer [2018-11-23 03:23:53,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:23:53,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:23:53,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:23:53,333 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:23:53,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:23:52" (1/3) ... [2018-11-23 03:23:53,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b46055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:23:53, skipping insertion in model container [2018-11-23 03:23:53,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:52" (2/3) ... [2018-11-23 03:23:53,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b46055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:23:53, skipping insertion in model container [2018-11-23 03:23:53,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:23:53" (3/3) ... [2018-11-23 03:23:53,336 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211a_true-unreach-call.c [2018-11-23 03:23:53,344 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:23:53,350 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:23:53,363 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:23:53,383 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:23:53,383 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:23:53,383 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:23:53,384 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:23:53,384 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:23:53,384 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:23:53,384 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:23:53,384 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:23:53,384 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:23:53,393 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-11-23 03:23:53,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 03:23:53,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:23:53,398 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 03:23:53,399 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:23:53,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:23:53,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1736210886, now seen corresponding path program 1 times [2018-11-23 03:23:53,406 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 03:23:53,406 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/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 03:23:53,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:23:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:23:53,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:23:53,483 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 03:23:53,483 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 03:23:53,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:23:53,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:23:53,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 03:23:53,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:23:53,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:23:53,503 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 2 states. [2018-11-23 03:23:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:23:53,522 INFO L93 Difference]: Finished difference Result 130 states and 194 transitions. [2018-11-23 03:23:53,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:23:53,523 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 03:23:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:23:53,529 INFO L225 Difference]: With dead ends: 130 [2018-11-23 03:23:53,529 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 03:23:53,532 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 03:23:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 03:23:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 03:23:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 03:23:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-11-23 03:23:53,558 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 27 [2018-11-23 03:23:53,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:23:53,559 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-11-23 03:23:53,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 03:23:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-11-23 03:23:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 03:23:53,560 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:23:53,560 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 03:23:53,560 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:23:53,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:23:53,561 INFO L82 PathProgramCache]: Analyzing trace with hash 884713430, now seen corresponding path program 1 times [2018-11-23 03:23:53,561 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 03:23:53,562 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/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 03:23:53,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:23:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:23:53,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:23:53,784 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 03:23:53,784 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 03:23:53,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:23:53,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 03:23:53,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 03:23:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 03:23:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:23:53,798 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 7 states. [2018-11-23 03:23:54,206 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 03:23:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:23:55,798 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-11-23 03:23:55,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 03:23:55,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-23 03:23:55,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:23:55,802 INFO L225 Difference]: With dead ends: 94 [2018-11-23 03:23:55,802 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 03:23:55,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 03:23:55,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 03:23:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-23 03:23:55,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 03:23:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-23 03:23:55,810 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 30 [2018-11-23 03:23:55,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:23:55,810 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-23 03:23:55,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 03:23:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 03:23:55,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 03:23:55,811 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:23:55,812 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 03:23:55,812 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:23:55,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:23:55,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1849312616, now seen corresponding path program 1 times [2018-11-23 03:23:55,813 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 03:23:55,813 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/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 03:23:55,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:23:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:23:55,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:23:56,078 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 03:23:56,079 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 03:23:56,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:23:56,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 03:23:56,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 03:23:56,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 03:23:56,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:23:56,094 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 7 states. [2018-11-23 03:23:57,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:23:57,751 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-11-23 03:23:57,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 03:23:57,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-23 03:23:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:23:57,753 INFO L225 Difference]: With dead ends: 79 [2018-11-23 03:23:57,754 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 03:23:57,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 03:23:57,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 03:23:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 03:23:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 03:23:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-11-23 03:23:57,759 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 31 [2018-11-23 03:23:57,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:23:57,759 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-23 03:23:57,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 03:23:57,759 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 03:23:57,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 03:23:57,760 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:23:57,760 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 03:23:57,761 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:23:57,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:23:57,761 INFO L82 PathProgramCache]: Analyzing trace with hash 109713720, now seen corresponding path program 1 times [2018-11-23 03:23:57,761 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 03:23:57,761 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/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 03:23:57,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:23:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:23:58,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:23:58,028 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 03:23:58,028 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 03:23:58,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:23:58,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:23:58,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:23:58,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:23:58,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:23:58,044 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 3 states. [2018-11-23 03:23:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:23:58,053 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 03:23:58,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:23:58,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 03:23:58,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:23:58,054 INFO L225 Difference]: With dead ends: 46 [2018-11-23 03:23:58,054 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 03:23:58,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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 03:23:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 03:23:58,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 03:23:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 03:23:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-23 03:23:58,057 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 32 [2018-11-23 03:23:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:23:58,057 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-23 03:23:58,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:23:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-23 03:23:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 03:23:58,058 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:23:58,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:23:58,059 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:23:58,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:23:58,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1949699601, now seen corresponding path program 1 times [2018-11-23 03:23:58,059 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 03:23:58,059 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/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 03:23:58,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:23:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:23:58,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:23:58,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-11-23 03:23:58,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-23 03:23:58,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-23 03:23:58,334 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 03:23:58,338 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:23:58,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:23:58,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 03:23:58,342 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2018-11-23 03:23:58,405 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 03:23:58,405 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 03:23:58,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:23:58,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 03:23:58,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 03:23:58,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 03:23:58,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:23:58,416 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 7 states. [2018-11-23 03:23:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:23:58,967 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2018-11-23 03:23:58,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 03:23:58,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-23 03:23:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:23:58,968 INFO L225 Difference]: With dead ends: 47 [2018-11-23 03:23:58,968 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 03:23:58,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 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 03:23:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 03:23:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 03:23:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 03:23:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2018-11-23 03:23:58,974 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 34 [2018-11-23 03:23:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:23:58,975 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2018-11-23 03:23:58,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 03:23:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2018-11-23 03:23:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 03:23:58,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:23:58,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:23:58,976 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:23:58,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:23:58,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1420899646, now seen corresponding path program 1 times [2018-11-23 03:23:58,977 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 03:23:58,977 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 03:23:58,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:23:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:23:59,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:23:59,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-23 03:23:59,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-23 03:23:59,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 03:23:59,312 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 03:23:59,314 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:23:59,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:23:59,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 03:23:59,331 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:34 [2018-11-23 03:23:59,712 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 03:23:59,712 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 03:23:59,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:23:59,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 03:23:59,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 03:23:59,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 03:23:59,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-23 03:23:59,729 INFO L87 Difference]: Start difference. First operand 43 states and 42 transitions. Second operand 15 states. [2018-11-23 03:24:06,007 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 03:24:06,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:24:06,857 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2018-11-23 03:24:06,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 03:24:06,858 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-11-23 03:24:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:24:06,858 INFO L225 Difference]: With dead ends: 43 [2018-11-23 03:24:06,858 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 03:24:06,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-11-23 03:24:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 03:24:06,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 03:24:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 03:24:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 03:24:06,859 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-11-23 03:24:06,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:24:06,859 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:24:06,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 03:24:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 03:24:06,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 03:24:06,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 03:24:07,349 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 03:24:07,349 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 03:24:07,349 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 03:24:07,349 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 113 118) no Hoare annotation was computed. [2018-11-23 03:24:07,349 INFO L448 ceAbstractionStarter]: For program point isinf_doubleFINAL(lines 111 123) no Hoare annotation was computed. [2018-11-23 03:24:07,349 INFO L451 ceAbstractionStarter]: At program point L113-2(lines 113 118) the Hoare annotation is: true [2018-11-23 03:24:07,349 INFO L448 ceAbstractionStarter]: For program point L113-3(lines 113 118) no Hoare annotation was computed. [2018-11-23 03:24:07,349 INFO L448 ceAbstractionStarter]: For program point isinf_doubleEXIT(lines 111 123) no Hoare annotation was computed. [2018-11-23 03:24:07,349 INFO L451 ceAbstractionStarter]: At program point isinf_doubleENTRY(lines 111 123) the Hoare annotation is: true [2018-11-23 03:24:07,349 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2018-11-23 03:24:07,350 INFO L444 ceAbstractionStarter]: At program point L128-2(lines 128 132) the Hoare annotation is: (= |__signbit_double_#in~x| __signbit_double_~x) [2018-11-23 03:24:07,350 INFO L448 ceAbstractionStarter]: For program point L128-3(lines 128 132) no Hoare annotation was computed. [2018-11-23 03:24:07,350 INFO L448 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 125 135) no Hoare annotation was computed. [2018-11-23 03:24:07,350 INFO L448 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 125 135) no Hoare annotation was computed. [2018-11-23 03:24:07,350 INFO L451 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 125 135) the Hoare annotation is: true [2018-11-23 03:24:07,350 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 03:24:07,350 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 03:24:07,350 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 03:24:07,350 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 03:24:07,350 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 137 155) no Hoare annotation was computed. [2018-11-23 03:24:07,350 INFO L444 ceAbstractionStarter]: At program point L149(line 149) the Hoare annotation is: (and (= main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))) (exists ((v_prenex_19 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_19) ((_ extract 62 52) v_prenex_19) ((_ extract 51 0) v_prenex_19)) (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_prenex_19)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) main_~res~0)))) [2018-11-23 03:24:07,351 INFO L448 ceAbstractionStarter]: For program point L149-1(line 149) no Hoare annotation was computed. [2018-11-23 03:24:07,351 INFO L448 ceAbstractionStarter]: For program point L149-2(line 149) no Hoare annotation was computed. [2018-11-23 03:24:07,351 INFO L448 ceAbstractionStarter]: For program point L149-3(line 149) no Hoare annotation was computed. [2018-11-23 03:24:07,351 INFO L444 ceAbstractionStarter]: At program point L149-4(line 149) the Hoare annotation is: (and |main_#t~short32| (= main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))) (exists ((v_prenex_19 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_19) ((_ extract 62 52) v_prenex_19) ((_ extract 51 0) v_prenex_19)) (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_prenex_19)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) main_~res~0)))) [2018-11-23 03:24:07,351 INFO L448 ceAbstractionStarter]: For program point L149-5(line 149) no Hoare annotation was computed. [2018-11-23 03:24:07,351 INFO L448 ceAbstractionStarter]: For program point L149-7(line 149) no Hoare annotation was computed. [2018-11-23 03:24:07,351 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 137 155) no Hoare annotation was computed. [2018-11-23 03:24:07,351 INFO L448 ceAbstractionStarter]: For program point L149-9(lines 149 152) no Hoare annotation was computed. [2018-11-23 03:24:07,351 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 137 155) the Hoare annotation is: true [2018-11-23 03:24:07,351 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-11-23 03:24:07,352 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-23 03:24:07,352 INFO L444 ceAbstractionStarter]: At program point L146(line 146) the Hoare annotation is: (= main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))) [2018-11-23 03:24:07,352 INFO L448 ceAbstractionStarter]: For program point L146-1(line 146) no Hoare annotation was computed. [2018-11-23 03:24:07,352 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 44 48) no Hoare annotation was computed. [2018-11-23 03:24:07,352 INFO L444 ceAbstractionStarter]: At program point L44-2(lines 44 48) the Hoare annotation is: (and (exists ((v_prenex_17 (_ BitVec 64))) (and (= (bvadd modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_17) (_ bv20 32)))) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (= |modf_double_#in~x| modf_double_~x) (exists ((v_prenex_17 (_ BitVec 64))) (and (= modf_double_~i0~0 ((_ extract 63 32) v_prenex_17)) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (exists ((v_prenex_17 (_ BitVec 64))) (and (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))) (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_17) (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32))))) [2018-11-23 03:24:07,352 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 69 73) no Hoare annotation was computed. [2018-11-23 03:24:07,352 INFO L444 ceAbstractionStarter]: At program point L69-2(lines 69 73) the Hoare annotation is: (and (= |modf_double_#in~x| modf_double_~x) (exists ((v_prenex_17 (_ BitVec 64))) (and (= modf_double_~i0~0 ((_ extract 63 32) v_prenex_17)) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (exists ((v_prenex_18 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_18) ((_ extract 62 52) v_prenex_18) ((_ extract 51 0) v_prenex_18)) |modf_double_#in~x|) (= (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_18) (_ bv20 32))) (_ bv4294966273 32)) modf_double_~j0~0)))) [2018-11-23 03:24:07,352 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 86 90) no Hoare annotation was computed. [2018-11-23 03:24:07,353 INFO L444 ceAbstractionStarter]: At program point L86-2(lines 86 90) the Hoare annotation is: (and (exists ((v_prenex_18 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_18) ((_ extract 62 52) v_prenex_18) ((_ extract 51 0) v_prenex_18)) |modf_double_#in~x|) (not (bvsgt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_18) (_ bv20 32))) (_ bv4294966273 32)) (_ bv51 32))))) (= |modf_double_#in~x| modf_double_~x) (exists ((v_prenex_17 (_ BitVec 64))) (and (= modf_double_~i0~0 ((_ extract 63 32) v_prenex_17)) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (exists ((v_prenex_18 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_18) ((_ extract 62 52) v_prenex_18) ((_ extract 51 0) v_prenex_18)) |modf_double_#in~x|) (= (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_18) (_ bv20 32))) (_ bv4294966273 32)) modf_double_~j0~0)))) [2018-11-23 03:24:07,353 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 107) no Hoare annotation was computed. [2018-11-23 03:24:07,353 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 65) no Hoare annotation was computed. [2018-11-23 03:24:07,353 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 28) no Hoare annotation was computed. [2018-11-23 03:24:07,353 INFO L444 ceAbstractionStarter]: At program point L23-2(lines 23 28) the Hoare annotation is: (= |modf_double_#in~x| modf_double_~x) [2018-11-23 03:24:07,353 INFO L448 ceAbstractionStarter]: For program point L23-3(lines 23 28) no Hoare annotation was computed. [2018-11-23 03:24:07,353 INFO L448 ceAbstractionStarter]: For program point modf_doubleFINAL(lines 20 108) no Hoare annotation was computed. [2018-11-23 03:24:07,353 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2018-11-23 03:24:07,353 INFO L444 ceAbstractionStarter]: At program point L32-2(lines 32 37) the Hoare annotation is: (and (exists ((v_prenex_17 (_ BitVec 64))) (and (= (bvadd modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_17) (_ bv20 32)))) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (= |modf_double_#in~x| modf_double_~x) (exists ((v_prenex_17 (_ BitVec 64))) (and (= modf_double_~i0~0 ((_ extract 63 32) v_prenex_17)) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (exists ((v_prenex_17 (_ BitVec 64))) (and (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))) (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_17) (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32))))) [2018-11-23 03:24:07,353 INFO L448 ceAbstractionStarter]: For program point L32-3(lines 32 37) no Hoare annotation was computed. [2018-11-23 03:24:07,354 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 57 62) no Hoare annotation was computed. [2018-11-23 03:24:07,354 INFO L444 ceAbstractionStarter]: At program point L57-2(lines 57 62) the Hoare annotation is: (and (exists ((v_prenex_17 (_ BitVec 64))) (and (= (bvadd modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_17) (_ bv20 32)))) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (= |modf_double_#in~x| modf_double_~x) (exists ((v_prenex_17 (_ BitVec 64))) (and (= modf_double_~i0~0 ((_ extract 63 32) v_prenex_17)) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (exists ((v_prenex_17 (_ BitVec 64))) (and (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))) (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_17) (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32))))) [2018-11-23 03:24:07,354 INFO L448 ceAbstractionStarter]: For program point L57-3(lines 57 62) no Hoare annotation was computed. [2018-11-23 03:24:07,354 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 54) no Hoare annotation was computed. [2018-11-23 03:24:07,354 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 41 56) no Hoare annotation was computed. [2018-11-23 03:24:07,354 INFO L448 ceAbstractionStarter]: For program point L49-2(lines 49 54) no Hoare annotation was computed. [2018-11-23 03:24:07,354 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 79) no Hoare annotation was computed. [2018-11-23 03:24:07,354 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 64) no Hoare annotation was computed. [2018-11-23 03:24:07,354 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 66 81) no Hoare annotation was computed. [2018-11-23 03:24:07,354 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 74 79) no Hoare annotation was computed. [2018-11-23 03:24:07,354 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 107) no Hoare annotation was computed. [2018-11-23 03:24:07,355 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 99 104) no Hoare annotation was computed. [2018-11-23 03:24:07,355 INFO L444 ceAbstractionStarter]: At program point L99-2(lines 99 104) the Hoare annotation is: (and (exists ((v_prenex_18 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_18) ((_ extract 62 52) v_prenex_18) ((_ extract 51 0) v_prenex_18)) |modf_double_#in~x|) (not (bvsgt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_18) (_ bv20 32))) (_ bv4294966273 32)) (_ bv51 32))))) (= |modf_double_#in~x| modf_double_~x) (exists ((v_prenex_17 (_ BitVec 64))) (and (= modf_double_~i0~0 ((_ extract 63 32) v_prenex_17)) (= |modf_double_#in~x| (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))))) (exists ((v_prenex_18 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_18) ((_ extract 62 52) v_prenex_18) ((_ extract 51 0) v_prenex_18)) |modf_double_#in~x|) (= (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_prenex_18) (_ bv20 32))) (_ bv4294966273 32)) modf_double_~j0~0)))) [2018-11-23 03:24:07,355 INFO L448 ceAbstractionStarter]: For program point L99-3(lines 99 104) no Hoare annotation was computed. [2018-11-23 03:24:07,355 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 96) no Hoare annotation was computed. [2018-11-23 03:24:07,355 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 83 98) no Hoare annotation was computed. [2018-11-23 03:24:07,355 INFO L448 ceAbstractionStarter]: For program point L91-2(lines 91 96) no Hoare annotation was computed. [2018-11-23 03:24:07,355 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 106) no Hoare annotation was computed. [2018-11-23 03:24:07,355 INFO L448 ceAbstractionStarter]: For program point modf_doubleEXIT(lines 20 108) no Hoare annotation was computed. [2018-11-23 03:24:07,355 INFO L451 ceAbstractionStarter]: At program point modf_doubleENTRY(lines 20 108) the Hoare annotation is: true [2018-11-23 03:24:07,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:24:07 BoogieIcfgContainer [2018-11-23 03:24:07,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:24:07,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:24:07,392 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:24:07,392 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:24:07,392 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:23:53" (3/4) ... [2018-11-23 03:24:07,395 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 03:24:07,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 03:24:07,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_double [2018-11-23 03:24:07,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_double [2018-11-23 03:24:07,402 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 03:24:07,402 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure modf_double [2018-11-23 03:24:07,407 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2018-11-23 03:24:07,407 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-23 03:24:07,408 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 03:24:07,424 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 03:24:07,424 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 03:24:07,425 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_17 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0])) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_17 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]) && ~bvslt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)), 4294966273bv32), 20bv32)) [2018-11-23 03:24:07,425 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_17 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0])) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_17 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]) && ~bvslt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)), 4294966273bv32), 20bv32)) [2018-11-23 03:24:07,425 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && ~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32) == j0) [2018-11-23 03:24:07,425 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && !~bvsgt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32), 51bv32)) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && ~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32) == j0) [2018-11-23 03:24:07,425 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_17 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0])) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_17 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]) && ~bvslt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)), 4294966273bv32), 20bv32)) [2018-11-23 03:24:07,425 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && !~bvsgt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32), 51bv32)) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && ~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32) == j0) [2018-11-23 03:24:07,449 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cc20eefa-bc42-4f87-9d54-850a538ecdde/bin-2019/utaipan/witness.graphml [2018-11-23 03:24:07,449 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:24:07,450 INFO L168 Benchmark]: Toolchain (without parser) took 15226.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:24:07,450 INFO L168 Benchmark]: CDTParser took 0.11 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 03:24:07,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.68 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 03:24:07,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.56 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 03:24:07,451 INFO L168 Benchmark]: Boogie Preprocessor took 74.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:24:07,451 INFO L168 Benchmark]: RCFGBuilder took 770.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:24:07,452 INFO L168 Benchmark]: TraceAbstraction took 14060.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -58.9 MB). Peak memory consumption was 5.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:24:07,452 INFO L168 Benchmark]: Witness Printer took 57.43 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: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:24:07,453 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.11 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 238.68 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 21.56 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 74.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 770.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14060.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -58.9 MB). Peak memory consumption was 5.6 MB. Max. memory is 11.5 GB. * Witness Printer took 57.43 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: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: 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: 99]: Loop Invariant [2018-11-23 03:24:07,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,463 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,463 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,463 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,463 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,464 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && !~bvsgt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32), 51bv32)) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && ~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32) == j0) - InvariantResult [Line: 57]: Loop Invariant [2018-11-23 03:24:07,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,465 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_17 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0])) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_17 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]) && ~bvslt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)), 4294966273bv32), 20bv32)) - InvariantResult [Line: 69]: Loop Invariant [2018-11-23 03:24:07,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] Derived loop invariant: (\old(x) == x && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && ~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32) == j0) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 32]: Loop Invariant [2018-11-23 03:24:07,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_17 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0])) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_17 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]) && ~bvslt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)), 4294966273bv32), 20bv32)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 86]: Loop Invariant [2018-11-23 03:24:07,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-23 03:24:07,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && !~bvsgt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32), 51bv32)) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_18 : bv64 :: ~fp~LONGDOUBLE(v_prenex_18[63:63], v_prenex_18[62:52], v_prenex_18[51:0]) == \old(x) && ~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_18[63:32], 20bv32)), 4294966273bv32) == j0) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 44]: Loop Invariant [2018-11-23 03:24:07,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,481 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-11-23 03:24:07,481 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_17 : bv64 :: ~bvadd64(j0, 1023bv32) == ~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0])) && \old(x) == x) && (\exists v_prenex_17 : bv64 :: i0 == v_prenex_17[63:32] && \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && (\exists v_prenex_17 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]) && ~bvslt32(~bvadd64(~bvand32(2047bv32, ~bvashr32(v_prenex_17[63:32], 20bv32)), 4294966273bv32), 20bv32)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 69 locations, 1 error locations. SAFE Result, 13.9s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 11.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 277 SDtfs, 228 SDslu, 849 SDs, 0 SdLazy, 310 SolverSat, 12 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred 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, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 31 PreInvPairs, 42 NumberOfFragments, 468 HoareAnnotationTreeSize, 31 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 152 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 190 ConstructedInterpolants, 43 QuantifiedInterpolants, 45086 SizeOfPredicates, 20 NumberOfNonLiveVariables, 667 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...