./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71bb07c94f4fe427420ff52287a2ed237302fad2 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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.23-aa41828 [2018-11-23 12:49:58,384 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:49:58,385 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:49:58,391 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:49:58,391 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:49:58,392 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:49:58,392 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:49:58,393 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:49:58,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:49:58,395 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:49:58,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:49:58,396 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:49:58,396 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:49:58,397 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:49:58,398 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:49:58,398 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:49:58,399 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:49:58,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:49:58,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:49:58,402 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:49:58,403 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:49:58,404 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:49:58,406 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:49:58,406 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:49:58,406 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:49:58,407 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:49:58,408 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:49:58,408 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:49:58,409 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:49:58,409 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:49:58,410 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:49:58,410 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:49:58,410 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:49:58,410 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:49:58,411 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:49:58,411 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:49:58,412 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:49:58,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:49:58,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:49:58,422 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:49:58,422 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:49:58,422 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:49:58,422 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:49:58,423 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:49:58,423 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:49:58,423 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:49:58,423 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:49:58,423 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:49:58,423 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:49:58,423 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:49:58,423 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:49:58,424 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:49:58,424 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:49:58,424 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:49:58,424 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:49:58,424 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:49:58,424 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:49:58,424 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:49:58,424 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:49:58,425 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:49:58,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:49:58,425 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:49:58,425 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:49:58,425 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:49:58,425 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:49:58,425 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:49:58,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:49:58,425 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71bb07c94f4fe427420ff52287a2ed237302fad2 [2018-11-23 12:49:58,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:49:58,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:49:58,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:49:58,457 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:49:58,458 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:49:58,458 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant_true-unreach-call.c [2018-11-23 12:49:58,493 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/data/1aa3bd0b8/5236172978464452b51658a84c26c88d/FLAG17ff86854 [2018-11-23 12:49:58,896 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:49:58,897 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant_true-unreach-call.c [2018-11-23 12:49:58,901 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/data/1aa3bd0b8/5236172978464452b51658a84c26c88d/FLAG17ff86854 [2018-11-23 12:49:58,911 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/data/1aa3bd0b8/5236172978464452b51658a84c26c88d [2018-11-23 12:49:58,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:49:58,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:49:58,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:49:58,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:49:58,917 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:49:58,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:49:58" (1/1) ... [2018-11-23 12:49:58,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ebf8353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:58, skipping insertion in model container [2018-11-23 12:49:58,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:49:58" (1/1) ... [2018-11-23 12:49:58,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:49:58,939 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:49:59,053 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:49:59,056 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:49:59,073 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:49:59,083 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:49:59,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:59 WrapperNode [2018-11-23 12:49:59,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:49:59,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:49:59,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:49:59,084 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:49:59,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:59" (1/1) ... [2018-11-23 12:49:59,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:59" (1/1) ... [2018-11-23 12:49:59,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:49:59,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:49:59,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:49:59,097 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:49:59,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:59" (1/1) ... [2018-11-23 12:49:59,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:59" (1/1) ... [2018-11-23 12:49:59,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:59" (1/1) ... [2018-11-23 12:49:59,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:59" (1/1) ... [2018-11-23 12:49:59,142 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:59" (1/1) ... [2018-11-23 12:49:59,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:59" (1/1) ... [2018-11-23 12:49:59,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:59" (1/1) ... [2018-11-23 12:49:59,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:49:59,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:49:59,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:49:59,148 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:49:59,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:49:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:49:59,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:49:59,178 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-23 12:49:59,178 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-11-23 12:49:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:49:59,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:49:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:49:59,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:49:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:49:59,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:49:59,300 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:49:59,300 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:49:59,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:49:59 BoogieIcfgContainer [2018-11-23 12:49:59,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:49:59,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:49:59,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:49:59,304 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:49:59,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:49:58" (1/3) ... [2018-11-23 12:49:59,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9226b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:49:59, skipping insertion in model container [2018-11-23 12:49:59,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:49:59" (2/3) ... [2018-11-23 12:49:59,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9226b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:49:59, skipping insertion in model container [2018-11-23 12:49:59,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:49:59" (3/3) ... [2018-11-23 12:49:59,307 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_biNewton_pseudoconstant_true-unreach-call.c [2018-11-23 12:49:59,316 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:49:59,322 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:49:59,334 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:49:59,358 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:49:59,359 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:49:59,359 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:49:59,359 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:49:59,359 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:49:59,360 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:49:59,360 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:49:59,360 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:49:59,360 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:49:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 12:49:59,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:49:59,374 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:49:59,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:49:59,376 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:49:59,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:49:59,379 INFO L82 PathProgramCache]: Analyzing trace with hash -995072322, now seen corresponding path program 1 times [2018-11-23 12:49:59,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:49:59,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:49:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:49:59,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:49:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:49:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:49:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:49:59,461 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~_EPS~0)|=2.0, ~_EPS~0=2.0] [?] ~_EPS~0 := 1.0E-6; VAL [|old(~_EPS~0)|=2.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume true; VAL [|old(~_EPS~0)|=2.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] RET #58#return; VAL [~_EPS~0=(/ 1.0 1000000.0)] [?] CALL call #t~ret4 := main(); VAL [~_EPS~0=(/ 1.0 1000000.0)] [?] havoc ~d~0;havoc ~dd~0;havoc ~r~0;~epsilon~0 := 1.0E-8;~d~0 := 1.0; VAL [main_~d~0=1.0, main_~epsilon~0=(/ 1.0 100000000.0), ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !!~someBinaryDOUBLEComparisonOperation(~d~0, 20.0);~dd~0 := #t~nondet2;havoc #t~nondet2;assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~dd~0, ~someBinaryArithmeticDOUBLEoperation(~d~0, ~epsilon~0)) && ~someBinaryDOUBLEComparisonOperation(~dd~0, ~someBinaryArithmeticDOUBLEoperation(~d~0, ~epsilon~0)) then 1 else 0); VAL [main_~dd~0=3.0, main_~d~0=1.0, main_~epsilon~0=(/ 1.0 100000000.0), ~_EPS~0=(/ 1.0 1000000.0)] [?] CALL call #t~ret3 := SqrtR(~dd~0); VAL [|SqrtR_#in~Input|=3.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] ~Input := #in~Input;havoc ~xn~0;havoc ~xnp1~0;havoc ~residu~0;havoc ~lsup~0;havoc ~linf~0;havoc ~i~0;havoc ~cond~0; VAL [SqrtR_~Input=3.0, |SqrtR_#in~Input|=3.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume ~someBinaryDOUBLEComparisonOperation(~Input, 1.0);~xn~0 := 1.0; VAL [SqrtR_~Input=3.0, SqrtR_~xn~0=1.0, |SqrtR_#in~Input|=3.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] ~xnp1~0 := ~xn~0;~residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0));~lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0));~linf~0 := ~someUnaryDOUBLEoperation(~lsup~0);~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~residu~0, ~lsup~0) || ~someBinaryDOUBLEComparisonOperation(~residu~0, ~linf~0) then 1 else 0);~i~0 := 0; VAL [SqrtR_~cond~0=0, SqrtR_~Input=3.0, SqrtR_~i~0=0, SqrtR_~xnp1~0=1.0, SqrtR_~xn~0=1.0, |SqrtR_#in~Input|=3.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !(0 != ~cond~0); VAL [SqrtR_~cond~0=0, SqrtR_~Input=3.0, SqrtR_~i~0=0, SqrtR_~xnp1~0=1.0, SqrtR_~xn~0=1.0, |SqrtR_#in~Input|=3.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~xnp1~0); VAL [SqrtR_~cond~0=0, SqrtR_~Input=3.0, SqrtR_~i~0=0, SqrtR_~xnp1~0=1.0, SqrtR_~xn~0=1.0, |SqrtR_#in~Input|=3.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume true; VAL [SqrtR_~cond~0=0, SqrtR_~Input=3.0, SqrtR_~i~0=0, SqrtR_~xnp1~0=1.0, SqrtR_~xn~0=1.0, |SqrtR_#in~Input|=3.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] RET #62#return; VAL [main_~dd~0=3.0, main_~d~0=1.0, main_~epsilon~0=(/ 1.0 100000000.0), |main_#t~ret3|=4.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] ~r~0 := #t~ret3;havoc #t~ret3; VAL [main_~dd~0=3.0, main_~d~0=1.0, main_~epsilon~0=(/ 1.0 100000000.0), main_~r~0=4.0, ~_EPS~0=(/ 1.0 1000000.0)] [?] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, 0.9) && ~someBinaryDOUBLEComparisonOperation(~r~0, 5.0) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~_EPS~0=(/ 1.0 1000000.0)] [?] CALL call ULTIMATE.init(); VAL [old(~_EPS~0)=2.0, ~_EPS~0=2.0] [L10] ~_EPS~0 := 1.0E-6; VAL [old(~_EPS~0)=2.0, ~_EPS~0=1/1000000] [?] ensures true; VAL [old(~_EPS~0)=2.0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~_EPS~0=1/1000000] [?] CALL call #t~ret4 := main(); VAL [~_EPS~0=1/1000000] [L38] havoc ~d~0; [L38] havoc ~dd~0; [L38] havoc ~r~0; [L39] ~epsilon~0 := 1.0E-8; [L41] ~d~0 := 1.0; VAL [~_EPS~0=1/1000000, ~d~0=1.0, ~epsilon~0=1/100000000] [L41-L49] assume !!~someBinaryDOUBLEComparisonOperation(~d~0, 20.0); [L43] ~dd~0 := #t~nondet2; [L43] havoc #t~nondet2; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~dd~0, ~someBinaryArithmeticDOUBLEoperation(~d~0, ~epsilon~0)) && ~someBinaryDOUBLEComparisonOperation(~dd~0, ~someBinaryArithmeticDOUBLEoperation(~d~0, ~epsilon~0)) then 1 else 0); VAL [~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000] [L46] CALL call #t~ret3 := SqrtR(~dd~0); VAL [#in~Input=3.0, ~_EPS~0=1/1000000] [L12-L34] ~Input := #in~Input; [L14] havoc ~xn~0; [L14] havoc ~xnp1~0; [L14] havoc ~residu~0; [L14] havoc ~lsup~0; [L14] havoc ~linf~0; [L15] havoc ~i~0; [L15] havoc ~cond~0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~Input=3.0] [L16] assume ~someBinaryDOUBLEComparisonOperation(~Input, 1.0); [L16] ~xn~0 := 1.0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~Input=3.0, ~xn~0=1.0] [L17] ~xnp1~0 := ~xn~0; [L18] ~residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L19] ~lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L20] ~linf~0 := ~someUnaryDOUBLEoperation(~lsup~0); [L21] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~residu~0, ~lsup~0) || ~someBinaryDOUBLEComparisonOperation(~residu~0, ~linf~0) then 1 else 0); [L22] ~i~0 := 0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L23-L32] assume !(0 != ~cond~0); VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L33] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~xnp1~0); VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L12-L34] ensures true; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L46] RET call #t~ret3 := SqrtR(~dd~0); VAL [#t~ret3=4.0, ~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000] [L46] ~r~0 := #t~ret3; [L46] havoc #t~ret3; VAL [~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000, ~r~0=4.0] [L48] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, 0.9) && ~someBinaryDOUBLEComparisonOperation(~r~0, 5.0) then 1 else 0)); VAL [#in~cond=0, ~_EPS~0=1/1000000] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L8] assume 0 == ~cond; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~_EPS~0)=2.0, ~_EPS~0=2.0] [L10] ~_EPS~0 := 1.0E-6; VAL [old(~_EPS~0)=2.0, ~_EPS~0=1/1000000] [?] ensures true; VAL [old(~_EPS~0)=2.0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~_EPS~0=1/1000000] [?] CALL call #t~ret4 := main(); VAL [~_EPS~0=1/1000000] [L38] havoc ~d~0; [L38] havoc ~dd~0; [L38] havoc ~r~0; [L39] ~epsilon~0 := 1.0E-8; [L41] ~d~0 := 1.0; VAL [~_EPS~0=1/1000000, ~d~0=1.0, ~epsilon~0=1/100000000] [L41-L49] assume !!~someBinaryDOUBLEComparisonOperation(~d~0, 20.0); [L43] ~dd~0 := #t~nondet2; [L43] havoc #t~nondet2; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~dd~0, ~someBinaryArithmeticDOUBLEoperation(~d~0, ~epsilon~0)) && ~someBinaryDOUBLEComparisonOperation(~dd~0, ~someBinaryArithmeticDOUBLEoperation(~d~0, ~epsilon~0)) then 1 else 0); VAL [~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000] [L46] CALL call #t~ret3 := SqrtR(~dd~0); VAL [#in~Input=3.0, ~_EPS~0=1/1000000] [L12-L34] ~Input := #in~Input; [L14] havoc ~xn~0; [L14] havoc ~xnp1~0; [L14] havoc ~residu~0; [L14] havoc ~lsup~0; [L14] havoc ~linf~0; [L15] havoc ~i~0; [L15] havoc ~cond~0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~Input=3.0] [L16] assume ~someBinaryDOUBLEComparisonOperation(~Input, 1.0); [L16] ~xn~0 := 1.0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~Input=3.0, ~xn~0=1.0] [L17] ~xnp1~0 := ~xn~0; [L18] ~residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L19] ~lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L20] ~linf~0 := ~someUnaryDOUBLEoperation(~lsup~0); [L21] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~residu~0, ~lsup~0) || ~someBinaryDOUBLEComparisonOperation(~residu~0, ~linf~0) then 1 else 0); [L22] ~i~0 := 0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L23-L32] assume !(0 != ~cond~0); VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L33] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~xnp1~0); VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L12-L34] ensures true; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L46] RET call #t~ret3 := SqrtR(~dd~0); VAL [#t~ret3=4.0, ~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000] [L46] ~r~0 := #t~ret3; [L46] havoc #t~ret3; VAL [~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000, ~r~0=4.0] [L48] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, 0.9) && ~someBinaryDOUBLEComparisonOperation(~r~0, 5.0) then 1 else 0)); VAL [#in~cond=0, ~_EPS~0=1/1000000] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L8] assume 0 == ~cond; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [old(~_EPS~0)=2.0, ~_EPS~0=2.0] [L10] ~_EPS~0 := 1.0E-6; VAL [old(~_EPS~0)=2.0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~_EPS~0=1/1000000] [?] CALL call #t~ret4 := main(); VAL [~_EPS~0=1/1000000] [L38] havoc ~d~0; [L38] havoc ~dd~0; [L38] havoc ~r~0; [L39] ~epsilon~0 := 1.0E-8; [L41] ~d~0 := 1.0; VAL [~_EPS~0=1/1000000, ~d~0=1.0, ~epsilon~0=1/100000000] [L41-L49] COND FALSE !(!~someBinaryDOUBLEComparisonOperation(~d~0, 20.0)) [L43] ~dd~0 := #t~nondet2; [L43] havoc #t~nondet2; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~dd~0, ~someBinaryArithmeticDOUBLEoperation(~d~0, ~epsilon~0)) && ~someBinaryDOUBLEComparisonOperation(~dd~0, ~someBinaryArithmeticDOUBLEoperation(~d~0, ~epsilon~0)) then 1 else 0); VAL [~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000] [L46] CALL call #t~ret3 := SqrtR(~dd~0); VAL [#in~Input=3.0, ~_EPS~0=1/1000000] [L12-L34] ~Input := #in~Input; [L14] havoc ~xn~0; [L14] havoc ~xnp1~0; [L14] havoc ~residu~0; [L14] havoc ~lsup~0; [L14] havoc ~linf~0; [L15] havoc ~i~0; [L15] havoc ~cond~0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~Input=3.0] [L16] COND TRUE ~someBinaryDOUBLEComparisonOperation(~Input, 1.0) [L16] ~xn~0 := 1.0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~Input=3.0, ~xn~0=1.0] [L17] ~xnp1~0 := ~xn~0; [L18] ~residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L19] ~lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L20] ~linf~0 := ~someUnaryDOUBLEoperation(~lsup~0); [L21] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~residu~0, ~lsup~0) || ~someBinaryDOUBLEComparisonOperation(~residu~0, ~linf~0) then 1 else 0); [L22] ~i~0 := 0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L23-L32] COND TRUE !(0 != ~cond~0) VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L33] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~xnp1~0); VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L46] RET call #t~ret3 := SqrtR(~dd~0); VAL [#t~ret3=4.0, ~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000] [L46] ~r~0 := #t~ret3; [L46] havoc #t~ret3; VAL [~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000, ~r~0=4.0] [L48] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, 0.9) && ~someBinaryDOUBLEComparisonOperation(~r~0, 5.0) then 1 else 0)); VAL [#in~cond=0, ~_EPS~0=1/1000000] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~_EPS~0)=2.0, ~_EPS~0=2.0] [L10] ~_EPS~0 := 1.0E-6; VAL [old(~_EPS~0)=2.0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~_EPS~0=1/1000000] [?] CALL call #t~ret4 := main(); VAL [~_EPS~0=1/1000000] [L38] havoc ~d~0; [L38] havoc ~dd~0; [L38] havoc ~r~0; [L39] ~epsilon~0 := 1.0E-8; [L41] ~d~0 := 1.0; VAL [~_EPS~0=1/1000000, ~d~0=1.0, ~epsilon~0=1/100000000] [L41-L49] COND FALSE !(!~someBinaryDOUBLEComparisonOperation(~d~0, 20.0)) [L43] ~dd~0 := #t~nondet2; [L43] havoc #t~nondet2; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~dd~0, ~someBinaryArithmeticDOUBLEoperation(~d~0, ~epsilon~0)) && ~someBinaryDOUBLEComparisonOperation(~dd~0, ~someBinaryArithmeticDOUBLEoperation(~d~0, ~epsilon~0)) then 1 else 0); VAL [~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000] [L46] CALL call #t~ret3 := SqrtR(~dd~0); VAL [#in~Input=3.0, ~_EPS~0=1/1000000] [L12-L34] ~Input := #in~Input; [L14] havoc ~xn~0; [L14] havoc ~xnp1~0; [L14] havoc ~residu~0; [L14] havoc ~lsup~0; [L14] havoc ~linf~0; [L15] havoc ~i~0; [L15] havoc ~cond~0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~Input=3.0] [L16] COND TRUE ~someBinaryDOUBLEComparisonOperation(~Input, 1.0) [L16] ~xn~0 := 1.0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~Input=3.0, ~xn~0=1.0] [L17] ~xnp1~0 := ~xn~0; [L18] ~residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L19] ~lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L20] ~linf~0 := ~someUnaryDOUBLEoperation(~lsup~0); [L21] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~residu~0, ~lsup~0) || ~someBinaryDOUBLEComparisonOperation(~residu~0, ~linf~0) then 1 else 0); [L22] ~i~0 := 0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L23-L32] COND TRUE !(0 != ~cond~0) VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L33] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~xnp1~0); VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L46] RET call #t~ret3 := SqrtR(~dd~0); VAL [#t~ret3=4.0, ~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000] [L46] ~r~0 := #t~ret3; [L46] havoc #t~ret3; VAL [~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000, ~r~0=4.0] [L48] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, 0.9) && ~someBinaryDOUBLEComparisonOperation(~r~0, 5.0) then 1 else 0)); VAL [#in~cond=0, ~_EPS~0=1/1000000] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [old(~_EPS~0)=2.0, ~_EPS~0=2.0] [L10] ~_EPS~0 := 1.0E-6; VAL [old(~_EPS~0)=2.0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~_EPS~0=1/1000000] [?] CALL call #t~ret4 := main(); VAL [~_EPS~0=1/1000000] [L38] havoc ~d~0; [L38] havoc ~dd~0; [L38] havoc ~r~0; [L39] ~epsilon~0 := 1.0E-8; [L41] ~d~0 := 1.0; VAL [~_EPS~0=1/1000000, ~d~0=1.0, ~epsilon~0=1/100000000] [L41-L49] COND FALSE !(!~someBinaryDOUBLEComparisonOperation(~d~0, 20.0)) [L43] ~dd~0 := #t~nondet2; [L43] havoc #t~nondet2; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~dd~0, ~someBinaryArithmeticDOUBLEoperation(~d~0, ~epsilon~0)) && ~someBinaryDOUBLEComparisonOperation(~dd~0, ~someBinaryArithmeticDOUBLEoperation(~d~0, ~epsilon~0)) then 1 else 0); VAL [~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000] [L46] CALL call #t~ret3 := SqrtR(~dd~0); VAL [#in~Input=3.0, ~_EPS~0=1/1000000] [L12-L34] ~Input := #in~Input; [L14] havoc ~xn~0; [L14] havoc ~xnp1~0; [L14] havoc ~residu~0; [L14] havoc ~lsup~0; [L14] havoc ~linf~0; [L15] havoc ~i~0; [L15] havoc ~cond~0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~Input=3.0] [L16] COND TRUE ~someBinaryDOUBLEComparisonOperation(~Input, 1.0) [L16] ~xn~0 := 1.0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~Input=3.0, ~xn~0=1.0] [L17] ~xnp1~0 := ~xn~0; [L18] ~residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L19] ~lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L20] ~linf~0 := ~someUnaryDOUBLEoperation(~lsup~0); [L21] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~residu~0, ~lsup~0) || ~someBinaryDOUBLEComparisonOperation(~residu~0, ~linf~0) then 1 else 0); [L22] ~i~0 := 0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L23-L32] COND TRUE !(0 != ~cond~0) VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L33] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~xnp1~0); VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L46] RET call #t~ret3 := SqrtR(~dd~0); VAL [#t~ret3=4.0, ~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000] [L46] ~r~0 := #t~ret3; [L46] havoc #t~ret3; VAL [~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000, ~r~0=4.0] [L48] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, 0.9) && ~someBinaryDOUBLEComparisonOperation(~r~0, 5.0) then 1 else 0)); VAL [#in~cond=0, ~_EPS~0=1/1000000] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~_EPS~0)=2.0, ~_EPS~0=2.0] [L10] ~_EPS~0 := 1.0E-6; VAL [old(~_EPS~0)=2.0, ~_EPS~0=1/1000000] [?] RET call ULTIMATE.init(); VAL [~_EPS~0=1/1000000] [?] CALL call #t~ret4 := main(); VAL [~_EPS~0=1/1000000] [L38] havoc ~d~0; [L38] havoc ~dd~0; [L38] havoc ~r~0; [L39] ~epsilon~0 := 1.0E-8; [L41] ~d~0 := 1.0; VAL [~_EPS~0=1/1000000, ~d~0=1.0, ~epsilon~0=1/100000000] [L41-L49] COND FALSE !(!~someBinaryDOUBLEComparisonOperation(~d~0, 20.0)) [L43] ~dd~0 := #t~nondet2; [L43] havoc #t~nondet2; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~dd~0, ~someBinaryArithmeticDOUBLEoperation(~d~0, ~epsilon~0)) && ~someBinaryDOUBLEComparisonOperation(~dd~0, ~someBinaryArithmeticDOUBLEoperation(~d~0, ~epsilon~0)) then 1 else 0); VAL [~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000] [L46] CALL call #t~ret3 := SqrtR(~dd~0); VAL [#in~Input=3.0, ~_EPS~0=1/1000000] [L12-L34] ~Input := #in~Input; [L14] havoc ~xn~0; [L14] havoc ~xnp1~0; [L14] havoc ~residu~0; [L14] havoc ~lsup~0; [L14] havoc ~linf~0; [L15] havoc ~i~0; [L15] havoc ~cond~0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~Input=3.0] [L16] COND TRUE ~someBinaryDOUBLEComparisonOperation(~Input, 1.0) [L16] ~xn~0 := 1.0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~Input=3.0, ~xn~0=1.0] [L17] ~xnp1~0 := ~xn~0; [L18] ~residu~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L19] ~lsup~0 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(~xn~0, ~xnp1~0)); [L20] ~linf~0 := ~someUnaryDOUBLEoperation(~lsup~0); [L21] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~residu~0, ~lsup~0) || ~someBinaryDOUBLEComparisonOperation(~residu~0, ~linf~0) then 1 else 0); [L22] ~i~0 := 0; VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L23-L32] COND TRUE !(0 != ~cond~0) VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L33] #res := ~someBinaryArithmeticDOUBLEoperation(1.0, ~xnp1~0); VAL [#in~Input=3.0, ~_EPS~0=1/1000000, ~cond~0=0, ~Input=3.0, ~i~0=0, ~xnp1~0=1.0, ~xn~0=1.0] [L46] RET call #t~ret3 := SqrtR(~dd~0); VAL [#t~ret3=4.0, ~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000] [L46] ~r~0 := #t~ret3; [L46] havoc #t~ret3; VAL [~_EPS~0=1/1000000, ~dd~0=3.0, ~d~0=1.0, ~epsilon~0=1/100000000, ~r~0=4.0] [L48] CALL call __VERIFIER_assert((if ~someBinaryDOUBLEComparisonOperation(~r~0, 0.9) && ~someBinaryDOUBLEComparisonOperation(~r~0, 5.0) then 1 else 0)); VAL [#in~cond=0, ~_EPS~0=1/1000000] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~_EPS~0=1/1000000, ~cond=0] [L10] double _EPS = 1e-6; VAL [\old(_EPS)=2, _EPS=1/1000000] [L38] double d, dd, r; [L39] double epsilon = 1e-8; [L41] d = 1. VAL [_EPS=1/1000000, d=1, epsilon=1/100000000] [L41] COND TRUE d <= 20. [L43] dd = __VERIFIER_nondet_double() [L46] CALL, EXPR SqrtR(dd) VAL [\old(Input)=3, _EPS=1/1000000] [L14] double xn, xnp1, residu, lsup, linf; [L15] int i, cond; VAL [\old(Input)=3, _EPS=1/1000000, Input=3] [L16] COND TRUE Input <= 1.0 [L16] xn = 1.0 VAL [\old(Input)=3, _EPS=1/1000000, Input=3, xn=1] [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 [\old(Input)=3, _EPS=1/1000000, cond=0, i=0, Input=3, xn=1, xn=1] [L23] COND FALSE !(\read(cond)) VAL [\old(Input)=3, _EPS=1/1000000, cond=0, i=0, Input=3, xn=1, xn=1] [L33] return 1.0 / xnp1; VAL [\old(Input)=3, _EPS=1/1000000, cond=0, i=0, Input=3, xn=1, xn=1] [L46] RET, EXPR SqrtR(dd) VAL [_EPS=1/1000000, d=3, d=1, epsilon=1/100000000, SqrtR(dd)=4] [L46] r = SqrtR(dd) [L48] CALL __VERIFIER_assert(r >= 0.9 && r <= 5.) VAL [\old(cond)=0, _EPS=1/1000000] [L8] COND TRUE !(cond) VAL [\old(cond)=0, _EPS=1/1000000, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, _EPS=1/1000000, cond=0] ----- [2018-11-23 12:49:59,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:49:59 BoogieIcfgContainer [2018-11-23 12:49:59,501 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:49:59,501 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:49:59,501 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:49:59,501 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:49:59,501 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:49:59" (3/4) ... [2018-11-23 12:49:59,504 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 12:49:59,504 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:49:59,505 INFO L168 Benchmark]: Toolchain (without parser) took 591.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 959.3 MB in the beginning and 1.1 GB in the end (delta: -143.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:49:59,506 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:49:59,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.72 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:49:59,507 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.38 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:49:59,507 INFO L168 Benchmark]: Boogie Preprocessor took 50.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 12:49:59,507 INFO L168 Benchmark]: RCFGBuilder took 153.64 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:49:59,508 INFO L168 Benchmark]: TraceAbstraction took 198.90 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-23 12:49:59,508 INFO L168 Benchmark]: Witness Printer took 3.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:49:59,511 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.72 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.38 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 153.64 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 198.90 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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 21, overapproximation of someUnaryDOUBLEoperation at line 20, overapproximation of someBinaryArithmeticDOUBLEoperation at line 33. Possible FailurePath: [L10] double _EPS = 1e-6; VAL [\old(_EPS)=2, _EPS=1/1000000] [L38] double d, dd, r; [L39] double epsilon = 1e-8; [L41] d = 1. VAL [_EPS=1/1000000, d=1, epsilon=1/100000000] [L41] COND TRUE d <= 20. [L43] dd = __VERIFIER_nondet_double() [L46] CALL, EXPR SqrtR(dd) VAL [\old(Input)=3, _EPS=1/1000000] [L14] double xn, xnp1, residu, lsup, linf; [L15] int i, cond; VAL [\old(Input)=3, _EPS=1/1000000, Input=3] [L16] COND TRUE Input <= 1.0 [L16] xn = 1.0 VAL [\old(Input)=3, _EPS=1/1000000, Input=3, xn=1] [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 [\old(Input)=3, _EPS=1/1000000, cond=0, i=0, Input=3, xn=1, xn=1] [L23] COND FALSE !(\read(cond)) VAL [\old(Input)=3, _EPS=1/1000000, cond=0, i=0, Input=3, xn=1, xn=1] [L33] return 1.0 / xnp1; VAL [\old(Input)=3, _EPS=1/1000000, cond=0, i=0, Input=3, xn=1, xn=1] [L46] RET, EXPR SqrtR(dd) VAL [_EPS=1/1000000, d=3, d=1, epsilon=1/100000000, SqrtR(dd)=4] [L46] r = SqrtR(dd) [L48] CALL __VERIFIER_assert(r >= 0.9 && r <= 5.) VAL [\old(cond)=0, _EPS=1/1000000] [L8] COND TRUE !(cond) VAL [\old(cond)=0, _EPS=1/1000000, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, _EPS=1/1000000, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 12:50:00,906 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:50:00,907 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:50:00,916 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:50:00,916 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:50:00,917 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:50:00,918 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:50:00,919 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:50:00,920 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:50:00,921 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:50:00,922 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:50:00,922 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:50:00,922 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:50:00,923 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:50:00,924 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:50:00,924 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:50:00,925 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:50:00,926 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:50:00,927 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:50:00,929 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:50:00,929 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:50:00,930 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:50:00,932 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:50:00,932 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:50:00,932 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:50:00,933 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:50:00,933 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:50:00,934 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:50:00,934 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:50:00,935 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:50:00,935 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:50:00,936 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:50:00,936 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:50:00,936 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:50:00,937 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:50:00,937 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:50:00,937 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 12:50:00,948 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:50:00,948 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:50:00,949 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:50:00,949 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:50:00,949 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:50:00,949 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:50:00,949 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:50:00,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:50:00,950 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:50:00,950 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:50:00,950 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:50:00,950 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:50:00,950 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:50:00,950 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:50:00,951 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 12:50:00,951 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 12:50:00,951 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:50:00,951 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:50:00,951 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:50:00,951 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:50:00,951 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:50:00,952 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:50:00,952 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:50:00,952 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:50:00,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:50:00,952 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:50:00,952 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:50:00,952 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:50:00,953 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 12:50:00,953 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:50:00,953 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 12:50:00,953 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 12:50:00,953 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71bb07c94f4fe427420ff52287a2ed237302fad2 [2018-11-23 12:50:00,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:50:00,994 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:50:00,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:50:00,998 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:50:00,998 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:50:00,999 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant_true-unreach-call.c [2018-11-23 12:50:01,036 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/data/2c3017f25/d8a7bda1e6d74b568e9bb21f087e1e65/FLAGd1cb016f7 [2018-11-23 12:50:01,438 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:50:01,438 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/sv-benchmarks/c/float-benchs/sqrt_biNewton_pseudoconstant_true-unreach-call.c [2018-11-23 12:50:01,444 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/data/2c3017f25/d8a7bda1e6d74b568e9bb21f087e1e65/FLAGd1cb016f7 [2018-11-23 12:50:01,454 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/data/2c3017f25/d8a7bda1e6d74b568e9bb21f087e1e65 [2018-11-23 12:50:01,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:50:01,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:50:01,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:50:01,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:50:01,462 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:50:01,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:50:01" (1/1) ... [2018-11-23 12:50:01,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36936f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:01, skipping insertion in model container [2018-11-23 12:50:01,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:50:01" (1/1) ... [2018-11-23 12:50:01,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:50:01,490 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:50:01,617 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:50:01,621 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:50:01,638 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:50:01,648 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:50:01,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:01 WrapperNode [2018-11-23 12:50:01,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:50:01,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:50:01,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:50:01,649 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:50:01,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:01" (1/1) ... [2018-11-23 12:50:01,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:01" (1/1) ... [2018-11-23 12:50:01,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:50:01,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:50:01,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:50:01,666 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:50:01,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:01" (1/1) ... [2018-11-23 12:50:01,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:01" (1/1) ... [2018-11-23 12:50:01,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:01" (1/1) ... [2018-11-23 12:50:01,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:01" (1/1) ... [2018-11-23 12:50:01,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:01" (1/1) ... [2018-11-23 12:50:01,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:01" (1/1) ... [2018-11-23 12:50:01,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:01" (1/1) ... [2018-11-23 12:50:01,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:50:01,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:50:01,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:50:01,689 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:50:01,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:50:01,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:50:01,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:50:01,770 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-11-23 12:50:01,770 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-11-23 12:50:01,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:50:01,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:50:01,770 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:50:01,770 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:50:01,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:50:01,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:50:10,384 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:50:10,384 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:50:10,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:50:10 BoogieIcfgContainer [2018-11-23 12:50:10,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:50:10,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:50:10,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:50:10,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:50:10,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:50:01" (1/3) ... [2018-11-23 12:50:10,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352131f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:50:10, skipping insertion in model container [2018-11-23 12:50:10,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:50:01" (2/3) ... [2018-11-23 12:50:10,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352131f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:50:10, skipping insertion in model container [2018-11-23 12:50:10,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:50:10" (3/3) ... [2018-11-23 12:50:10,391 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_biNewton_pseudoconstant_true-unreach-call.c [2018-11-23 12:50:10,399 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:50:10,404 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:50:10,414 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:50:10,432 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:50:10,432 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:50:10,432 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:50:10,432 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:50:10,432 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:50:10,433 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:50:10,433 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:50:10,433 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:50:10,433 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:50:10,443 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 12:50:10,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:50:10,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:50:10,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:50:10,449 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:50:10,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:10,452 INFO L82 PathProgramCache]: Analyzing trace with hash -995072322, now seen corresponding path program 1 times [2018-11-23 12:50:10,455 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:50:10,455 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 12:50:10,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:50:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:11,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:50:17,993 WARN L180 SmtUtils]: Spent 4.91 s on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-11-23 12:50:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:50:17,997 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:50:18,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:50:18,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:50:18,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:50:18,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:50:18,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:50:18,039 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2018-11-23 12:50:24,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:50:24,134 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2018-11-23 12:50:24,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:50:24,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:50:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:50:24,141 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:50:24,141 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:50:24,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:50:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:50:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:50:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:50:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 12:50:24,172 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2018-11-23 12:50:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:50:24,172 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 12:50:24,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:50:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 12:50:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:50:24,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:50:24,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:50:24,173 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:50:24,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:50:24,174 INFO L82 PathProgramCache]: Analyzing trace with hash -294007744, now seen corresponding path program 1 times [2018-11-23 12:50:24,174 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:50:24,174 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_068e6da0-0daa-42e1-965c-a87c7dad156e/bin-2019/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 [2018-11-23 12:50:24,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:50:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:50:28,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:50:30,466 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven .cse0 |c_SqrtR_#in~Input|) c_SqrtR_~xn~0) (not (fp.leq |c_SqrtR_#in~Input| .cse0)) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))))) is different from false [2018-11-23 12:50:33,035 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.div roundNearestTiesToEven .cse0 |c_SqrtR_#in~Input|) c_SqrtR_~xn~0) (not (fp.leq |c_SqrtR_#in~Input| .cse0)) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))))) is different from true [2018-11-23 12:50:35,361 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse4 (fp.add roundNearestTiesToEven c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (let ((.cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse4)) (.cse3 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse4))) (let ((.cse1 (fp.gt .cse2 .cse3)) (.cse0 (fp.lt .cse2 (fp.neg .cse3)))) (or (and (or .cse0 .cse1) (= (_ bv1 32) c_SqrtR_~cond~0)) (and (not .cse1) (= (_ bv0 32) c_SqrtR_~cond~0) (not .cse0)))))) (not (fp.leq |c_SqrtR_#in~Input| .cse5)) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= (fp.div roundNearestTiesToEven .cse5 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0))) is different from false [2018-11-23 12:50:37,633 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (let ((.cse4 (fp.add roundNearestTiesToEven c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (let ((.cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse4)) (.cse3 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse4))) (let ((.cse1 (fp.gt .cse2 .cse3)) (.cse0 (fp.lt .cse2 (fp.neg .cse3)))) (or (and (or .cse0 .cse1) (= (_ bv1 32) c_SqrtR_~cond~0)) (and (not .cse1) (= (_ bv0 32) c_SqrtR_~cond~0) (not .cse0)))))) (not (fp.leq |c_SqrtR_#in~Input| .cse5)) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= (fp.div roundNearestTiesToEven .cse5 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0))) is different from true [2018-11-23 12:50:40,010 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.add roundNearestTiesToEven c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse3)) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse3))) (and (not (fp.gt .cse0 .cse1)) (not (fp.leq |c_SqrtR_#in~Input| .cse2)) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= (fp.div roundNearestTiesToEven .cse2 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0) (not (fp.lt .cse0 (fp.neg .cse1)))))) is different from false [2018-11-23 12:50:42,086 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.add roundNearestTiesToEven c_SqrtR_~xnp1~0 c_SqrtR_~xnp1~0))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse3)) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse3))) (and (not (fp.gt .cse0 .cse1)) (not (fp.leq |c_SqrtR_#in~Input| .cse2)) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (= (fp.div roundNearestTiesToEven .cse2 |c_SqrtR_#in~Input|) c_SqrtR_~xnp1~0) (not (fp.lt .cse0 (fp.neg .cse1)))))) is different from true [2018-11-23 12:50:44,874 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse2 |c_SqrtR_#in~Input|))) (let ((.cse4 (fp.add roundNearestTiesToEven .cse3 .cse3))) (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse4)) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse4))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (= |c_SqrtR_#res| (fp.div roundNearestTiesToEven .cse2 .cse3)) (not (fp.leq |c_SqrtR_#in~Input| .cse2)) (not (fp.gt .cse0 .cse1)) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)))))))) is different from false [2018-11-23 12:50:47,321 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse2 |c_SqrtR_#in~Input|))) (let ((.cse4 (fp.add roundNearestTiesToEven .cse3 .cse3))) (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) c_~_EPS~0) .cse4)) (.cse1 (fp.mul roundNearestTiesToEven c_~_EPS~0 .cse4))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (= |c_SqrtR_#res| (fp.div roundNearestTiesToEven .cse2 .cse3)) (not (fp.leq |c_SqrtR_#in~Input| .cse2)) (not (fp.gt .cse0 .cse1)) (= c_~_EPS~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)))))))) is different from true [2018-11-23 12:50:50,026 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse4 (fp.div roundNearestTiesToEven .cse2 main_~dd~0))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse6 (fp.add roundNearestTiesToEven .cse4 .cse4))) (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse5) .cse6)) (.cse1 (fp.mul roundNearestTiesToEven .cse5 .cse6)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.leq main_~dd~0 .cse2)) (fp.leq main_~dd~0 (fp.add roundNearestTiesToEven .cse2 .cse3)) (not (fp.lt .cse0 (fp.neg .cse1))) (fp.geq main_~dd~0 (fp.sub roundNearestTiesToEven .cse2 .cse3)) (= |c_main_#t~ret3| (fp.div roundNearestTiesToEven .cse2 .cse4)))))))) is different from false [2018-11-23 12:50:52,544 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse4 (fp.div roundNearestTiesToEven .cse2 main_~dd~0))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse6 (fp.add roundNearestTiesToEven .cse4 .cse4))) (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse5) .cse6)) (.cse1 (fp.mul roundNearestTiesToEven .cse5 .cse6)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.leq main_~dd~0 .cse2)) (fp.leq main_~dd~0 (fp.add roundNearestTiesToEven .cse2 .cse3)) (not (fp.lt .cse0 (fp.neg .cse1))) (fp.geq main_~dd~0 (fp.sub roundNearestTiesToEven .cse2 .cse3)) (= |c_main_#t~ret3| (fp.div roundNearestTiesToEven .cse2 .cse4)))))))) is different from true [2018-11-23 12:50:55,225 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse2 main_~dd~0))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse6 (fp.add roundNearestTiesToEven .cse3 .cse3))) (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse5) .cse6)) (.cse1 (fp.mul roundNearestTiesToEven .cse5 .cse6)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.leq main_~dd~0 .cse2)) (= (fp.div roundNearestTiesToEven .cse2 .cse3) c_main_~r~0) (fp.leq main_~dd~0 (fp.add roundNearestTiesToEven .cse2 .cse4)) (not (fp.lt .cse0 (fp.neg .cse1))) (fp.geq main_~dd~0 (fp.sub roundNearestTiesToEven .cse2 .cse4)))))))) is different from false [2018-11-23 12:50:57,767 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~dd~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse2 main_~dd~0))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse6 (fp.add roundNearestTiesToEven .cse3 .cse3))) (let ((.cse0 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse5) .cse6)) (.cse1 (fp.mul roundNearestTiesToEven .cse5 .cse6)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.leq main_~dd~0 .cse2)) (= (fp.div roundNearestTiesToEven .cse2 .cse3) c_main_~r~0) (fp.leq main_~dd~0 (fp.add roundNearestTiesToEven .cse2 .cse4)) (not (fp.lt .cse0 (fp.neg .cse1))) (fp.geq main_~dd~0 (fp.sub roundNearestTiesToEven .cse2 .cse4)))))))) is different from true [2018-11-23 12:51:19,332 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-23 12:51:19,533 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2018-11-23 12:51:19,533 FATAL L265 ToolchainWalker]: 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:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) 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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) 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.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-11-23 12:51:19,537 INFO L168 Benchmark]: Toolchain (without parser) took 78079.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 949.7 MB in the beginning and 1.0 GB in the end (delta: -93.4 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:51:19,538 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:51:19,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.69 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 932.6 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-23 12:51:19,539 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.10 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:51:19,539 INFO L168 Benchmark]: Boogie Preprocessor took 22.50 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:51:19,540 INFO L168 Benchmark]: RCFGBuilder took 8696.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -172.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:51:19,540 INFO L168 Benchmark]: TraceAbstraction took 69150.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. [2018-11-23 12:51:19,543 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.69 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 932.6 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.10 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.50 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 8696.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -172.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69150.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.9 MB). Peak memory consumption was 61.9 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...