./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call_true-termination.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_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0f1bd2a42710b6c2eba96cb622bd79ffd05436a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0f1bd2a42710b6c2eba96cb622bd79ffd05436a ........................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:37:32,743 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:37:32,744 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:37:32,753 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:37:32,753 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:37:32,754 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:37:32,754 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:37:32,756 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:37:32,757 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:37:32,758 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:37:32,758 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:37:32,759 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:37:32,759 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:37:32,760 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:37:32,761 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:37:32,762 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:37:32,763 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:37:32,764 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:37:32,765 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:37:32,767 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:37:32,768 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:37:32,769 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:37:32,770 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:37:32,771 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:37:32,771 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:37:32,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:37:32,772 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:37:32,773 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:37:32,774 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:37:32,775 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:37:32,775 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:37:32,775 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:37:32,776 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:37:32,776 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:37:32,777 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:37:32,777 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:37:32,778 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:37:32,789 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:37:32,789 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:37:32,790 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:37:32,790 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:37:32,790 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:37:32,790 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:37:32,790 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:37:32,791 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:37:32,791 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:37:32,791 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:37:32,791 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:37:32,791 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:37:32,791 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:37:32,792 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:37:32,792 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:37:32,792 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:37:32,792 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:37:32,792 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:37:32,792 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:37:32,792 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:37:32,793 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:37:32,793 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:37:32,793 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:37:32,793 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:37:32,793 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:37:32,793 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:37:32,793 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:37:32,793 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:37:32,793 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:37:32,794 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:37:32,794 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_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer 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 -> Automizer 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 -> e0f1bd2a42710b6c2eba96cb622bd79ffd05436a [2018-11-23 13:37:32,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:37:32,829 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:37:32,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:37:32,832 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:37:32,833 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:37:32,833 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call_true-termination.c [2018-11-23 13:37:32,877 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/data/2ad7e3847/be3220f0cfa949e5a3102f6a1ba7f640/FLAG2f8610248 [2018-11-23 13:37:33,226 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:37:33,227 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call_true-termination.c [2018-11-23 13:37:33,231 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/data/2ad7e3847/be3220f0cfa949e5a3102f6a1ba7f640/FLAG2f8610248 [2018-11-23 13:37:33,652 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/data/2ad7e3847/be3220f0cfa949e5a3102f6a1ba7f640 [2018-11-23 13:37:33,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:37:33,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:37:33,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:37:33,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:37:33,660 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:37:33,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:37:33" (1/1) ... [2018-11-23 13:37:33,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20da91a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:33, skipping insertion in model container [2018-11-23 13:37:33,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:37:33" (1/1) ... [2018-11-23 13:37:33,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:37:33,685 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:37:33,814 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:37:33,817 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:37:33,831 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:37:33,847 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:37:33,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:33 WrapperNode [2018-11-23 13:37:33,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:37:33,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:37:33,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:37:33,848 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:37:33,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:33" (1/1) ... [2018-11-23 13:37:33,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:33" (1/1) ... [2018-11-23 13:37:33,867 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:37:33,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:37:33,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:37:33,868 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:37:33,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:33" (1/1) ... [2018-11-23 13:37:33,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:33" (1/1) ... [2018-11-23 13:37:33,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:33" (1/1) ... [2018-11-23 13:37:33,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:33" (1/1) ... [2018-11-23 13:37:33,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:33" (1/1) ... [2018-11-23 13:37:33,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:33" (1/1) ... [2018-11-23 13:37:33,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:33" (1/1) ... [2018-11-23 13:37:33,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:37:33,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:37:33,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:37:33,888 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:37:33,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:37:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:37:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:37:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 13:37:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:37:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:37:33,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:37:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure InvSqrt [2018-11-23 13:37:33,972 INFO L138 BoogieDeclarations]: Found implementation of procedure InvSqrt [2018-11-23 13:37:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 13:37:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:37:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:37:33,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:37:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:37:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:37:33,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:37:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:37:34,108 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:37:34,109 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 13:37:34,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:37:34 BoogieIcfgContainer [2018-11-23 13:37:34,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:37:34,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:37:34,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:37:34,113 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:37:34,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:37:33" (1/3) ... [2018-11-23 13:37:34,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f499192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:37:34, skipping insertion in model container [2018-11-23 13:37:34,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:33" (2/3) ... [2018-11-23 13:37:34,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f499192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:37:34, skipping insertion in model container [2018-11-23 13:37:34,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:37:34" (3/3) ... [2018-11-23 13:37:34,116 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake_true-unreach-call_true-termination.c [2018-11-23 13:37:34,125 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:37:34,132 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:37:34,143 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:37:34,165 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:37:34,166 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:37:34,166 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:37:34,166 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:37:34,166 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:37:34,166 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:37:34,166 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:37:34,167 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:37:34,167 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:37:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 13:37:34,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:37:34,184 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:37:34,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:37:34,187 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:37:34,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:37:34,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1573477556, now seen corresponding path program 1 times [2018-11-23 13:37:34,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:37:34,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:37:34,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:37:34,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:37:34,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:37:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:37:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:37:34,301 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=13, |#NULL.offset|=5, |old(#NULL.base)|=13, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=5] [?] RET #25#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~a~0;havoc ~r~0;~a~0 := #t~nondet3;havoc #t~nondet3;assume 0 != (if ~someBinaryFLOATComparisonOperation(~a~0, 0.1) && ~someBinaryFLOATComparisonOperation(~a~0, 100.0) then 1 else 0); VAL [main_~a~0=11.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret4 := InvSqrt(~a~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |InvSqrt_#in~x|=11.0] [?] ~x := #in~x;~xhalf~0 := ~someBinaryArithmeticFLOAToperation(0.5, ~x);call ~#i~0.base, ~#i~0.offset := #Ultimate.alloc(4);call write~real(~x, ~#i~0.base, ~#i~0.offset, 4);call #t~mem0 := read~int(~#i~0.base, ~#i~0.offset, 4);call write~int(1597463007 - #t~mem0 / 2, ~#i~0.base, ~#i~0.offset, 4);havoc #t~mem0;call #t~mem1 := read~real(~#i~0.base, ~#i~0.offset, 4);~x := #t~mem1;call write~int(#t~union2, ~#i~0.base, ~#i~0.offset, 4);havoc #t~mem1;havoc #t~union2;~x := ~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(1.5, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~xhalf~0, ~x), ~x)));#res := ~x;call ULTIMATE.dealloc(~#i~0.base, ~#i~0.offset);havoc ~#i~0.base, ~#i~0.offset; VAL [InvSqrt_~x=12.0, |#NULL.base|=0, |#NULL.offset|=0, |InvSqrt_#in~x|=11.0, |InvSqrt_#res|=12.0] [?] assume true; VAL [InvSqrt_~x=12.0, |#NULL.base|=0, |#NULL.offset|=0, |InvSqrt_#in~x|=11.0, |InvSqrt_#res|=12.0] [?] RET #29#return; VAL [main_~a~0=11.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret4|=12.0] [?] ~r~0 := #t~ret4;havoc #t~ret4; VAL [main_~a~0=11.0, main_~r~0=12.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~r~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~r~0, 10.0) then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=5, old(#NULL.base)=13, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L40] havoc ~a~0; [L40] havoc ~r~0; [L42] ~a~0 := #t~nondet3; [L42] havoc #t~nondet3; [L43] assume 0 != (if ~someBinaryFLOATComparisonOperation(~a~0, 0.1) && ~someBinaryFLOATComparisonOperation(~a~0, 100.0) then 1 else 0); VAL [#NULL.base=0, #NULL.offset=0, ~a~0=11.0] [L45] CALL call #t~ret4 := InvSqrt(~a~0); VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0] [L15-L24] ~x := #in~x; [L17] ~xhalf~0 := ~someBinaryArithmeticFLOAToperation(0.5, ~x); [L18] call ~#i~0.base, ~#i~0.offset := #Ultimate.alloc(4); [L19] call write~real(~x, ~#i~0.base, ~#i~0.offset, 4); [L20] call #t~mem0 := read~int(~#i~0.base, ~#i~0.offset, 4); [L20] call write~int(1597463007 - #t~mem0 / 2, ~#i~0.base, ~#i~0.offset, 4); [L20] havoc #t~mem0; [L21] call #t~mem1 := read~real(~#i~0.base, ~#i~0.offset, 4); [L21] ~x := #t~mem1; [L21] call write~int(#t~union2, ~#i~0.base, ~#i~0.offset, 4); [L21] havoc #t~mem1; [L21] havoc #t~union2; [L22] ~x := ~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(1.5, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~xhalf~0, ~x), ~x))); [L23] #res := ~x; [L18] call ULTIMATE.dealloc(~#i~0.base, ~#i~0.offset); [L23] havoc ~#i~0.base, ~#i~0.offset; VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0, #res=12.0, ~x=12.0] [L15-L24] ensures true; VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0, #res=12.0, ~x=12.0] [L45] RET call #t~ret4 := InvSqrt(~a~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=12.0, ~a~0=11.0] [L45] ~r~0 := #t~ret4; [L45] havoc #t~ret4; VAL [#NULL.base=0, #NULL.offset=0, ~a~0=11.0, ~r~0=12.0] [L47] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~r~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~r~0, 10.0) then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L8] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=5, old(#NULL.base)=13, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L40] havoc ~a~0; [L40] havoc ~r~0; [L42] ~a~0 := #t~nondet3; [L42] havoc #t~nondet3; [L43] assume 0 != (if ~someBinaryFLOATComparisonOperation(~a~0, 0.1) && ~someBinaryFLOATComparisonOperation(~a~0, 100.0) then 1 else 0); VAL [#NULL.base=0, #NULL.offset=0, ~a~0=11.0] [L45] CALL call #t~ret4 := InvSqrt(~a~0); VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0] [L15-L24] ~x := #in~x; [L17] ~xhalf~0 := ~someBinaryArithmeticFLOAToperation(0.5, ~x); [L18] call ~#i~0.base, ~#i~0.offset := #Ultimate.alloc(4); [L19] call write~real(~x, ~#i~0.base, ~#i~0.offset, 4); [L20] call #t~mem0 := read~int(~#i~0.base, ~#i~0.offset, 4); [L20] call write~int(1597463007 - #t~mem0 / 2, ~#i~0.base, ~#i~0.offset, 4); [L20] havoc #t~mem0; [L21] call #t~mem1 := read~real(~#i~0.base, ~#i~0.offset, 4); [L21] ~x := #t~mem1; [L21] call write~int(#t~union2, ~#i~0.base, ~#i~0.offset, 4); [L21] havoc #t~mem1; [L21] havoc #t~union2; [L22] ~x := ~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(1.5, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~xhalf~0, ~x), ~x))); [L23] #res := ~x; [L18] call ULTIMATE.dealloc(~#i~0.base, ~#i~0.offset); [L23] havoc ~#i~0.base, ~#i~0.offset; VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0, #res=12.0, ~x=12.0] [L15-L24] ensures true; VAL [#in~x=11.0, #NULL.base=0, #NULL.offset=0, #res=12.0, ~x=12.0] [L45] RET call #t~ret4 := InvSqrt(~a~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret4=12.0, ~a~0=11.0] [L45] ~r~0 := #t~ret4; [L45] havoc #t~ret4; VAL [#NULL.base=0, #NULL.offset=0, ~a~0=11.0, ~r~0=12.0] [L47] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~r~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~r~0, 10.0) then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L8] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=5, old(#NULL!base)=13, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L40] havoc ~a~0; [L40] havoc ~r~0; [L42] ~a~0 := #t~nondet3; [L42] havoc #t~nondet3; [L43] assume 0 != (if ~someBinaryFLOATComparisonOperation(~a~0, 0.1) && ~someBinaryFLOATComparisonOperation(~a~0, 100.0) then 1 else 0); VAL [#NULL!base=0, #NULL!offset=0, ~a~0=11.0] [L45] CALL call #t~ret4 := InvSqrt(~a~0); VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0] [L15-L24] ~x := #in~x; [L17] ~xhalf~0 := ~someBinaryArithmeticFLOAToperation(0.5, ~x); [L18] FCALL call ~#i~0 := #Ultimate.alloc(4); [L19] FCALL call write~real(~x, { base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L20] FCALL call #t~mem0 := read~int({ base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L20] FCALL call write~int(1597463007 - #t~mem0 / 2, { base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L20] havoc #t~mem0; [L21] FCALL call #t~mem1 := read~real({ base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L21] ~x := #t~mem1; [L21] FCALL call write~int(#t~union2, { base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L21] havoc #t~mem1; [L21] havoc #t~union2; [L22] ~x := ~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(1.5, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~xhalf~0, ~x), ~x))); [L23] #res := ~x; [L18] FCALL call ULTIMATE.dealloc(~#i~0); [L23] havoc ~#i~0; VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, #res=12.0, ~x=12.0] [L45] RET call #t~ret4 := InvSqrt(~a~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=12.0, ~a~0=11.0] [L45] ~r~0 := #t~ret4; [L45] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=11.0, ~r~0=12.0] [L47] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~r~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~r~0, 10.0) then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=5, old(#NULL!base)=13, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L40] havoc ~a~0; [L40] havoc ~r~0; [L42] ~a~0 := #t~nondet3; [L42] havoc #t~nondet3; [L43] assume 0 != (if ~someBinaryFLOATComparisonOperation(~a~0, 0.1) && ~someBinaryFLOATComparisonOperation(~a~0, 100.0) then 1 else 0); VAL [#NULL!base=0, #NULL!offset=0, ~a~0=11.0] [L45] CALL call #t~ret4 := InvSqrt(~a~0); VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0] [L15-L24] ~x := #in~x; [L17] ~xhalf~0 := ~someBinaryArithmeticFLOAToperation(0.5, ~x); [L18] FCALL call ~#i~0 := #Ultimate.alloc(4); [L19] FCALL call write~real(~x, { base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L20] FCALL call #t~mem0 := read~int({ base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L20] FCALL call write~int(1597463007 - #t~mem0 / 2, { base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L20] havoc #t~mem0; [L21] FCALL call #t~mem1 := read~real({ base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L21] ~x := #t~mem1; [L21] FCALL call write~int(#t~union2, { base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L21] havoc #t~mem1; [L21] havoc #t~union2; [L22] ~x := ~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(1.5, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~xhalf~0, ~x), ~x))); [L23] #res := ~x; [L18] FCALL call ULTIMATE.dealloc(~#i~0); [L23] havoc ~#i~0; VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, #res=12.0, ~x=12.0] [L45] RET call #t~ret4 := InvSqrt(~a~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=12.0, ~a~0=11.0] [L45] ~r~0 := #t~ret4; [L45] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=11.0, ~r~0=12.0] [L47] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~r~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~r~0, 10.0) then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=5, old(#NULL!base)=13, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L40] havoc ~a~0; [L40] havoc ~r~0; [L42] ~a~0 := #t~nondet3; [L42] havoc #t~nondet3; [L43] assume 0 != (if ~someBinaryFLOATComparisonOperation(~a~0, 0.1) && ~someBinaryFLOATComparisonOperation(~a~0, 100.0) then 1 else 0); VAL [#NULL!base=0, #NULL!offset=0, ~a~0=11.0] [L45] CALL call #t~ret4 := InvSqrt(~a~0); VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0] [L15-L24] ~x := #in~x; [L17] ~xhalf~0 := ~someBinaryArithmeticFLOAToperation(0.5, ~x); [L18] FCALL call ~#i~0 := #Ultimate.alloc(4); [L19] FCALL call write~real(~x, { base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L20] FCALL call #t~mem0 := read~int({ base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L20] FCALL call write~int(1597463007 - #t~mem0 / 2, { base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L20] havoc #t~mem0; [L21] FCALL call #t~mem1 := read~real({ base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L21] ~x := #t~mem1; [L21] FCALL call write~int(#t~union2, { base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L21] havoc #t~mem1; [L21] havoc #t~union2; [L22] ~x := ~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(1.5, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~xhalf~0, ~x), ~x))); [L23] #res := ~x; [L18] FCALL call ULTIMATE.dealloc(~#i~0); [L23] havoc ~#i~0; VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, #res=12.0, ~x=12.0] [L45] RET call #t~ret4 := InvSqrt(~a~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=12.0, ~a~0=11.0] [L45] ~r~0 := #t~ret4; [L45] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=11.0, ~r~0=12.0] [L47] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~r~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~r~0, 10.0) then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=5, old(#NULL!base)=13, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L40] havoc ~a~0; [L40] havoc ~r~0; [L42] ~a~0 := #t~nondet3; [L42] havoc #t~nondet3; [L43] assume 0 != (if ~someBinaryFLOATComparisonOperation(~a~0, 0.1) && ~someBinaryFLOATComparisonOperation(~a~0, 100.0) then 1 else 0); VAL [#NULL!base=0, #NULL!offset=0, ~a~0=11.0] [L45] CALL call #t~ret4 := InvSqrt(~a~0); VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0] [L15-L24] ~x := #in~x; [L17] ~xhalf~0 := ~someBinaryArithmeticFLOAToperation(0.5, ~x); [L18] FCALL call ~#i~0 := #Ultimate.alloc(4); [L19] FCALL call write~real(~x, { base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L20] FCALL call #t~mem0 := read~int({ base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L20] FCALL call write~int(1597463007 - #t~mem0 / 2, { base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L20] havoc #t~mem0; [L21] FCALL call #t~mem1 := read~real({ base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L21] ~x := #t~mem1; [L21] FCALL call write~int(#t~union2, { base: ~#i~0!base, offset: ~#i~0!offset }, 4); [L21] havoc #t~mem1; [L21] havoc #t~union2; [L22] ~x := ~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(1.5, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~xhalf~0, ~x), ~x))); [L23] #res := ~x; [L18] FCALL call ULTIMATE.dealloc(~#i~0); [L23] havoc ~#i~0; VAL [#in~x=11.0, #NULL!base=0, #NULL!offset=0, #res=12.0, ~x=12.0] [L45] RET call #t~ret4 := InvSqrt(~a~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret4=12.0, ~a~0=11.0] [L45] ~r~0 := #t~ret4; [L45] havoc #t~ret4; VAL [#NULL!base=0, #NULL!offset=0, ~a~0=11.0, ~r~0=12.0] [L47] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~r~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(~r~0, 10.0) then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L40] float a,r; [L42] a = __VERIFIER_nondet_float() [L45] CALL, EXPR InvSqrt(a) VAL [\old(x)=11] [L17] float xhalf = 0.5f*x; [L18] union float_int i; [L19] i.f = x [L20] EXPR i.i [L20] i.i = 0x5f3759df - (i.i>>1) [L21] EXPR i.f [L21] x = i.f [L22] x = x*(1.5f-xhalf*x*x) [L23] return x; [L23] return x; VAL [\old(x)=11, \result=12, x=12] [L45] RET, EXPR InvSqrt(a) VAL [a=11, InvSqrt(a)=12] [L45] r = InvSqrt(a) [L47] CALL __VERIFIER_assert(r >= 0.f && r <= 10.) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:37:34,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:37:34 BoogieIcfgContainer [2018-11-23 13:37:34,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:37:34,332 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:37:34,333 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:37:34,333 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:37:34,333 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:37:34" (3/4) ... [2018-11-23 13:37:34,335 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:37:34,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:37:34,336 INFO L168 Benchmark]: Toolchain (without parser) took 681.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 961.8 MB in the beginning and 1.1 GB in the end (delta: -124.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:37:34,337 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:37:34,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.33 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:37:34,339 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.56 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 945.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:37:34,340 INFO L168 Benchmark]: Boogie Preprocessor took 19.89 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:37:34,340 INFO L168 Benchmark]: RCFGBuilder took 221.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:37:34,341 INFO L168 Benchmark]: TraceAbstraction took 222.35 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:37:34,341 INFO L168 Benchmark]: Witness Printer took 3.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:37:34,344 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 191.33 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.56 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 945.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.89 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 221.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 222.35 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 8]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 43, overapproximation of someBinaryArithmeticFLOAToperation at line 17. Possible FailurePath: [L40] float a,r; [L42] a = __VERIFIER_nondet_float() [L45] CALL, EXPR InvSqrt(a) VAL [\old(x)=11] [L17] float xhalf = 0.5f*x; [L18] union float_int i; [L19] i.f = x [L20] EXPR i.i [L20] i.i = 0x5f3759df - (i.i>>1) [L21] EXPR i.f [L21] x = i.f [L22] x = x*(1.5f-xhalf*x*x) [L23] return x; [L23] return x; VAL [\old(x)=11, \result=12, x=12] [L45] RET, EXPR InvSqrt(a) VAL [a=11, InvSqrt(a)=12] [L45] r = InvSqrt(a) [L47] CALL __VERIFIER_assert(r >= 0.f && r <= 10.) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 13:37:35,871 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:37:35,872 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:37:35,882 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:37:35,882 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:37:35,883 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:37:35,884 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:37:35,885 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:37:35,886 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:37:35,887 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:37:35,887 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:37:35,888 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:37:35,888 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:37:35,889 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:37:35,890 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:37:35,890 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:37:35,891 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:37:35,892 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:37:35,894 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:37:35,895 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:37:35,896 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:37:35,897 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:37:35,898 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:37:35,899 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:37:35,899 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:37:35,900 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:37:35,900 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:37:35,901 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:37:35,901 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:37:35,902 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:37:35,902 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:37:35,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:37:35,903 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:37:35,903 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:37:35,904 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:37:35,905 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:37:35,905 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 13:37:35,916 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:37:35,916 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:37:35,917 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:37:35,917 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:37:35,918 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:37:35,918 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:37:35,918 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:37:35,918 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:37:35,918 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:37:35,918 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:37:35,919 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:37:35,919 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:37:35,919 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:37:35,919 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:37:35,919 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 13:37:35,919 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 13:37:35,919 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:37:35,920 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:37:35,920 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:37:35,920 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:37:35,920 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:37:35,920 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:37:35,920 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:37:35,921 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:37:35,921 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:37:35,921 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:37:35,921 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:37:35,921 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:37:35,921 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 13:37:35,921 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:37:35,922 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 13:37:35,922 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 13:37:35,922 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_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer 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 -> Automizer 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 -> e0f1bd2a42710b6c2eba96cb622bd79ffd05436a [2018-11-23 13:37:35,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:37:35,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:37:35,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:37:35,972 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:37:35,972 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:37:35,973 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call_true-termination.c [2018-11-23 13:37:36,023 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/data/d32251dc4/b5041e3437e447ff837cc90705292778/FLAGa9e5554cf [2018-11-23 13:37:36,349 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:37:36,349 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call_true-termination.c [2018-11-23 13:37:36,353 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/data/d32251dc4/b5041e3437e447ff837cc90705292778/FLAGa9e5554cf [2018-11-23 13:37:36,362 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/data/d32251dc4/b5041e3437e447ff837cc90705292778 [2018-11-23 13:37:36,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:37:36,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:37:36,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:37:36,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:37:36,370 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:37:36,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:37:36" (1/1) ... [2018-11-23 13:37:36,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2129d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:36, skipping insertion in model container [2018-11-23 13:37:36,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:37:36" (1/1) ... [2018-11-23 13:37:36,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:37:36,398 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:37:36,532 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:37:36,535 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:37:36,549 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:37:36,572 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:37:36,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:36 WrapperNode [2018-11-23 13:37:36,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:37:36,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:37:36,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:37:36,573 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:37:36,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:36" (1/1) ... [2018-11-23 13:37:36,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:36" (1/1) ... [2018-11-23 13:37:36,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:37:36,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:37:36,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:37:36,592 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:37:36,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:36" (1/1) ... [2018-11-23 13:37:36,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:36" (1/1) ... [2018-11-23 13:37:36,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:36" (1/1) ... [2018-11-23 13:37:36,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:36" (1/1) ... [2018-11-23 13:37:36,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:36" (1/1) ... [2018-11-23 13:37:36,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:36" (1/1) ... [2018-11-23 13:37:36,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:36" (1/1) ... [2018-11-23 13:37:36,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:37:36,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:37:36,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:37:36,616 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:37:36,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:37:36,696 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:37:36,696 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:37:36,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-23 13:37:36,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:37:36,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:37:36,697 INFO L130 BoogieDeclarations]: Found specification of procedure InvSqrt [2018-11-23 13:37:36,697 INFO L138 BoogieDeclarations]: Found implementation of procedure InvSqrt [2018-11-23 13:37:36,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:37:36,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 13:37:36,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:37:36,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:37:36,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 13:37:36,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:37:36,698 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:37:36,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:37:36,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 13:37:37,514 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:37:37,540 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:37:37,541 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 13:37:37,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:37:37 BoogieIcfgContainer [2018-11-23 13:37:37,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:37:37,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:37:37,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:37:37,545 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:37:37,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:37:36" (1/3) ... [2018-11-23 13:37:37,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd16ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:37:37, skipping insertion in model container [2018-11-23 13:37:37,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:36" (2/3) ... [2018-11-23 13:37:37,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd16ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:37:37, skipping insertion in model container [2018-11-23 13:37:37,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:37:37" (3/3) ... [2018-11-23 13:37:37,547 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake_true-unreach-call_true-termination.c [2018-11-23 13:37:37,557 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:37:37,564 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:37:37,578 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:37:37,603 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:37:37,604 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:37:37,604 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:37:37,604 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:37:37,604 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:37:37,604 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:37:37,604 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:37:37,605 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:37:37,605 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:37:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 13:37:37,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:37:37,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:37:37,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:37:37,625 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:37:37,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:37:37,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1573477556, now seen corresponding path program 1 times [2018-11-23 13:37:37,632 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:37:37,632 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 13:37:37,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:37:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:37:38,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:37:40,471 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (and (= |c_InvSqrt_#in~x| (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|))) (= (let ((.cse0 (let ((.cse1 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) |c_InvSqrt_#in~x|) .cse0) .cse0)))) |c_InvSqrt_#res|))) is different from false [2018-11-23 13:37:42,701 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|)))) (and (= |c_main_#t~ret4| (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse1) .cse0) .cse0))))) (fp.geq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) is different from false [2018-11-23 13:37:44,732 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|)))) (and (= |c_main_#t~ret4| (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse1) .cse0) .cse0))))) (fp.geq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) is different from true [2018-11-23 13:37:46,768 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|)))) (and (fp.geq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (= c_main_~r~0 (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse0) .cse1) .cse1))))) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) is different from false [2018-11-23 13:37:48,794 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|)))) (and (fp.geq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (= c_main_~r~0 (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse0) .cse1) .cse1))))) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) is different from true [2018-11-23 13:38:05,151 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_prenex_3) ((_ extract 30 23) v_prenex_3) ((_ extract 22 0) v_prenex_3)))) (let ((.cse1 (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr v_prenex_3 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse0) .cse2) .cse2)))))) (and (fp.geq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse1 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven .cse1) ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))))) (and (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|)))) (and (fp.geq .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (not (fp.geq (let ((.cse5 (let ((.cse6 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse4) .cse5) .cse5)))) (_ +zero 8 24))) (fp.leq .cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) .cse7) (and (exists ((v_prenex_1 (_ BitVec 32))) (let ((.cse8 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)))) (and (fp.leq .cse8 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse8 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (not (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (let ((.cse9 (let ((.cse10 (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse8) .cse9) .cse9))))) ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))))) .cse7))) is different from false [2018-11-23 13:38:19,507 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|)))) (and (fp.geq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (not (fp.geq (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse1) .cse2) .cse2)))) (_ +zero 8 24))) (fp.leq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))))) (and .cse0 (exists ((v_prenex_1 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)))) (and (fp.leq .cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (not (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (let ((.cse5 (let ((.cse6 (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse4) .cse5) .cse5))))) ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))))) (and (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) v_prenex_3) ((_ extract 30 23) v_prenex_3) ((_ extract 22 0) v_prenex_3)))) (let ((.cse8 (let ((.cse9 (let ((.cse10 (bvadd (bvneg (bvashr v_prenex_3 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse7) .cse9) .cse9)))))) (and (fp.geq .cse7 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq .cse7 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse8 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven .cse8) ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))))))) is different from false [2018-11-23 13:38:29,747 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|)))) (and (fp.geq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (not (fp.geq (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse0) .cse1) .cse1)))) (_ +zero 8 24))) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) (exists ((v_prenex_1 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)))) (and (fp.leq .cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (not (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (let ((.cse4 (let ((.cse5 (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse3) .cse4) .cse4))))) ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))))) is different from false [2018-11-23 13:38:31,805 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|)))) (and (fp.geq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (not (fp.geq (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse0) .cse1) .cse1)))) (_ +zero 8 24))) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) (exists ((v_prenex_1 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)))) (and (fp.leq .cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (not (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (let ((.cse4 (let ((.cse5 (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse3) .cse4) .cse4))))) ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))))) is different from true [2018-11-23 13:38:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:38:31,813 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:38:31,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:38:31,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 13:38:31,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:38:31,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:38:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=6, Unknown=9, NotChecked=42, Total=72 [2018-11-23 13:38:31,852 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 9 states. [2018-11-23 13:38:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:38:31,870 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2018-11-23 13:38:31,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:38:31,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-11-23 13:38:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:38:31,879 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:38:31,879 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:38:31,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=15, Invalid=6, Unknown=9, NotChecked=42, Total=72 [2018-11-23 13:38:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:38:31,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:38:31,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:38:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:38:31,902 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-11-23 13:38:31,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:38:31,903 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:38:31,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:38:31,903 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:38:31,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:38:31,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:38:58,026 WARN L180 SmtUtils]: Spent 26.05 s on a formula simplification. DAG size of input: 115 DAG size of output: 1 [2018-11-23 13:39:02,094 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 13:39:02,096 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:39:02,097 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:39:02,097 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:39:02,097 INFO L451 ceAbstractionStarter]: At program point InvSqrtENTRY(lines 15 24) the Hoare annotation is: true [2018-11-23 13:39:02,097 INFO L448 ceAbstractionStarter]: For program point InvSqrtFINAL(lines 15 24) no Hoare annotation was computed. [2018-11-23 13:39:02,097 INFO L448 ceAbstractionStarter]: For program point InvSqrtEXIT(lines 15 24) no Hoare annotation was computed. [2018-11-23 13:39:02,097 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:39:02,097 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:39:02,098 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:39:02,098 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:39:02,098 INFO L444 ceAbstractionStarter]: At program point L47(line 47) the Hoare annotation is: (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|)))) (and (fp.geq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (= main_~r~0 (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse0) .cse1) .cse1))))) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) [2018-11-23 13:39:02,098 INFO L448 ceAbstractionStarter]: For program point L47-1(line 47) no Hoare annotation was computed. [2018-11-23 13:39:02,098 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 38 49) the Hoare annotation is: true [2018-11-23 13:39:02,098 INFO L444 ceAbstractionStarter]: At program point L45(line 45) the Hoare annotation is: (and (fp.geq main_~a~0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq main_~a~0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) [2018-11-23 13:39:02,099 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 38 49) no Hoare annotation was computed. [2018-11-23 13:39:02,099 INFO L448 ceAbstractionStarter]: For program point L45-1(line 45) no Hoare annotation was computed. [2018-11-23 13:39:02,099 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 38 49) no Hoare annotation was computed. [2018-11-23 13:39:02,099 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 8) the Hoare annotation is: true [2018-11-23 13:39:02,100 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 8) no Hoare annotation was computed. [2018-11-23 13:39:02,100 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2018-11-23 13:39:02,100 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2018-11-23 13:39:02,100 INFO L448 ceAbstractionStarter]: For program point L8-1(line 8) no Hoare annotation was computed. [2018-11-23 13:39:02,100 INFO L448 ceAbstractionStarter]: For program point L8-3(line 8) no Hoare annotation was computed. [2018-11-23 13:39:02,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:39:02 BoogieIcfgContainer [2018-11-23 13:39:02,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:39:02,104 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:39:02,104 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:39:02,105 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:39:02,105 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:37:37" (3/4) ... [2018-11-23 13:39:02,108 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:39:02,113 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:39:02,114 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure InvSqrt [2018-11-23 13:39:02,114 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:39:02,114 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:39:02,119 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 13:39:02,119 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 13:39:02,120 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:39:02,120 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:39:02,158 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f9ff1ed4-2345-4eee-8ae6-40adf0238549/bin-2019/uautomizer/witness.graphml [2018-11-23 13:39:02,158 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:39:02,159 INFO L168 Benchmark]: Toolchain (without parser) took 85794.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 949.7 MB in the beginning and 1.0 GB in the end (delta: -93.3 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:39:02,160 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:39:02,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.35 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 13:39:02,160 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.86 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 13:39:02,160 INFO L168 Benchmark]: Boogie Preprocessor took 23.12 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 13:39:02,161 INFO L168 Benchmark]: RCFGBuilder took 925.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:39:02,161 INFO L168 Benchmark]: TraceAbstraction took 84562.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: 53.5 MB). Peak memory consumption was 53.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:39:02,161 INFO L168 Benchmark]: Witness Printer took 54.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:39:02,164 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.22 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 206.35 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 18.86 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 23.12 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. * RCFGBuilder took 925.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 84562.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: 53.5 MB). Peak memory consumption was 53.5 MB. Max. memory is 11.5 GB. * Witness Printer took 54.07 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: - PositiveResult [Line: 8]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. SAFE Result, 84.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 30.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 0 SDslu, 49 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 8 NumberOfFragments, 132 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 930 FormulaSimplificationTreeSizeReductionInter, 30.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 53.4s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 14 ConstructedInterpolants, 7 QuantifiedInterpolants, 22372 SizeOfPredicates, 5 NumberOfNonLiveVariables, 48 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...