./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1_false-unreach-call.c.i --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_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1_false-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/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 34606649fc24a0c6046cbbdfba3b9ddb6bb91120 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1_false-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/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 34606649fc24a0c6046cbbdfba3b9ddb6bb91120 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:08:26,479 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:08:26,480 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:08:26,487 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:08:26,487 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:08:26,488 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:08:26,489 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:08:26,489 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:08:26,490 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:08:26,491 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:08:26,491 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:08:26,491 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:08:26,492 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:08:26,493 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:08:26,494 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:08:26,494 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:08:26,495 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:08:26,496 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:08:26,497 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:08:26,498 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:08:26,498 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:08:26,499 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:08:26,501 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:08:26,501 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:08:26,501 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:08:26,502 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:08:26,502 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:08:26,503 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:08:26,503 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:08:26,504 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:08:26,504 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:08:26,505 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:08:26,505 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:08:26,505 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:08:26,506 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:08:26,506 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:08:26,507 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:08:26,514 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:08:26,514 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:08:26,514 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:08:26,514 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:08:26,515 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:08:26,515 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:08:26,515 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:08:26,515 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:08:26,515 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:08:26,515 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:08:26,516 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:08:26,516 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:08:26,516 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:08:26,516 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:08:26,516 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:08:26,516 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:08:26,516 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:08:26,516 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:08:26,516 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:08:26,517 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:08:26,517 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:08:26,517 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:08:26,517 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:08:26,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:08:26,517 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:08:26,517 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:08:26,517 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:08:26,517 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:08:26,518 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:08:26,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:08:26,518 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_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/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 -> 34606649fc24a0c6046cbbdfba3b9ddb6bb91120 [2018-11-23 12:08:26,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:08:26,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:08:26,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:08:26,551 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:08:26,551 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:08:26,552 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/../../sv-benchmarks/c/loop-floats-scientific-comp/loop1_false-unreach-call.c.i [2018-11-23 12:08:26,586 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/data/604f65c16/46983501b91048daa87c347cea9d4168/FLAG2bd640044 [2018-11-23 12:08:26,904 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:08:26,904 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/sv-benchmarks/c/loop-floats-scientific-comp/loop1_false-unreach-call.c.i [2018-11-23 12:08:26,908 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/data/604f65c16/46983501b91048daa87c347cea9d4168/FLAG2bd640044 [2018-11-23 12:08:26,921 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/data/604f65c16/46983501b91048daa87c347cea9d4168 [2018-11-23 12:08:26,923 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:08:26,924 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:08:26,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:08:26,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:08:26,929 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:08:26,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:08:26" (1/1) ... [2018-11-23 12:08:26,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef06843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:26, skipping insertion in model container [2018-11-23 12:08:26,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:08:26" (1/1) ... [2018-11-23 12:08:26,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:08:26,957 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:08:27,070 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:08:27,073 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:08:27,083 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:08:27,091 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:08:27,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:27 WrapperNode [2018-11-23 12:08:27,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:08:27,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:08:27,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:08:27,092 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:08:27,097 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:08:27" (1/1) ... [2018-11-23 12:08:27,100 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:08:27" (1/1) ... [2018-11-23 12:08:27,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:08:27,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:08:27,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:08:27,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:08:27,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:27" (1/1) ... [2018-11-23 12:08:27,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:27" (1/1) ... [2018-11-23 12:08:27,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:27" (1/1) ... [2018-11-23 12:08:27,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:27" (1/1) ... [2018-11-23 12:08:27,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:27" (1/1) ... [2018-11-23 12:08:27,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:27" (1/1) ... [2018-11-23 12:08:27,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:27" (1/1) ... [2018-11-23 12:08:27,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:08:27,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:08:27,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:08:27,151 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:08:27,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/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:08:27,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:08:27,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:08:27,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:08:27,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:08:27,185 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:08:27,185 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:08:27,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:08:27,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:08:27,274 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:08:27,274 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:08:27,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:08:27 BoogieIcfgContainer [2018-11-23 12:08:27,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:08:27,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:08:27,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:08:27,277 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:08:27,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:08:26" (1/3) ... [2018-11-23 12:08:27,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794b21d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:08:27, skipping insertion in model container [2018-11-23 12:08:27,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:27" (2/3) ... [2018-11-23 12:08:27,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794b21d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:08:27, skipping insertion in model container [2018-11-23 12:08:27,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:08:27" (3/3) ... [2018-11-23 12:08:27,280 INFO L112 eAbstractionObserver]: Analyzing ICFG loop1_false-unreach-call.c.i [2018-11-23 12:08:27,286 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:08:27,290 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:08:27,303 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:08:27,328 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:08:27,328 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:08:27,329 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:08:27,329 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:08:27,329 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:08:27,329 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:08:27,329 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:08:27,329 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:08:27,329 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:08:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 12:08:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 12:08:27,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:27,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:27,347 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:27,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:27,350 INFO L82 PathProgramCache]: Analyzing trace with hash -722424895, now seen corresponding path program 1 times [2018-11-23 12:08:27,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:27,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:27,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:27,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:27,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:27,415 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:08:27,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:08:27,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:08:27,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:08:27,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:08:27,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:08:27,429 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 12:08:27,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:27,443 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 12:08:27,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:08:27,444 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 12:08:27,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:27,451 INFO L225 Difference]: With dead ends: 31 [2018-11-23 12:08:27,451 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 12:08:27,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:08:27,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 12:08:27,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 12:08:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:08:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 12:08:27,476 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 12:08:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:27,477 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 12:08:27,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:08:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 12:08:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 12:08:27,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:27,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:27,478 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:27,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:27,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1142459876, now seen corresponding path program 1 times [2018-11-23 12:08:27,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:27,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:27,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:27,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:27,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:08:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:08:27,513 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret4 := main(); [?] ~x~0 := #t~nondet1;havoc #t~nondet1;~exp~0 := 1.0;~term~0 := 1.0;~count~0 := 1;~result~0 := ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(2), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~x~0)));havoc ~temp~0; VAL [main_~count~0=1, main_~exp~0=1.0, main_~term~0=1.0, main_~x~0=2.0] [?] assume !false;~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0)));~exp~0 := ~someBinaryArithmeticFLOAToperation(~exp~0, ~term~0);#t~post2 := ~count~0;~count~0 := 1 + #t~post2;havoc #t~post2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~temp~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~count~0=2, main_~temp~0=0, main_~x~0=2.0] [?] assume 0 == ~temp~0; VAL [main_~count~0=2, main_~temp~0=0, main_~x~0=2.0] [?] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~result~0, ~exp~0) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := 1.0; [L17] ~term~0 := 1.0; [L18] ~count~0 := 1; [L19] ~result~0 := ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(2), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1, ~exp~0=1.0, ~term~0=1.0, ~x~0=2.0] [L22-L30] assume !false; [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L25] ~exp~0 := ~someBinaryArithmeticFLOAToperation(~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := 1 + #t~post2; [L26] havoc #t~post2; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L29] assume 0 == ~temp~0; VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L32] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~result~0, ~exp~0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := 1.0; [L17] ~term~0 := 1.0; [L18] ~count~0 := 1; [L19] ~result~0 := ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(2), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1, ~exp~0=1.0, ~term~0=1.0, ~x~0=2.0] [L22-L30] assume !false; [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L25] ~exp~0 := ~someBinaryArithmeticFLOAToperation(~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := 1 + #t~post2; [L26] havoc #t~post2; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L29] assume 0 == ~temp~0; VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L32] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~result~0, ~exp~0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := 1.0; [L17] ~term~0 := 1.0; [L18] ~count~0 := 1; [L19] ~result~0 := ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(2), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1, ~exp~0=1.0, ~term~0=1.0, ~x~0=2.0] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L25] ~exp~0 := ~someBinaryArithmeticFLOAToperation(~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := 1 + #t~post2; [L26] havoc #t~post2; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L29] COND TRUE 0 == ~temp~0 VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L32] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~result~0, ~exp~0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := 1.0; [L17] ~term~0 := 1.0; [L18] ~count~0 := 1; [L19] ~result~0 := ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(2), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1, ~exp~0=1.0, ~term~0=1.0, ~x~0=2.0] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L25] ~exp~0 := ~someBinaryArithmeticFLOAToperation(~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := 1 + #t~post2; [L26] havoc #t~post2; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L29] COND TRUE 0 == ~temp~0 VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L32] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~result~0, ~exp~0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := 1.0; [L17] ~term~0 := 1.0; [L18] ~count~0 := 1; [L19] ~result~0 := ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(2), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1, ~exp~0=1.0, ~term~0=1.0, ~x~0=2.0] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L25] ~exp~0 := ~someBinaryArithmeticFLOAToperation(~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := 1 + #t~post2; [L26] havoc #t~post2; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L29] COND TRUE 0 == ~temp~0 VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L32] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~result~0, ~exp~0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := 1.0; [L17] ~term~0 := 1.0; [L18] ~count~0 := 1; [L19] ~result~0 := ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(2), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1, ~exp~0=1.0, ~term~0=1.0, ~x~0=2.0] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L25] ~exp~0 := ~someBinaryArithmeticFLOAToperation(~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := 1 + #t~post2; [L26] havoc #t~post2; [L28] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L29] COND TRUE 0 == ~temp~0 VAL [~count~0=2, ~temp~0=0, ~x~0=2.0] [L32] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~result~0, ~exp~0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] [L15] float x = __VERIFIER_nondet_float() ; [L16] float exp = 1.0 ; [L17] float term = 1.0 ; [L18] unsigned int count = 1 ; [L19] float result = 2*(1/(1-x)) ; [L20] int temp ; VAL [count=1, exp=1, term=1, x=2] [L22] COND TRUE 1 [L24] term = term * (x/count) [L25] exp = exp + term [L26] count++ [L28] temp = __VERIFIER_nondet_int() [L29] COND TRUE temp ==0 VAL [count=2, temp=0, x=2] [L32] CALL __VERIFIER_assert( result >= exp ) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 12:08:27,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:08:27 BoogieIcfgContainer [2018-11-23 12:08:27,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:08:27,540 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:08:27,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:08:27,541 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:08:27,541 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:08:27" (3/4) ... [2018-11-23 12:08:27,544 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 12:08:27,544 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:08:27,544 INFO L168 Benchmark]: Toolchain (without parser) took 620.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -135.1 MB). Peak memory consumption was 1.2 MB. Max. memory is 11.5 GB. [2018-11-23 12:08:27,545 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:08:27,546 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.14 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-23 12:08:27,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.21 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:08:27,547 INFO L168 Benchmark]: Boogie Preprocessor took 47.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -189.7 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:08:27,547 INFO L168 Benchmark]: RCFGBuilder took 123.75 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:08:27,547 INFO L168 Benchmark]: TraceAbstraction took 264.67 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: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-23 12:08:27,548 INFO L168 Benchmark]: Witness Printer took 3.22 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:08:27,551 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 166.14 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.21 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -189.7 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 123.75 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 264.67 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: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.22 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 someBinaryArithmeticFLOAToperation at line 24. Possible FailurePath: [L15] float x = __VERIFIER_nondet_float() ; [L16] float exp = 1.0 ; [L17] float term = 1.0 ; [L18] unsigned int count = 1 ; [L19] float result = 2*(1/(1-x)) ; [L20] int temp ; VAL [count=1, exp=1, term=1, x=2] [L22] COND TRUE 1 [L24] term = term * (x/count) [L25] exp = exp + term [L26] count++ [L28] temp = __VERIFIER_nondet_int() [L29] COND TRUE temp ==0 VAL [count=2, temp=0, x=2] [L32] CALL __VERIFIER_assert( result >= exp ) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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:08:28,981 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:08:28,982 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:08:28,990 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:08:28,991 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:08:28,991 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:08:28,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:08:28,993 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:08:28,994 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:08:28,995 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:08:28,995 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:08:28,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:08:28,996 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:08:28,997 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:08:28,997 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:08:28,998 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:08:28,999 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:08:29,000 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:08:29,001 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:08:29,002 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:08:29,003 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:08:29,003 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:08:29,005 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:08:29,005 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:08:29,005 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:08:29,006 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:08:29,007 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:08:29,007 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:08:29,008 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:08:29,008 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:08:29,009 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:08:29,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:08:29,009 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:08:29,009 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:08:29,010 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:08:29,010 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:08:29,011 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 12:08:29,020 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:08:29,021 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:08:29,021 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:08:29,021 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:08:29,022 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:08:29,022 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:08:29,022 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:08:29,022 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:08:29,022 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:08:29,022 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:08:29,023 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:08:29,023 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:08:29,023 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:08:29,023 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:08:29,023 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 12:08:29,023 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 12:08:29,023 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:08:29,023 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:08:29,024 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:08:29,024 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:08:29,024 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:08:29,024 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:08:29,024 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:08:29,024 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:08:29,024 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:08:29,025 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:08:29,025 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:08:29,025 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:08:29,025 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 12:08:29,025 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:08:29,025 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 12:08:29,025 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 12:08:29,026 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_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/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 -> 34606649fc24a0c6046cbbdfba3b9ddb6bb91120 [2018-11-23 12:08:29,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:08:29,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:08:29,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:08:29,067 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:08:29,067 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:08:29,068 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/../../sv-benchmarks/c/loop-floats-scientific-comp/loop1_false-unreach-call.c.i [2018-11-23 12:08:29,107 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/data/2f0230de4/83a9fb1fac8549f19b3aee24a68eab15/FLAGb068985cc [2018-11-23 12:08:29,397 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:08:29,398 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/sv-benchmarks/c/loop-floats-scientific-comp/loop1_false-unreach-call.c.i [2018-11-23 12:08:29,401 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/data/2f0230de4/83a9fb1fac8549f19b3aee24a68eab15/FLAGb068985cc [2018-11-23 12:08:29,410 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/data/2f0230de4/83a9fb1fac8549f19b3aee24a68eab15 [2018-11-23 12:08:29,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:08:29,413 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:08:29,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:08:29,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:08:29,416 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:08:29,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:08:29" (1/1) ... [2018-11-23 12:08:29,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@396f9cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:29, skipping insertion in model container [2018-11-23 12:08:29,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:08:29" (1/1) ... [2018-11-23 12:08:29,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:08:29,438 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:08:29,552 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:08:29,556 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:08:29,567 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:08:29,576 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:08:29,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:29 WrapperNode [2018-11-23 12:08:29,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:08:29,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:08:29,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:08:29,577 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:08:29,583 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:08:29" (1/1) ... [2018-11-23 12:08:29,588 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:08:29" (1/1) ... [2018-11-23 12:08:29,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:08:29,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:08:29,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:08:29,592 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:08:29,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:29" (1/1) ... [2018-11-23 12:08:29,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:29" (1/1) ... [2018-11-23 12:08:29,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:29" (1/1) ... [2018-11-23 12:08:29,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:29" (1/1) ... [2018-11-23 12:08:29,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:29" (1/1) ... [2018-11-23 12:08:29,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:29" (1/1) ... [2018-11-23 12:08:29,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:29" (1/1) ... [2018-11-23 12:08:29,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:08:29,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:08:29,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:08:29,612 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:08:29,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/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:08:29,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:08:29,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:08:29,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:08:29,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:08:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:08:29,705 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:08:29,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:08:29,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:08:31,457 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:08:31,457 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:08:31,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:08:31 BoogieIcfgContainer [2018-11-23 12:08:31,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:08:31,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:08:31,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:08:31,460 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:08:31,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:08:29" (1/3) ... [2018-11-23 12:08:31,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2c5625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:08:31, skipping insertion in model container [2018-11-23 12:08:31,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:08:29" (2/3) ... [2018-11-23 12:08:31,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2c5625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:08:31, skipping insertion in model container [2018-11-23 12:08:31,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:08:31" (3/3) ... [2018-11-23 12:08:31,463 INFO L112 eAbstractionObserver]: Analyzing ICFG loop1_false-unreach-call.c.i [2018-11-23 12:08:31,470 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:08:31,474 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:08:31,486 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:08:31,504 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:08:31,504 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:08:31,504 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:08:31,505 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:08:31,505 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:08:31,505 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:08:31,505 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:08:31,505 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:08:31,505 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:08:31,519 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 12:08:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 12:08:31,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:31,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:31,525 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:31,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:31,528 INFO L82 PathProgramCache]: Analyzing trace with hash -722424895, now seen corresponding path program 1 times [2018-11-23 12:08:31,530 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:08:31,531 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/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:08:31,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:31,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:31,781 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:08:31,782 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:08:31,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:08:31,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:08:31,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:08:31,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:08:31,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:08:31,807 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 12:08:31,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:31,820 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 12:08:31,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:08:31,821 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 12:08:31,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:31,828 INFO L225 Difference]: With dead ends: 31 [2018-11-23 12:08:31,828 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 12:08:31,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:08:31,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 12:08:31,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 12:08:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:08:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 12:08:31,854 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 12:08:31,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:31,855 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 12:08:31,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:08:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 12:08:31,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 12:08:31,855 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:31,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:31,856 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:31,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:31,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1142459876, now seen corresponding path program 1 times [2018-11-23 12:08:31,857 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:08:31,857 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/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:08:31,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:08:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:08:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:08:32,916 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret4 := main(); [?] ~x~0 := #t~nondet1;havoc #t~nondet1;~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0));~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0));~count~0 := 1bv32;~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0)));havoc ~temp~0; VAL [main_~count~0=(_ bv1 32), main_~exp~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~result~0=(fp #b1 #b10000111 #b00010001000100010001001), main_~term~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~x~0=(fp #b0 #b01111111 #b00000001111000000000000)] [?] assume !false;~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0)));~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0);#t~post2 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~temp~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~count~0=(_ bv2 32), main_~exp~0=(fp #b0 #b10000000 #b00000000111100000000000), main_~result~0=(fp #b1 #b10000111 #b00010001000100010001001), main_~temp~0=(_ bv0 32), main_~term~0=(fp #b0 #b01111111 #b00000001111000000000000), main_~x~0=(fp #b0 #b01111111 #b00000001111000000000000)] [?] assume 0bv32 == ~temp~0; VAL [main_~count~0=(_ bv2 32), main_~exp~0=(fp #b0 #b10000000 #b00000000111100000000000), main_~result~0=(fp #b1 #b10000111 #b00010001000100010001001), main_~temp~0=(_ bv0 32), main_~term~0=(fp #b0 #b01111111 #b00000001111000000000000), main_~x~0=(fp #b0 #b01111111 #b00000001111000000000000)] [?] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] assume !false; [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] assume 0bv32 == ~temp~0; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] assume !false; [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] assume 0bv32 == ~temp~0; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [L15] float x = __VERIFIER_nondet_float() ; [L16] float exp = 1.0 ; [L17] float term = 1.0 ; [L18] unsigned int count = 1 ; [L19] float result = 2*(1/(1-x)) ; [L20] int temp ; VAL [count=1, exp=1.0, result=-273.0666809082031, term=1.0, x=1.00732421875] [L22] COND TRUE 1 [L24] term = term * (x/count) [L25] exp = exp + term [L26] count++ [L28] temp = __VERIFIER_nondet_int() [L29] COND TRUE temp ==0 VAL [count=2, exp=2.00732421875, result=-273.0666809082031, temp=0, term=1.00732421875, x=1.00732421875] [L32] CALL __VERIFIER_assert( result >= exp ) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 12:08:32,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:08:32 BoogieIcfgContainer [2018-11-23 12:08:32,943 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:08:32,943 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:08:32,943 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:08:32,943 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:08:32,944 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:08:31" (3/4) ... [2018-11-23 12:08:32,946 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret4 := main(); [?] ~x~0 := #t~nondet1;havoc #t~nondet1;~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0));~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0));~count~0 := 1bv32;~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0)));havoc ~temp~0; VAL [main_~count~0=(_ bv1 32), main_~exp~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~result~0=(fp #b1 #b10000111 #b00010001000100010001001), main_~term~0=(fp #b0 #b01111111 #b00000000000000000000000), main_~x~0=(fp #b0 #b01111111 #b00000001111000000000000)] [?] assume !false;~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0)));~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0);#t~post2 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2;~temp~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~count~0=(_ bv2 32), main_~exp~0=(fp #b0 #b10000000 #b00000000111100000000000), main_~result~0=(fp #b1 #b10000111 #b00010001000100010001001), main_~temp~0=(_ bv0 32), main_~term~0=(fp #b0 #b01111111 #b00000001111000000000000), main_~x~0=(fp #b0 #b01111111 #b00000001111000000000000)] [?] assume 0bv32 == ~temp~0; VAL [main_~count~0=(_ bv2 32), main_~exp~0=(fp #b0 #b10000000 #b00000000111100000000000), main_~result~0=(fp #b1 #b10000111 #b00010001000100010001001), main_~temp~0=(_ bv0 32), main_~term~0=(fp #b0 #b01111111 #b00000001111000000000000), main_~x~0=(fp #b0 #b01111111 #b00000001111000000000000)] [?] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] assume !false; [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] assume 0bv32 == ~temp~0; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] assume !false; [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] assume 0bv32 == ~temp~0; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L15] ~x~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] ~exp~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L17] ~term~0 := ~convertDOUBLEToFLOAT(~roundNearestTiesToEven, ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0)); [L18] ~count~0 := 1bv32; [L19] ~result~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 2bv32), ~fp.div~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~fp.sub~FLOAT(~roundNearestTiesToEven, ~convertINTToFLOAT(~roundNearestTiesToEven, 1bv32), ~x~0))); [L20] havoc ~temp~0; VAL [~count~0=1bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 0bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L22-L30] COND FALSE !(false) [L24] ~term~0 := ~fp.mul~FLOAT(~roundNearestTiesToEven, ~term~0, ~fp.div~FLOAT(~roundNearestTiesToEven, ~x~0, ~convertUINTToFLOAT(~roundNearestTiesToEven, ~count~0))); [L25] ~exp~0 := ~fp.add~FLOAT(~roundNearestTiesToEven, ~exp~0, ~term~0); [L26] #t~post2 := ~count~0; [L26] ~count~0 := ~bvadd32(1bv32, #t~post2); [L26] havoc #t~post2; [L28] ~temp~0 := #t~nondet3; [L28] havoc #t~nondet3; VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L29] COND TRUE 0bv32 == ~temp~0 VAL [~count~0=2bv32, ~exp~0=~fp~LONGDOUBLE(0bv1, 128bv8, 30720bv23), ~result~0=~fp~LONGDOUBLE(1bv1, 135bv8, 559241bv23), ~temp~0=0bv32, ~term~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23), ~x~0=~fp~LONGDOUBLE(0bv1, 127bv8, 61440bv23)] [L32] CALL call __VERIFIER_assert((if ~fp.geq~FLOAT(~result~0, ~exp~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L8] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L8] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [L15] float x = __VERIFIER_nondet_float() ; [L16] float exp = 1.0 ; [L17] float term = 1.0 ; [L18] unsigned int count = 1 ; [L19] float result = 2*(1/(1-x)) ; [L20] int temp ; VAL [count=1, exp=1.0, result=-273.0666809082031, term=1.0, x=1.00732421875] [L22] COND TRUE 1 [L24] term = term * (x/count) [L25] exp = exp + term [L26] count++ [L28] temp = __VERIFIER_nondet_int() [L29] COND TRUE temp ==0 VAL [count=2, exp=2.00732421875, result=-273.0666809082031, temp=0, term=1.00732421875, x=1.00732421875] [L32] CALL __VERIFIER_assert( result >= exp ) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 12:08:32,978 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3f26d6eb-ec0a-4d20-8f8b-29ba780e391a/bin-2019/uautomizer/witness.graphml [2018-11-23 12:08:32,979 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:08:32,979 INFO L168 Benchmark]: Toolchain (without parser) took 3566.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -136.9 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-23 12:08:32,980 INFO L168 Benchmark]: CDTParser took 0.16 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:08:32,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.84 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:08:32,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.61 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:08:32,981 INFO L168 Benchmark]: Boogie Preprocessor took 19.33 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:08:32,982 INFO L168 Benchmark]: RCFGBuilder took 1845.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:08:32,982 INFO L168 Benchmark]: TraceAbstraction took 1485.02 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: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:08:32,983 INFO L168 Benchmark]: Witness Printer took 35.60 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:08:32,985 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.84 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.61 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.33 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1845.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1485.02 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: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Witness Printer took 35.60 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: - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] float x = __VERIFIER_nondet_float() ; [L16] float exp = 1.0 ; [L17] float term = 1.0 ; [L18] unsigned int count = 1 ; [L19] float result = 2*(1/(1-x)) ; [L20] int temp ; VAL [count=1, exp=1.0, result=-273.0666809082031, term=1.0, x=1.00732421875] [L22] COND TRUE 1 [L24] term = term * (x/count) [L25] exp = exp + term [L26] count++ [L28] temp = __VERIFIER_nondet_int() [L29] COND TRUE temp ==0 VAL [count=2, exp=2.00732421875, result=-273.0666809082031, temp=0, term=1.00732421875, x=1.00732421875] [L32] CALL __VERIFIER_assert( result >= exp ) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 1.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 22 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...