./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1032a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1032a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d015b2bc8cb93a5e0ac1240dd23d0cf22b0709d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1032a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d015b2bc8cb93a5e0ac1240dd23d0cf22b0709d ................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:44:51,643 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:44:51,645 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:44:51,652 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:44:51,652 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:44:51,653 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:44:51,653 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:44:51,654 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:44:51,656 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:44:51,656 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:44:51,657 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:44:51,657 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:44:51,658 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:44:51,658 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:44:51,659 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:44:51,659 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:44:51,660 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:44:51,661 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:44:51,662 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:44:51,663 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:44:51,664 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:44:51,665 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:44:51,667 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:44:51,667 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:44:51,667 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:44:51,668 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:44:51,668 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:44:51,669 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:44:51,669 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:44:51,670 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:44:51,670 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:44:51,671 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:44:51,671 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:44:51,671 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:44:51,672 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:44:51,672 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:44:51,672 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 02:44:51,683 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:44:51,683 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:44:51,683 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:44:51,684 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 02:44:51,684 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:44:51,684 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:44:51,684 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:44:51,684 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:44:51,685 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:44:51,685 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:44:51,685 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:44:51,685 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:44:51,685 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:44:51,685 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:44:51,685 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:44:51,685 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:44:51,685 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:44:51,686 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:44:51,686 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 02:44:51,686 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 02:44:51,686 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:44:51,686 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:44:51,686 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 02:44:51,686 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:44:51,686 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:44:51,686 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:44:51,687 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 02:44:51,687 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:44:51,687 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:44:51,687 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_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak 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 -> Kojak 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 -> 8d015b2bc8cb93a5e0ac1240dd23d0cf22b0709d [2018-11-23 02:44:51,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:44:51,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:44:51,718 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:44:51,719 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:44:51,719 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:44:51,720 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1032a_true-unreach-call.c [2018-11-23 02:44:51,756 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/data/68afaff7a/e74ab20d7ade46e4a77a756bf7c2fba3/FLAGd68dfe6c0 [2018-11-23 02:44:52,160 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:44:52,161 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/sv-benchmarks/c/float-newlib/double_req_bl_1032a_true-unreach-call.c [2018-11-23 02:44:52,165 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/data/68afaff7a/e74ab20d7ade46e4a77a756bf7c2fba3/FLAGd68dfe6c0 [2018-11-23 02:44:52,176 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/data/68afaff7a/e74ab20d7ade46e4a77a756bf7c2fba3 [2018-11-23 02:44:52,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:44:52,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:44:52,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:44:52,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:44:52,182 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:44:52,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:44:52" (1/1) ... [2018-11-23 02:44:52,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b5f2024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:52, skipping insertion in model container [2018-11-23 02:44:52,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:44:52" (1/1) ... [2018-11-23 02:44:52,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:44:52,206 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:44:52,327 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:44:52,329 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:44:52,351 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:44:52,364 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:44:52,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:52 WrapperNode [2018-11-23 02:44:52,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:44:52,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:44:52,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:44:52,365 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:44:52,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:52" (1/1) ... [2018-11-23 02:44:52,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:52" (1/1) ... [2018-11-23 02:44:52,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:44:52,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:44:52,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:44:52,404 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:44:52,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:52" (1/1) ... [2018-11-23 02:44:52,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:52" (1/1) ... [2018-11-23 02:44:52,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:52" (1/1) ... [2018-11-23 02:44:52,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:52" (1/1) ... [2018-11-23 02:44:52,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:52" (1/1) ... [2018-11-23 02:44:52,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:52" (1/1) ... [2018-11-23 02:44:52,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:52" (1/1) ... [2018-11-23 02:44:52,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:44:52,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:44:52,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:44:52,455 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:44:52,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 02:44:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 02:44:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:44:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 02:44:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:44:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:44:52,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:44:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:44:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:44:52,746 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:44:52,746 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 02:44:52,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:44:52 BoogieIcfgContainer [2018-11-23 02:44:52,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:44:52,747 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 02:44:52,747 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 02:44:52,754 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 02:44:52,754 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:44:52" (1/1) ... [2018-11-23 02:44:52,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:44:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:44:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 22 states and 34 transitions. [2018-11-23 02:44:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-11-23 02:44:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 02:44:52,784 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:44:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:44:52,851 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 02:44:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:44:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 22 states and 31 transitions. [2018-11-23 02:44:52,857 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-11-23 02:44:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 02:44:52,857 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:44:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:44:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:44:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:44:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:44:52,956 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := 0.0;round_double_#in~x := main_~x~0;havoc round_double_#res;havoc round_double_#t~mem0, round_double_#t~union1, round_double_#t~mem2, round_double_#t~union3, round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset, round_double_~exponent_mask~0, round_double_~exponent_mask~1, round_double_~tmp~0, round_double_#t~mem4, round_double_#t~union5.lsw, round_double_#t~union5.msw, round_double_~#iw_u~0.base, round_double_~#iw_u~0.offset, round_double_~x, round_double_~msw~0, round_double_~exponent_less_1023~0, round_double_~lsw~0;round_double_~x := round_double_#in~x;havoc round_double_~msw~0;havoc round_double_~exponent_less_1023~0;havoc round_double_~lsw~0; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_round_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_round_double_#in~x|=0.0] [?] call round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(round_double_~x, round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset, 8);call round_double_#t~mem0 := read~int(round_double_~#ew_u~0.base, 4 + round_double_~#ew_u~0.offset, 4);round_double_~msw~0 := (if round_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then round_double_#t~mem0 % 4294967296 % 4294967296 else round_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(round_double_#t~union1, round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset, 8);havoc round_double_#t~union1;havoc round_double_#t~mem0;call round_double_#t~mem2 := read~int(round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset, 4);round_double_~lsw~0 := round_double_#t~mem2;call write~real(round_double_#t~union3, round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset, 8);havoc round_double_#t~union3;havoc round_double_#t~mem2;call ULTIMATE.dealloc(round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset);havoc round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_round_double_~lsw~0=3, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_round_double_#in~x|=0.0] [?] goto; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_round_double_~lsw~0=3, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_round_double_#in~x|=0.0] [?] round_double_~exponent_less_1023~0 := ~bitwiseAnd(round_double_~msw~0, 2146435072) / 1048576 - 1023; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_round_double_~exponent_less_1023~0=52, ULTIMATE.start_round_double_~lsw~0=3, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_round_double_#in~x|=0.0] [?] assume !(round_double_~exponent_less_1023~0 < 20); VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_round_double_~exponent_less_1023~0=52, ULTIMATE.start_round_double_~lsw~0=3, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_round_double_#in~x|=0.0] [?] assume round_double_~exponent_less_1023~0 > 51;BeginParallelComposition{ParallelCodeBlock0: assume 1024 == round_double_~exponent_less_1023~0;round_double_#res := ~someBinaryArithmeticDOUBLEoperation(round_double_~x, round_double_~x);ParallelCodeBlock1: assume !(1024 == round_double_~exponent_less_1023~0);round_double_#res := round_double_~x;}EndParallelComposition VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_round_double_~exponent_less_1023~0=52, ULTIMATE.start_round_double_~lsw~0=3, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_round_double_#in~x|=0.0, |ULTIMATE.start_round_double_#res|=0.0] [?] main_#t~ret8 := round_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_round_double_~exponent_less_1023~0=52, ULTIMATE.start_round_double_~lsw~0=3, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~short10|=false, |ULTIMATE.start_round_double_#in~x|=0.0, |ULTIMATE.start_round_double_#res|=0.0] [?] assume !main_#t~short10; VAL [ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_round_double_~exponent_less_1023~0=52, ULTIMATE.start_round_double_~lsw~0=3, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~short10|=false, |ULTIMATE.start_round_double_#in~x|=0.0, |ULTIMATE.start_round_double_#res|=0.0] [?] assume !main_#t~short10;havoc main_#t~ret9;havoc main_#t~short10; VAL [ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_round_double_~exponent_less_1023~0=52, ULTIMATE.start_round_double_~lsw~0=3, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_round_double_#in~x|=0.0, |ULTIMATE.start_round_double_#res|=0.0] [?] assume !false; VAL [ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_round_double_~exponent_less_1023~0=52, ULTIMATE.start_round_double_~lsw~0=3, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_round_double_#in~x|=0.0, |ULTIMATE.start_round_double_#res|=0.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0; [L86] main_~x~0 := 0.0; [L87] round_double_#in~x := main_~x~0; [L87] havoc round_double_#res; [L87] havoc round_double_#t~mem0, round_double_#t~union1, round_double_#t~mem2, round_double_#t~union3, round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset, round_double_~exponent_mask~0, round_double_~exponent_mask~1, round_double_~tmp~0, round_double_#t~mem4, round_double_#t~union5.lsw, round_double_#t~union5.msw, round_double_~#iw_u~0.base, round_double_~#iw_u~0.offset, round_double_~x, round_double_~msw~0, round_double_~exponent_less_1023~0, round_double_~lsw~0; [L17-L64] round_double_~x := round_double_#in~x; [L18] havoc round_double_~msw~0; [L18] havoc round_double_~exponent_less_1023~0; [L19] havoc round_double_~lsw~0; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_~x=0.0] [L21] call round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L22] call write~real(round_double_~x, round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset, 8); [L23] call round_double_#t~mem0 := read~int(round_double_~#ew_u~0.base, 4 + round_double_~#ew_u~0.offset, 4); [L23] round_double_~msw~0 := (if round_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then round_double_#t~mem0 % 4294967296 % 4294967296 else round_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(round_double_#t~union1, round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset, 8); [L23] havoc round_double_#t~union1; [L23] havoc round_double_#t~mem0; [L24] call round_double_#t~mem2 := read~int(round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset, 4); [L24] round_double_~lsw~0 := round_double_#t~mem2; [L24] call write~real(round_double_#t~union3, round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset, 8); [L24] havoc round_double_#t~union3; [L24] havoc round_double_#t~mem2; [L21] call ULTIMATE.dealloc(round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset); [L21] havoc round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L26] round_double_~exponent_less_1023~0 := ~bitwiseAnd(round_double_~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L27-L56] assume !(round_double_~exponent_less_1023~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L41-L56] assume round_double_~exponent_less_1023~0 > 51; [L42-L45] assume !(1024 == round_double_~exponent_less_1023~0); [L45] round_double_#res := round_double_~x; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L87] main_#t~ret8 := round_double_#res; [L87] main_~res~0 := main_#t~ret8; [L87] havoc main_#t~ret8; [L90] main_#t~short10 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~short10=false, main_~res~0=0.0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L90] assume !main_#t~short10; VAL [#NULL.base=0, #NULL.offset=0, main_#t~short10=false, main_~res~0=0.0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L90-L93] assume !main_#t~short10; [L90] havoc main_#t~ret9; [L90] havoc main_#t~short10; VAL [#NULL.base=0, #NULL.offset=0, main_~res~0=0.0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L91] assert false; VAL [#NULL.base=0, #NULL.offset=0, main_~res~0=0.0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0; [L86] main_~x~0 := 0.0; [L87] round_double_#in~x := main_~x~0; [L87] havoc round_double_#res; [L87] havoc round_double_#t~mem0, round_double_#t~union1, round_double_#t~mem2, round_double_#t~union3, round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset, round_double_~exponent_mask~0, round_double_~exponent_mask~1, round_double_~tmp~0, round_double_#t~mem4, round_double_#t~union5.lsw, round_double_#t~union5.msw, round_double_~#iw_u~0.base, round_double_~#iw_u~0.offset, round_double_~x, round_double_~msw~0, round_double_~exponent_less_1023~0, round_double_~lsw~0; [L17-L64] round_double_~x := round_double_#in~x; [L18] havoc round_double_~msw~0; [L18] havoc round_double_~exponent_less_1023~0; [L19] havoc round_double_~lsw~0; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_~x=0.0] [L21] call round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L22] call write~real(round_double_~x, round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset, 8); [L23] call round_double_#t~mem0 := read~int(round_double_~#ew_u~0.base, 4 + round_double_~#ew_u~0.offset, 4); [L23] round_double_~msw~0 := (if round_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then round_double_#t~mem0 % 4294967296 % 4294967296 else round_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(round_double_#t~union1, round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset, 8); [L23] havoc round_double_#t~union1; [L23] havoc round_double_#t~mem0; [L24] call round_double_#t~mem2 := read~int(round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset, 4); [L24] round_double_~lsw~0 := round_double_#t~mem2; [L24] call write~real(round_double_#t~union3, round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset, 8); [L24] havoc round_double_#t~union3; [L24] havoc round_double_#t~mem2; [L21] call ULTIMATE.dealloc(round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset); [L21] havoc round_double_~#ew_u~0.base, round_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L26] round_double_~exponent_less_1023~0 := ~bitwiseAnd(round_double_~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L27-L56] assume !(round_double_~exponent_less_1023~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L41-L56] assume round_double_~exponent_less_1023~0 > 51; [L42-L45] assume !(1024 == round_double_~exponent_less_1023~0); [L45] round_double_#res := round_double_~x; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L87] main_#t~ret8 := round_double_#res; [L87] main_~res~0 := main_#t~ret8; [L87] havoc main_#t~ret8; [L90] main_#t~short10 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~short10=false, main_~res~0=0.0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L90] assume !main_#t~short10; VAL [#NULL.base=0, #NULL.offset=0, main_#t~short10=false, main_~res~0=0.0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L90-L93] assume !main_#t~short10; [L90] havoc main_#t~ret9; [L90] havoc main_#t~short10; VAL [#NULL.base=0, #NULL.offset=0, main_~res~0=0.0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L91] assert false; VAL [#NULL.base=0, #NULL.offset=0, main_~res~0=0.0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0; [L86] main_~x~0 := 0.0; [L87] round_double_#in~x := main_~x~0; [L87] havoc round_double_#res; [L87] havoc round_double_#t~mem0, round_double_#t~union1, round_double_#t~mem2, round_double_#t~union3, round_double_~#ew_u~0, round_double_~exponent_mask~0, round_double_~exponent_mask~1, round_double_~tmp~0, round_double_#t~mem4, round_double_#t~union5, round_double_~#iw_u~0, round_double_~x, round_double_~msw~0, round_double_~exponent_less_1023~0, round_double_~lsw~0; [L17-L64] round_double_~x := round_double_#in~x; [L18] havoc round_double_~msw~0; [L18] havoc round_double_~exponent_less_1023~0; [L19] havoc round_double_~lsw~0; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_~x=0.0] [L21] FCALL call round_double_~#ew_u~0 := #Ultimate.alloc(8); [L22] FCALL call write~real(round_double_~x, { base: round_double_~#ew_u~0!base, offset: round_double_~#ew_u~0!offset }, 8); [L23] FCALL call round_double_#t~mem0 := read~int({ base: round_double_~#ew_u~0!base, offset: 4 + round_double_~#ew_u~0!offset }, 4); [L23] round_double_~msw~0 := (if round_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then round_double_#t~mem0 % 4294967296 % 4294967296 else round_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(round_double_#t~union1, { base: round_double_~#ew_u~0!base, offset: round_double_~#ew_u~0!offset }, 8); [L23] havoc round_double_#t~union1; [L23] havoc round_double_#t~mem0; [L24] FCALL call round_double_#t~mem2 := read~int({ base: round_double_~#ew_u~0!base, offset: round_double_~#ew_u~0!offset }, 4); [L24] round_double_~lsw~0 := round_double_#t~mem2; [L24] FCALL call write~real(round_double_#t~union3, { base: round_double_~#ew_u~0!base, offset: round_double_~#ew_u~0!offset }, 8); [L24] havoc round_double_#t~union3; [L24] havoc round_double_#t~mem2; [L21] FCALL call ULTIMATE.dealloc(round_double_~#ew_u~0); [L21] havoc round_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L26] round_double_~exponent_less_1023~0 := ~bitwiseAnd(round_double_~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L27] COND FALSE !(round_double_~exponent_less_1023~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L41] COND TRUE round_double_~exponent_less_1023~0 > 51 [L42] COND FALSE !(1024 == round_double_~exponent_less_1023~0) [L45] round_double_#res := round_double_~x; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L87] main_#t~ret8 := round_double_#res; [L87] main_~res~0 := main_#t~ret8; [L87] havoc main_#t~ret8; [L90] main_#t~short10 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, main_#t~short10=false, main_~res~0=0.0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L90] COND FALSE !(main_#t~short10) VAL [#NULL!base=0, #NULL!offset=0, main_#t~short10=false, main_~res~0=0.0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L90] COND TRUE !main_#t~short10 [L90] havoc main_#t~ret9; [L90] havoc main_#t~short10; VAL [#NULL!base=0, #NULL!offset=0, main_~res~0=0.0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L91] assert false; VAL [#NULL!base=0, #NULL!offset=0, main_~res~0=0.0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0; [L86] main_~x~0 := 0.0; [L87] round_double_#in~x := main_~x~0; [L87] havoc round_double_#res; [L87] havoc round_double_#t~mem0, round_double_#t~union1, round_double_#t~mem2, round_double_#t~union3, round_double_~#ew_u~0, round_double_~exponent_mask~0, round_double_~exponent_mask~1, round_double_~tmp~0, round_double_#t~mem4, round_double_#t~union5, round_double_~#iw_u~0, round_double_~x, round_double_~msw~0, round_double_~exponent_less_1023~0, round_double_~lsw~0; [L17-L64] round_double_~x := round_double_#in~x; [L18] havoc round_double_~msw~0; [L18] havoc round_double_~exponent_less_1023~0; [L19] havoc round_double_~lsw~0; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_~x=0.0] [L21] FCALL call round_double_~#ew_u~0 := #Ultimate.alloc(8); [L22] FCALL call write~real(round_double_~x, { base: round_double_~#ew_u~0!base, offset: round_double_~#ew_u~0!offset }, 8); [L23] FCALL call round_double_#t~mem0 := read~int({ base: round_double_~#ew_u~0!base, offset: 4 + round_double_~#ew_u~0!offset }, 4); [L23] round_double_~msw~0 := (if round_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then round_double_#t~mem0 % 4294967296 % 4294967296 else round_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(round_double_#t~union1, { base: round_double_~#ew_u~0!base, offset: round_double_~#ew_u~0!offset }, 8); [L23] havoc round_double_#t~union1; [L23] havoc round_double_#t~mem0; [L24] FCALL call round_double_#t~mem2 := read~int({ base: round_double_~#ew_u~0!base, offset: round_double_~#ew_u~0!offset }, 4); [L24] round_double_~lsw~0 := round_double_#t~mem2; [L24] FCALL call write~real(round_double_#t~union3, { base: round_double_~#ew_u~0!base, offset: round_double_~#ew_u~0!offset }, 8); [L24] havoc round_double_#t~union3; [L24] havoc round_double_#t~mem2; [L21] FCALL call ULTIMATE.dealloc(round_double_~#ew_u~0); [L21] havoc round_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L26] round_double_~exponent_less_1023~0 := ~bitwiseAnd(round_double_~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L27] COND FALSE !(round_double_~exponent_less_1023~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L41] COND TRUE round_double_~exponent_less_1023~0 > 51 [L42] COND FALSE !(1024 == round_double_~exponent_less_1023~0) [L45] round_double_#res := round_double_~x; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L87] main_#t~ret8 := round_double_#res; [L87] main_~res~0 := main_#t~ret8; [L87] havoc main_#t~ret8; [L90] main_#t~short10 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, main_#t~short10=false, main_~res~0=0.0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L90] COND FALSE !(main_#t~short10) VAL [#NULL!base=0, #NULL!offset=0, main_#t~short10=false, main_~res~0=0.0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L90] COND TRUE !main_#t~short10 [L90] havoc main_#t~ret9; [L90] havoc main_#t~short10; VAL [#NULL!base=0, #NULL!offset=0, main_~res~0=0.0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [L91] assert false; VAL [#NULL!base=0, #NULL!offset=0, main_~res~0=0.0, main_~x~0=0.0, round_double_#in~x=0.0, round_double_#res=0.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=3, round_double_~msw~0=0, round_double_~x=0.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L86] ~x~0 := 0.0; [L17-L64] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~exponent_less_1023~0; [L19] havoc ~lsw~0; VAL [#NULL!base=0, #NULL!offset=0] [L21] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L22] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L23] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~union1; [L23] havoc #t~mem0; [L24] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L24] ~lsw~0 := #t~mem2; [L24] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~union3; [L24] havoc #t~mem2; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L26] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL!base=0, #NULL!offset=0] [L27] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#NULL!base=0, #NULL!offset=0] [L41] COND TRUE ~exponent_less_1023~0 > 51 [L42] COND FALSE !(1024 == ~exponent_less_1023~0) [L45] #res := ~x; VAL [#NULL!base=0, #NULL!offset=0] [L87] ~res~0 := #t~ret8; [L87] havoc #t~ret8; [L90] #t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L90] COND FALSE !(#t~short10) VAL [#NULL!base=0, #NULL!offset=0] [L90] COND TRUE !#t~short10 [L90] havoc #t~ret9; [L90] havoc #t~short10; VAL [#NULL!base=0, #NULL!offset=0] [L91] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L86] ~x~0 := 0.0; [L17-L64] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~exponent_less_1023~0; [L19] havoc ~lsw~0; VAL [#NULL!base=0, #NULL!offset=0] [L21] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L22] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L23] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~union1; [L23] havoc #t~mem0; [L24] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L24] ~lsw~0 := #t~mem2; [L24] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~union3; [L24] havoc #t~mem2; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L26] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL!base=0, #NULL!offset=0] [L27] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#NULL!base=0, #NULL!offset=0] [L41] COND TRUE ~exponent_less_1023~0 > 51 [L42] COND FALSE !(1024 == ~exponent_less_1023~0) [L45] #res := ~x; VAL [#NULL!base=0, #NULL!offset=0] [L87] ~res~0 := #t~ret8; [L87] havoc #t~ret8; [L90] #t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L90] COND FALSE !(#t~short10) VAL [#NULL!base=0, #NULL!offset=0] [L90] COND TRUE !#t~short10 [L90] havoc #t~ret9; [L90] havoc #t~short10; VAL [#NULL!base=0, #NULL!offset=0] [L91] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L86] double x = 0.0; [L18] __int32_t msw, exponent_less_1023; [L19] __uint32_t lsw; [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L26] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 [L27] COND FALSE !(exponent_less_1023 < 20) [L41] COND TRUE exponent_less_1023 > 51 [L42] COND FALSE !(exponent_less_1023 == 1024) [L45] return x; [L87] double res = round_double(x); [L90] EXPR res == 0.0 && __signbit_double(res) == 0 [L90] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L91] __VERIFIER_error() ----- [2018-11-23 02:44:52,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 02:44:52 ImpRootNode [2018-11-23 02:44:52,986 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 02:44:52,987 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:44:52,987 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:44:52,987 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:44:52,987 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:44:52" (3/4) ... [2018-11-23 02:44:52,991 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:44:52,991 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:44:52,991 INFO L168 Benchmark]: Toolchain (without parser) took 812.55 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 955.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:52,993 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:44:52,993 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.20 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:52,993 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.38 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 985.2 MB in the end (delta: -39.4 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:52,994 INFO L168 Benchmark]: Boogie Preprocessor took 51.23 ms. Allocated memory is still 1.0 GB. Free memory was 985.2 MB in the beginning and 1.0 GB in the end (delta: -17.3 MB). Peak memory consumption was 8.3 kB. Max. memory is 11.5 GB. [2018-11-23 02:44:52,994 INFO L168 Benchmark]: RCFGBuilder took 291.64 ms. Allocated memory is still 1.0 GB. Free memory was 1.0 GB in the beginning and 976.8 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:52,997 INFO L168 Benchmark]: CodeCheck took 239.25 ms. Allocated memory is still 1.0 GB. Free memory was 976.8 MB in the beginning and 955.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:52,998 INFO L168 Benchmark]: Witness Printer took 4.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:44:53,001 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 30 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 91]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of bitwiseAnd at line 26, overapproximation of someBinaryArithmeticDOUBLEoperation at line 43. Possible FailurePath: [L86] double x = 0.0; [L18] __int32_t msw, exponent_less_1023; [L19] __uint32_t lsw; [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L26] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 [L27] COND FALSE !(exponent_less_1023 < 20) [L41] COND TRUE exponent_less_1023 > 51 [L42] COND FALSE !(exponent_less_1023 == 1024) [L45] return x; [L87] double res = round_double(x); [L90] EXPR res == 0.0 && __signbit_double(res) == 0 [L90] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L91] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 185.20 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.38 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 985.2 MB in the end (delta: -39.4 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.23 ms. Allocated memory is still 1.0 GB. Free memory was 985.2 MB in the beginning and 1.0 GB in the end (delta: -17.3 MB). Peak memory consumption was 8.3 kB. Max. memory is 11.5 GB. * RCFGBuilder took 291.64 ms. Allocated memory is still 1.0 GB. Free memory was 1.0 GB in the beginning and 976.8 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * CodeCheck took 239.25 ms. Allocated memory is still 1.0 GB. Free memory was 976.8 MB in the beginning and 955.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.3 MB. There was no memory consumed. Max. memory is 11.5 GB. 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 02:44:54,438 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:44:54,440 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:44:54,448 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:44:54,448 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:44:54,449 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:44:54,450 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:44:54,451 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:44:54,452 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:44:54,453 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:44:54,453 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:44:54,453 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:44:54,454 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:44:54,455 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:44:54,455 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:44:54,456 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:44:54,457 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:44:54,458 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:44:54,459 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:44:54,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:44:54,461 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:44:54,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:44:54,463 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:44:54,463 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:44:54,463 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:44:54,464 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:44:54,465 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:44:54,465 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:44:54,466 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:44:54,466 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:44:54,467 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:44:54,467 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:44:54,467 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:44:54,467 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:44:54,468 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:44:54,468 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:44:54,469 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 02:44:54,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:44:54,479 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:44:54,480 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:44:54,480 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 02:44:54,481 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:44:54,481 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:44:54,481 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:44:54,481 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:44:54,481 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:44:54,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:44:54,481 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:44:54,482 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:44:54,482 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:44:54,482 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 02:44:54,482 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 02:44:54,482 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:44:54,482 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:44:54,482 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:44:54,482 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:44:54,482 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 02:44:54,483 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 02:44:54,483 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:44:54,483 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:44:54,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 02:44:54,483 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:44:54,483 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:44:54,483 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:44:54,483 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 02:44:54,484 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 02:44:54,484 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:44:54,484 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 02:44:54,484 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 02:44:54,484 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_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak 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 -> Kojak 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 -> 8d015b2bc8cb93a5e0ac1240dd23d0cf22b0709d [2018-11-23 02:44:54,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:44:54,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:44:54,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:44:54,526 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:44:54,527 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:44:54,527 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1032a_true-unreach-call.c [2018-11-23 02:44:54,570 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/data/accbcded3/7365234d461349cca5c63e86508e62df/FLAGed44e6e29 [2018-11-23 02:44:54,970 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:44:54,970 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/sv-benchmarks/c/float-newlib/double_req_bl_1032a_true-unreach-call.c [2018-11-23 02:44:54,974 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/data/accbcded3/7365234d461349cca5c63e86508e62df/FLAGed44e6e29 [2018-11-23 02:44:54,982 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/data/accbcded3/7365234d461349cca5c63e86508e62df [2018-11-23 02:44:54,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:44:54,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:44:54,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:44:54,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:44:54,989 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:44:54,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:44:54" (1/1) ... [2018-11-23 02:44:54,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2129d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:54, skipping insertion in model container [2018-11-23 02:44:54,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:44:54" (1/1) ... [2018-11-23 02:44:54,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:44:55,012 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:44:55,138 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:44:55,142 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:44:55,165 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:44:55,184 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:44:55,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:55 WrapperNode [2018-11-23 02:44:55,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:44:55,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:44:55,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:44:55,185 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:44:55,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:55" (1/1) ... [2018-11-23 02:44:55,197 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:55" (1/1) ... [2018-11-23 02:44:55,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:44:55,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:44:55,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:44:55,211 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:44:55,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:55" (1/1) ... [2018-11-23 02:44:55,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:55" (1/1) ... [2018-11-23 02:44:55,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:55" (1/1) ... [2018-11-23 02:44:55,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:55" (1/1) ... [2018-11-23 02:44:55,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:55" (1/1) ... [2018-11-23 02:44:55,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:55" (1/1) ... [2018-11-23 02:44:55,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:55" (1/1) ... [2018-11-23 02:44:55,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:44:55,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:44:55,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:44:55,274 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:44:55,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 02:44:55,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 02:44:55,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 02:44:55,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:44:55,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 02:44:55,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:44:55,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:44:55,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 02:44:55,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:44:55,441 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 02:44:55,477 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 02:44:56,051 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:44:56,051 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 02:44:56,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:44:56 BoogieIcfgContainer [2018-11-23 02:44:56,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:44:56,052 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 02:44:56,052 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 02:44:56,058 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 02:44:56,058 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:44:56" (1/1) ... [2018-11-23 02:44:56,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:44:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:44:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 22 states and 34 transitions. [2018-11-23 02:44:56,089 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-11-23 02:44:56,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 02:44:56,091 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:44:56,130 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 02:44:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:44:56,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:44:56,162 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 02:44:56,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:44:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 22 states and 31 transitions. [2018-11-23 02:44:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-11-23 02:44:56,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 02:44:56,171 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:44:56,172 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 02:44:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:44:56,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:44:56,252 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 02:44:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:44:56,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 20 states and 26 transitions. [2018-11-23 02:44:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2018-11-23 02:44:56,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 02:44:56,430 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:44:56,430 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 02:44:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:44:56,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:44:56,516 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 02:44:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:44:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 22 states and 29 transitions. [2018-11-23 02:44:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2018-11-23 02:44:56,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 02:44:56,966 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:44:56,967 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 02:44:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:44:56,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:44:56,978 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 02:44:56,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:44:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 22 states and 27 transitions. [2018-11-23 02:44:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2018-11-23 02:44:56,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 02:44:56,982 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:44:56,983 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 02:44:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:44:57,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:44:57,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-23 02:44:57,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-23 02:44:57,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 02:44:57,229 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:44:57,235 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:44:57,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:44:57,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:44:57,249 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:85, output treesize:34 [2018-11-23 02:44:57,261 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 02:44:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:44:57,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 19 states and 20 transitions. [2018-11-23 02:44:57,937 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 02:44:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 02:44:57,938 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:44:57,939 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 02:44:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:44:57,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:44:57,952 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 02:44:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:44:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 19 states and 18 transitions. [2018-11-23 02:44:57,956 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2018-11-23 02:44:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 02:44:57,956 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:44:57,957 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 02:44:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:44:57,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:44:58,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-23 02:44:58,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-23 02:44:58,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 02:44:58,105 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:44:58,108 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:44:58,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:44:58,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:44:58,122 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:85, output treesize:34 [2018-11-23 02:44:58,239 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:44:58,239 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:44:58,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 02:44:58,270 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:44:58,271 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:44:58,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-11-23 02:44:58,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:44:58,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 02:44:58,285 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:44:58,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 02:44:58,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:44:58,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:44:58,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:44:58,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:44:58,296 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 02:44:58,373 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 02:44:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:44:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 17 states and 16 transitions. [2018-11-23 02:44:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2018-11-23 02:44:58,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 02:44:58,841 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 8 iterations. [2018-11-23 02:44:58,847 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 02:44:58,908 INFO L579 CodeCheckObserver]: Invariant with dag size 3 [2018-11-23 02:44:58,914 INFO L579 CodeCheckObserver]: Invariant with dag size 3 [2018-11-23 02:44:58,914 INFO L579 CodeCheckObserver]: Invariant with dag size 1 [2018-11-23 02:44:58,915 INFO L579 CodeCheckObserver]: Invariant with dag size 12 [2018-11-23 02:44:58,915 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:44:58,916 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:44:58,916 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:44:58,916 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:44:58,917 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:44:58,917 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:44:58,917 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:44:58,917 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:44:58,919 INFO L579 CodeCheckObserver]: Invariant with dag size 3 [2018-11-23 02:44:58,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 02:44:58 ImpRootNode [2018-11-23 02:44:58,920 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 02:44:58,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:44:58,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:44:58,920 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:44:58,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:44:56" (3/4) ... [2018-11-23 02:44:58,924 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 02:44:58,931 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-23 02:44:58,931 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 02:44:58,932 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 02:44:58,948 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ~Pluszero~LONGDOUBLE() == \result [2018-11-23 02:44:58,949 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_q#valueAsBitvector_3 : bv64 :: v_q#valueAsBitvector_3[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_q#valueAsBitvector_3[63:63], v_q#valueAsBitvector_3[62:52], v_q#valueAsBitvector_3[51:0])) [2018-11-23 02:44:58,967 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5e159342-ab0e-4972-bcb6-e40e37d8d4c3/bin-2019/ukojak/witness.graphml [2018-11-23 02:44:58,967 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:44:58,968 INFO L168 Benchmark]: Toolchain (without parser) took 3982.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 948.6 MB in the beginning and 849.0 MB in the end (delta: 99.6 MB). Peak memory consumption was 250.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:58,969 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:44:58,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.75 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 932.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:58,969 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.42 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:44:58,970 INFO L168 Benchmark]: Boogie Preprocessor took 62.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -206.1 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:58,970 INFO L168 Benchmark]: RCFGBuilder took 777.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: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:58,970 INFO L168 Benchmark]: CodeCheck took 2868.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 855.7 MB in the end (delta: 244.7 MB). Peak memory consumption was 244.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:58,971 INFO L168 Benchmark]: Witness Printer took 46.80 ms. Allocated memory is still 1.2 GB. Free memory was 855.7 MB in the beginning and 849.0 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:58,972 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 30 locations, 1 error locations. SAFE Result, 2.7s OverallTime, 8 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1548 SDtfs, 510 SDslu, 340 SDs, 0 SdLazy, 2142 SolverSat, 480 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 656 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 79 ConstructedInterpolants, 15 QuantifiedInterpolants, 5376 SizeOfPredicates, 33 NumberOfNonLiveVariables, 259 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 91]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ~Pluszero~LONGDOUBLE() == \result - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 69]: Loop Invariant [2018-11-23 02:44:58,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:44:58,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:44:58,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:44:58,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:44:58,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:44:58,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:44:58,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] [2018-11-23 02:44:58,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] Derived loop invariant: (\exists v_q#valueAsBitvector_3 : bv64 :: v_q#valueAsBitvector_3[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_q#valueAsBitvector_3[63:63], v_q#valueAsBitvector_3[62:52], v_q#valueAsBitvector_3[51:0])) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: ~Pluszero~LONGDOUBLE() == x * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 197.75 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 932.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.42 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -206.1 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 777.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: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * CodeCheck took 2868.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 855.7 MB in the end (delta: 244.7 MB). Peak memory consumption was 244.7 MB. Max. memory is 11.5 GB. * Witness Printer took 46.80 ms. Allocated memory is still 1.2 GB. Free memory was 855.7 MB in the beginning and 849.0 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_3,QUANTIFIED] RESULT: Ultimate proved your program to be correct! Received shutdown request...