./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/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 71bb07c94f4fe427420ff52287a2ed237302fad2 .................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/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 71bb07c94f4fe427420ff52287a2ed237302fad2 ......................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:49:01,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:49:01,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:49:01,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:49:01,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:49:01,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:49:01,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:49:01,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:49:01,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:49:01,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:49:01,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:49:01,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:49:01,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:49:01,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:49:01,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:49:01,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:49:01,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:49:01,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:49:01,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:49:01,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:49:01,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:49:01,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:49:01,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:49:01,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:49:01,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:49:01,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:49:01,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:49:01,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:49:01,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:49:01,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:49:01,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:49:01,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:49:01,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:49:01,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:49:01,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:49:01,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:49:01,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:49:01,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:49:01,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:49:01,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:49:01,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:49:01,279 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:49:01,294 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:49:01,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:49:01,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:49:01,296 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:49:01,296 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:49:01,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:49:01,297 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:49:01,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:49:01,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:49:01,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:49:01,298 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:49:01,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:49:01,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:49:01,298 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:49:01,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:49:01,299 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:49:01,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:49:01,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:49:01,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:49:01,300 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:49:01,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:49:01,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:49:01,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:49:01,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:49:01,301 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:49:01,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:49:01,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:49:01,302 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:49:01,302 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/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 -> 71bb07c94f4fe427420ff52287a2ed237302fad2 [2019-11-15 22:49:01,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:49:01,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:49:01,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:49:01,351 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:49:01,351 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:49:01,352 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c [2019-11-15 22:49:01,428 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/data/04fe1ae28/a2fcc761ec5b4899ba81e3eed223058e/FLAG0e29153fb [2019-11-15 22:49:01,926 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:49:01,928 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c [2019-11-15 22:49:01,936 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/data/04fe1ae28/a2fcc761ec5b4899ba81e3eed223058e/FLAG0e29153fb [2019-11-15 22:49:02,301 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/data/04fe1ae28/a2fcc761ec5b4899ba81e3eed223058e [2019-11-15 22:49:02,305 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:49:02,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:49:02,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:49:02,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:49:02,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:49:02,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:49:02" (1/1) ... [2019-11-15 22:49:02,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755512b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:02, skipping insertion in model container [2019-11-15 22:49:02,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:49:02" (1/1) ... [2019-11-15 22:49:02,330 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:49:02,351 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:49:02,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:49:02,714 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:49:02,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:49:02,781 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:49:02,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:02 WrapperNode [2019-11-15 22:49:02,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:49:02,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:49:02,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:49:02,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:49:02,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:02" (1/1) ... [2019-11-15 22:49:02,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:02" (1/1) ... [2019-11-15 22:49:02,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:49:02,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:49:02,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:49:02,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:49:02,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:02" (1/1) ... [2019-11-15 22:49:02,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:02" (1/1) ... [2019-11-15 22:49:02,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:02" (1/1) ... [2019-11-15 22:49:02,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:02" (1/1) ... [2019-11-15 22:49:02,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:02" (1/1) ... [2019-11-15 22:49:02,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:02" (1/1) ... [2019-11-15 22:49:02,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:02" (1/1) ... [2019-11-15 22:49:02,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:49:02,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:49:02,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:49:02,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:49:02,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/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 [2019-11-15 22:49:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:49:02,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:49:03,149 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:49:03,149 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-15 22:49:03,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:49:03 BoogieIcfgContainer [2019-11-15 22:49:03,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:49:03,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:49:03,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:49:03,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:49:03,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:49:02" (1/3) ... [2019-11-15 22:49:03,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b5d052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:49:03, skipping insertion in model container [2019-11-15 22:49:03,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:02" (2/3) ... [2019-11-15 22:49:03,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b5d052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:49:03, skipping insertion in model container [2019-11-15 22:49:03,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:49:03" (3/3) ... [2019-11-15 22:49:03,159 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt_biNewton_pseudoconstant.c [2019-11-15 22:49:03,170 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:49:03,177 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:49:03,190 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:49:03,212 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:49:03,212 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:49:03,212 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:49:03,212 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:49:03,212 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:49:03,213 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:49:03,213 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:49:03,213 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:49:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-11-15 22:49:03,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:49:03,236 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:03,237 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:49:03,240 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:03,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:03,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1706227183, now seen corresponding path program 1 times [2019-11-15 22:49:03,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:49:03,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945285395] [2019-11-15 22:49:03,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:03,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:49:03,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:49:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:49:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:49:03,383 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:49:03,383 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:49:03,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:49:03 BoogieIcfgContainer [2019-11-15 22:49:03,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:49:03,411 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:49:03,411 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:49:03,411 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:49:03,412 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:49:03" (3/4) ... [2019-11-15 22:49:03,416 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:49:03,416 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:49:03,419 INFO L168 Benchmark]: Toolchain (without parser) took 1111.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:49:03,420 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:49:03,421 INFO L168 Benchmark]: CACSL2BoogieTranslator took 469.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -209.0 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:49:03,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:49:03,423 INFO L168 Benchmark]: Boogie Preprocessor took 48.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:49:03,424 INFO L168 Benchmark]: RCFGBuilder took 271.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:49:03,424 INFO L168 Benchmark]: TraceAbstraction took 258.47 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: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:49:03,425 INFO L168 Benchmark]: Witness Printer took 5.56 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:49:03,429 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 469.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -209.0 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 271.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 258.47 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: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.56 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: 1.3 MB). Peak memory consumption was 1.3 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 someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someUnaryDOUBLEoperation at line 20, overapproximation of someBinaryArithmeticDOUBLEoperation at line 33. Possible FailurePath: [L10] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L38] double d, dd, r; [L39] double epsilon = 1e-8; [L41] d = 1. VAL [_EPS=1/1000000] [L41] COND TRUE d <= 20. [L43] dd = __VERIFIER_nondet_double() [L14] double xn, xnp1, residu, lsup, linf; [L15] int i, cond; VAL [_EPS=1/1000000] [L16] COND TRUE Input <= 1.0 [L16] xn = 1.0 VAL [_EPS=1/1000000] [L17] xnp1 = xn [L18] residu = 2.0*_EPS*(xn+xnp1) [L19] lsup = _EPS * (xn+xnp1) [L20] linf = -lsup [L21] cond = ((residu > lsup) || (residu < linf)) [L22] i = 0 VAL [_EPS=1/1000000] [L23] COND FALSE !(\read(cond)) VAL [_EPS=1/1000000] [L33] return 1.0 / xnp1; VAL [_EPS=1/1000000] [L46] r = SqrtR(dd) [L8] COND TRUE !(cond) VAL [_EPS=1/1000000] [L8] __VERIFIER_error() VAL [_EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: 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.24-cad4683 [2019-11-15 22:49:06,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:49:06,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:49:06,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:49:06,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:49:06,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:49:06,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:49:06,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:49:06,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:49:06,164 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:49:06,165 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:49:06,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:49:06,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:49:06,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:49:06,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:49:06,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:49:06,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:49:06,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:49:06,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:49:06,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:49:06,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:49:06,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:49:06,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:49:06,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:49:06,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:49:06,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:49:06,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:49:06,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:49:06,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:49:06,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:49:06,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:49:06,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:49:06,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:49:06,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:49:06,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:49:06,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:49:06,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:49:06,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:49:06,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:49:06,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:49:06,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:49:06,206 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 22:49:06,229 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:49:06,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:49:06,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:49:06,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:49:06,232 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:49:06,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:49:06,232 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:49:06,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:49:06,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:49:06,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:49:06,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:49:06,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:49:06,234 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:49:06,234 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:49:06,234 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:49:06,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:49:06,235 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:49:06,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:49:06,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:49:06,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:49:06,236 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:49:06,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:49:06,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:49:06,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:49:06,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:49:06,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:49:06,237 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:49:06,237 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:49:06,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:49:06,238 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:49:06,238 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/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 -> 71bb07c94f4fe427420ff52287a2ed237302fad2 [2019-11-15 22:49:06,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:49:06,293 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:49:06,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:49:06,299 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:49:06,300 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:49:06,301 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c [2019-11-15 22:49:06,369 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/data/b81f05bd6/0c6bb860da3a403fa725f4894e6c0d57/FLAGfcf5f985c [2019-11-15 22:49:06,776 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:49:06,776 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant.c [2019-11-15 22:49:06,783 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/data/b81f05bd6/0c6bb860da3a403fa725f4894e6c0d57/FLAGfcf5f985c [2019-11-15 22:49:07,160 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/data/b81f05bd6/0c6bb860da3a403fa725f4894e6c0d57 [2019-11-15 22:49:07,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:49:07,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:49:07,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:49:07,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:49:07,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:49:07,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:49:07" (1/1) ... [2019-11-15 22:49:07,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5745738e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:07, skipping insertion in model container [2019-11-15 22:49:07,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:49:07" (1/1) ... [2019-11-15 22:49:07,181 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:49:07,201 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:49:07,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:49:07,490 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:49:07,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:49:07,534 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:49:07,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:07 WrapperNode [2019-11-15 22:49:07,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:49:07,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:49:07,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:49:07,536 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:49:07,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:07" (1/1) ... [2019-11-15 22:49:07,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:07" (1/1) ... [2019-11-15 22:49:07,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:49:07,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:49:07,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:49:07,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:49:07,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:07" (1/1) ... [2019-11-15 22:49:07,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:07" (1/1) ... [2019-11-15 22:49:07,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:07" (1/1) ... [2019-11-15 22:49:07,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:07" (1/1) ... [2019-11-15 22:49:07,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:07" (1/1) ... [2019-11-15 22:49:07,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:07" (1/1) ... [2019-11-15 22:49:07,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:07" (1/1) ... [2019-11-15 22:49:07,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:49:07,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:49:07,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:49:07,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:49:07,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/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 [2019-11-15 22:49:07,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:49:07,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:49:18,024 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:49:18,024 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-15 22:49:18,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:49:18 BoogieIcfgContainer [2019-11-15 22:49:18,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:49:18,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:49:18,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:49:18,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:49:18,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:49:07" (1/3) ... [2019-11-15 22:49:18,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6a0beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:49:18, skipping insertion in model container [2019-11-15 22:49:18,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:49:07" (2/3) ... [2019-11-15 22:49:18,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6a0beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:49:18, skipping insertion in model container [2019-11-15 22:49:18,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:49:18" (3/3) ... [2019-11-15 22:49:18,033 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt_biNewton_pseudoconstant.c [2019-11-15 22:49:18,042 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:49:18,050 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:49:18,062 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:49:18,087 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:49:18,087 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:49:18,088 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:49:18,088 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:49:18,088 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:49:18,088 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:49:18,089 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:49:18,089 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:49:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-11-15 22:49:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:49:18,106 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:18,107 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:49:18,109 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:18,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:18,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1706227183, now seen corresponding path program 1 times [2019-11-15 22:49:18,125 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:49:18,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866562083] [2019-11-15 22:49:18,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/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 [2019-11-15 22:49:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:20,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:49:20,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:49:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:20,111 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:49:22,246 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5))) is different from false [2019-11-15 22:49:24,331 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5))) is different from true [2019-11-15 22:49:33,948 WARN L191 SmtUtils]: Spent 3.90 s on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-11-15 22:49:33,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:49:33,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866562083] [2019-11-15 22:49:33,953 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:49:33,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-15 22:49:33,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558784675] [2019-11-15 22:49:33,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:49:33,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:49:33,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:49:33,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2019-11-15 22:49:33,971 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 8 states. [2019-11-15 22:49:36,929 WARN L860 $PredicateComparison]: unable to prove that (and (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~xn~0) (or (let ((.cse0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse0) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5)))) is different from true [2019-11-15 22:49:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:49:52,353 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2019-11-15 22:49:52,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:49:52,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-15 22:49:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:49:52,455 INFO L225 Difference]: With dead ends: 39 [2019-11-15 22:49:52,456 INFO L226 Difference]: Without dead ends: 17 [2019-11-15 22:49:52,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=19, Invalid=28, Unknown=3, NotChecked=22, Total=72 [2019-11-15 22:49:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-15 22:49:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-15 22:49:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 22:49:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-15 22:49:52,498 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2019-11-15 22:49:52,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:49:52,498 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-15 22:49:52,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:49:52,499 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-11-15 22:49:52,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:49:52,500 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:49:52,500 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:49:52,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-15 22:49:52,704 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:49:52,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:49:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash 68780179, now seen corresponding path program 1 times [2019-11-15 22:49:52,705 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:49:52,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081204638] [2019-11-15 22:49:52,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a27d4231-2b73-4d47-a849-3bd567ebd22a/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-15 22:49:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:49:58,534 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 22:49:58,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:50:01,099 WARN L838 $PredicateComparison]: unable to prove that (and (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse1)) (= (fp.div roundNearestTiesToEven .cse0 ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse0 .cse1)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0)))))) is different from false [2019-11-15 22:50:03,516 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse6 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xnp1~0 c_ULTIMATE.start_SqrtR_~xnp1~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse5) .cse6) (fp.mul roundNearestTiesToEven .cse5 .cse6)))) (.cse0 (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse3 .cse4)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse3 .cse4)) (= c_ULTIMATE.start_SqrtR_~xnp1~0 (fp.div roundNearestTiesToEven .cse3 ULTIMATE.start_SqrtR_~Input)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse3)))))) (.cse2 (= (_ bv1 32) c_ULTIMATE.start_SqrtR_~cond~0))) (or (and (= (_ bv0 32) c_ULTIMATE.start_SqrtR_~cond~0) .cse0 (exists ((ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xnp1~0 c_ULTIMATE.start_SqrtR_~xnp1~0)) ULTIMATE.start_SqrtR_~linf~0))) (not .cse1)) (and .cse1 .cse0 .cse2) (and .cse0 .cse2 (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xnp1~0 c_ULTIMATE.start_SqrtR_~xnp1~0)) v_prenex_1))))) is different from false [2019-11-15 22:50:05,558 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse6 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xnp1~0 c_ULTIMATE.start_SqrtR_~xnp1~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse5) .cse6) (fp.mul roundNearestTiesToEven .cse5 .cse6)))) (.cse0 (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse3 .cse4)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse3 .cse4)) (= c_ULTIMATE.start_SqrtR_~xnp1~0 (fp.div roundNearestTiesToEven .cse3 ULTIMATE.start_SqrtR_~Input)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse3)))))) (.cse2 (= (_ bv1 32) c_ULTIMATE.start_SqrtR_~cond~0))) (or (and (= (_ bv0 32) c_ULTIMATE.start_SqrtR_~cond~0) .cse0 (exists ((ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xnp1~0 c_ULTIMATE.start_SqrtR_~xnp1~0)) ULTIMATE.start_SqrtR_~linf~0))) (not .cse1)) (and .cse1 .cse0 .cse2) (and .cse0 .cse2 (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xnp1~0 c_ULTIMATE.start_SqrtR_~xnp1~0)) v_prenex_1))))) is different from true [2019-11-15 22:50:08,033 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse1)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse0 .cse1)) (= c_ULTIMATE.start_SqrtR_~xnp1~0 (fp.div roundNearestTiesToEven .cse0 ULTIMATE.start_SqrtR_~Input)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0))))) (exists ((ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xnp1~0 c_ULTIMATE.start_SqrtR_~xnp1~0)) ULTIMATE.start_SqrtR_~linf~0))) (not (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse3 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xnp1~0 c_ULTIMATE.start_SqrtR_~xnp1~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse2) .cse3) (fp.mul roundNearestTiesToEven .cse2 .cse3))))) is different from false [2019-11-15 22:50:10,504 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse1)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse0 .cse1)) (= c_ULTIMATE.start_SqrtR_~xnp1~0 (fp.div roundNearestTiesToEven .cse0 ULTIMATE.start_SqrtR_~Input)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0))))) (exists ((ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xnp1~0 c_ULTIMATE.start_SqrtR_~xnp1~0)) ULTIMATE.start_SqrtR_~linf~0))) (not (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse3 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xnp1~0 c_ULTIMATE.start_SqrtR_~xnp1~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse2) .cse3) (fp.mul roundNearestTiesToEven .cse2 .cse3))))) is different from true [2019-11-15 22:50:13,411 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse0 ULTIMATE.start_SqrtR_~Input))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse5 (fp.add roundNearestTiesToEven .cse1 .cse1))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse4) .cse5))) (and (= |c_ULTIMATE.start_SqrtR_#res| (fp.div roundNearestTiesToEven .cse0 .cse1)) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse2)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse0 .cse2)) (not (fp.gt .cse3 (fp.mul roundNearestTiesToEven .cse4 .cse5))) (not (fp.lt .cse3 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0)))))))) is different from false [2019-11-15 22:50:16,144 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse0 ULTIMATE.start_SqrtR_~Input))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse5 (fp.add roundNearestTiesToEven .cse1 .cse1))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse4) .cse5))) (and (= |c_ULTIMATE.start_SqrtR_#res| (fp.div roundNearestTiesToEven .cse0 .cse1)) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse2)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse0 .cse2)) (not (fp.gt .cse3 (fp.mul roundNearestTiesToEven .cse4 .cse5))) (not (fp.lt .cse3 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0)))))))) is different from true [2019-11-15 22:50:16,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:21,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:40,380 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse0 ULTIMATE.start_SqrtR_~Input))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse4 (fp.add roundNearestTiesToEven .cse5 .cse5))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse3) .cse4))) (and (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse1)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse0 .cse1)) (not (fp.gt .cse2 (fp.mul roundNearestTiesToEven .cse3 .cse4))) (not (fp.lt .cse2 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.geq (fp.div roundNearestTiesToEven .cse0 .cse5) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0)))))))) .cse6) (and (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse13 (fp.div roundNearestTiesToEven .cse7 ULTIMATE.start_SqrtR_~Input))) (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse12 (fp.add roundNearestTiesToEven .cse13 .cse13))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse10 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse11) .cse12)) (.cse9 (fp.div roundNearestTiesToEven .cse7 .cse13))) (and (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse7 .cse8)) (fp.geq .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse7 .cse8)) (not (fp.gt .cse10 (fp.mul roundNearestTiesToEven .cse11 .cse12))) (not (fp.lt .cse10 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse7)) (fp.leq .cse9 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)))))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse16 (fp.div roundNearestTiesToEven .cse14 ULTIMATE.start_SqrtR_~Input))) (let ((.cse18 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse19 (fp.add roundNearestTiesToEven .cse16 .cse16))) (let ((.cse15 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse17 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse18) .cse19))) (and (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse14 .cse15)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse14 .cse15)) (not (fp.leq (fp.div roundNearestTiesToEven .cse14 .cse16) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (not (fp.gt .cse17 (fp.mul roundNearestTiesToEven .cse18 .cse19))) (not (fp.lt .cse17 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse14)))))))) .cse6))) is different from false [2019-11-15 22:50:55,676 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.div roundNearestTiesToEven .cse0 ULTIMATE.start_SqrtR_~Input))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse5 (fp.add roundNearestTiesToEven .cse2 .cse2))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse4) .cse5))) (and (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse1)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse0 .cse1)) (not (fp.leq (fp.div roundNearestTiesToEven .cse0 .cse2) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (not (fp.gt .cse3 (fp.mul roundNearestTiesToEven .cse4 .cse5))) (not (fp.lt .cse3 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0)))))))) (exists ((v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse8 (fp.div roundNearestTiesToEven .cse7 v_prenex_2))) (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse11 (fp.add roundNearestTiesToEven .cse8 .cse8))) (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse6 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse10) .cse11))) (and (not (fp.lt .cse6 v_prenex_3)) (not (fp.geq (fp.div roundNearestTiesToEven .cse7 .cse8) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (fp.leq v_prenex_2 (fp.add roundNearestTiesToEven .cse7 .cse9)) (fp.geq v_prenex_2 (fp.sub roundNearestTiesToEven .cse7 .cse9)) (not (fp.leq v_prenex_2 .cse7)) (not (fp.gt .cse6 (fp.mul roundNearestTiesToEven .cse10 .cse11)))))))))) is different from false [2019-11-15 22:50:58,440 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.div roundNearestTiesToEven .cse0 ULTIMATE.start_SqrtR_~Input))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse5 (fp.add roundNearestTiesToEven .cse2 .cse2))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse3 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse4) .cse5))) (and (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse1)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse0 .cse1)) (not (fp.leq (fp.div roundNearestTiesToEven .cse0 .cse2) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (not (fp.gt .cse3 (fp.mul roundNearestTiesToEven .cse4 .cse5))) (not (fp.lt .cse3 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0)))))))) (exists ((v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse8 (fp.div roundNearestTiesToEven .cse7 v_prenex_2))) (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse11 (fp.add roundNearestTiesToEven .cse8 .cse8))) (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse6 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse10) .cse11))) (and (not (fp.lt .cse6 v_prenex_3)) (not (fp.geq (fp.div roundNearestTiesToEven .cse7 .cse8) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (fp.leq v_prenex_2 (fp.add roundNearestTiesToEven .cse7 .cse9)) (fp.geq v_prenex_2 (fp.sub roundNearestTiesToEven .cse7 .cse9)) (not (fp.leq v_prenex_2 .cse7)) (not (fp.gt .cse6 (fp.mul roundNearestTiesToEven .cse10 .cse11)))))))))) is different from true [2019-11-15 22:50:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:58,444 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:51:00,980 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)))) is different from false [2019-11-15 22:51:03,411 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)))) is different from true [2019-11-15 22:51:05,841 WARN L838 $PredicateComparison]: unable to prove that (or (not (= (_ bv0 32) c_ULTIMATE.start_SqrtR_~cond~0)) (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from false [2019-11-15 22:51:08,278 WARN L860 $PredicateComparison]: unable to prove that (or (not (= (_ bv0 32) c_ULTIMATE.start_SqrtR_~cond~0)) (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) is different from true [2019-11-15 22:51:10,812 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~xn~0)) (.cse1 (let ((.cse3 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse3) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse3)))) (.cse2 (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_7)))) (and (or (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) .cse1 .cse2) (or (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) .cse1 .cse2))) is different from false [2019-11-15 22:51:13,334 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~xn~0)) (.cse1 (let ((.cse3 (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse3) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse3)))) (.cse2 (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (fp.add roundNearestTiesToEven c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_7)))) (and (or (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) .cse1 .cse2) (or (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) .cse1 .cse2))) is different from true [2019-11-15 22:51:16,324 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse6 (fp.div roundNearestTiesToEven .cse5 c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.leq c_ULTIMATE.start_SqrtR_~Input .cse5)) (.cse3 (let ((.cse7 (fp.add roundNearestTiesToEven .cse6 .cse6))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse7) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse7)))) (.cse1 (fp.div roundNearestTiesToEven .cse5 .cse6))) (and (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add roundNearestTiesToEven .cse0 .cse0))) v_ULTIMATE.start_SqrtR_~linf~0_7)) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) .cse2 .cse3) (or (forall ((v_prenex_4 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse4 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add roundNearestTiesToEven .cse4 .cse4))) v_prenex_4)) .cse2 .cse3 (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))))) is different from false [2019-11-15 22:51:19,340 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse6 (fp.div roundNearestTiesToEven .cse5 c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.leq c_ULTIMATE.start_SqrtR_~Input .cse5)) (.cse3 (let ((.cse7 (fp.add roundNearestTiesToEven .cse6 .cse6))) (fp.gt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse7) (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse7)))) (.cse1 (fp.div roundNearestTiesToEven .cse5 .cse6))) (and (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add roundNearestTiesToEven .cse0 .cse0))) v_ULTIMATE.start_SqrtR_~linf~0_7)) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) .cse2 .cse3) (or (forall ((v_prenex_4 (_ FloatingPoint 11 53))) (fp.lt (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) (let ((.cse4 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add roundNearestTiesToEven .cse4 .cse4))) v_prenex_4)) .cse2 .cse3 (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))))) is different from true [2019-11-15 22:51:19,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:21,475 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_SqrtR_~Input_7 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse2 v_ULTIMATE.start_SqrtR_~Input_7))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse3 .cse3))) (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse1))) (or (fp.gt .cse0 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse1)) (fp.geq (fp.div roundNearestTiesToEven .cse2 .cse3) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) (not (fp.leq v_ULTIMATE.start_SqrtR_~Input_7 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (not (fp.geq v_ULTIMATE.start_SqrtR_~Input_7 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (fp.leq v_ULTIMATE.start_SqrtR_~Input_7 .cse2) (fp.lt .cse0 v_ULTIMATE.start_SqrtR_~linf~0_7))))))) (forall ((v_prenex_4 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_SqrtR_~Input_7 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse7 (fp.div roundNearestTiesToEven .cse6 v_ULTIMATE.start_SqrtR_~Input_7))) (let ((.cse5 (fp.add roundNearestTiesToEven .cse7 .cse7))) (let ((.cse4 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse5))) (or (fp.gt .cse4 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse5)) (not (fp.leq v_ULTIMATE.start_SqrtR_~Input_7 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (fp.lt .cse4 v_prenex_4) (fp.leq (fp.div roundNearestTiesToEven .cse6 .cse7) ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (not (fp.geq v_ULTIMATE.start_SqrtR_~Input_7 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (fp.leq v_ULTIMATE.start_SqrtR_~Input_7 .cse6)))))))) is different from false [2019-11-15 22:51:23,545 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-15 22:51:23,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-15 22:51:23,747 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:851) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:580) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 42 more [2019-11-15 22:51:23,753 INFO L168 Benchmark]: Toolchain (without parser) took 136587.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 951.0 MB in the beginning and 1.0 GB in the end (delta: -50.4 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:51:23,753 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:51:23,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.47 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:51:23,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:51:23,755 INFO L168 Benchmark]: Boogie Preprocessor took 34.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:51:23,756 INFO L168 Benchmark]: RCFGBuilder took 10330.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:51:23,757 INFO L168 Benchmark]: TraceAbstraction took 125724.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.7 MB). Peak memory consumption was 72.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:51:23,763 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 370.47 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.2 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 124.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 10330.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 125724.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.7 MB). Peak memory consumption was 72.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...