./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1031_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_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1031_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/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 b9e27277237c869a286fcb7699394ad2f7d80117 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1031_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/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 b9e27277237c869a286fcb7699394ad2f7d80117 .................................................................................................................................................................................................................................................................................................... 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 07:06:46,961 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:06:46,963 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:06:46,970 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:06:46,970 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:06:46,971 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:06:46,972 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:06:46,973 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:06:46,975 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:06:46,975 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:06:46,976 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:06:46,976 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:06:46,977 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:06:46,978 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:06:46,979 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:06:46,979 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:06:46,980 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:06:46,981 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:06:46,982 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:06:46,983 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:06:46,984 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:06:46,985 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:06:46,986 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:06:46,986 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:06:46,986 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:06:46,987 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:06:46,987 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:06:46,988 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:06:46,989 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:06:46,989 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:06:46,990 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:06:46,990 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:06:46,990 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:06:46,991 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:06:46,992 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:06:46,992 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:06:46,992 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 07:06:47,002 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:06:47,002 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:06:47,003 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:06:47,003 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 07:06:47,004 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:06:47,004 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:06:47,004 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:06:47,004 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:06:47,004 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:06:47,005 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:06:47,005 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:06:47,005 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:06:47,005 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:06:47,005 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:06:47,005 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:06:47,006 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:06:47,006 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:06:47,006 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:06:47,006 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 07:06:47,006 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 07:06:47,006 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:06:47,007 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:06:47,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 07:06:47,007 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:06:47,007 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:06:47,007 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:06:47,007 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 07:06:47,008 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:06:47,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:06:47,008 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_48ac7012-f855-45d7-864e-e1bd35223368/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 -> b9e27277237c869a286fcb7699394ad2f7d80117 [2018-11-23 07:06:47,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:06:47,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:06:47,054 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:06:47,055 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:06:47,055 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:06:47,056 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1031_true-unreach-call.c [2018-11-23 07:06:47,111 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/data/a74d52cba/e00396dce6cd4606ac16e8219ff21e63/FLAGf10c28324 [2018-11-23 07:06:47,457 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:06:47,457 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/sv-benchmarks/c/float-newlib/double_req_bl_1031_true-unreach-call.c [2018-11-23 07:06:47,463 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/data/a74d52cba/e00396dce6cd4606ac16e8219ff21e63/FLAGf10c28324 [2018-11-23 07:06:47,475 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/data/a74d52cba/e00396dce6cd4606ac16e8219ff21e63 [2018-11-23 07:06:47,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:06:47,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:06:47,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:06:47,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:06:47,484 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:06:47,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:06:47" (1/1) ... [2018-11-23 07:06:47,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f3324f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:47, skipping insertion in model container [2018-11-23 07:06:47,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:06:47" (1/1) ... [2018-11-23 07:06:47,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:06:47,521 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:06:47,676 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:06:47,680 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:06:47,703 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:06:47,722 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:06:47,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:47 WrapperNode [2018-11-23 07:06:47,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:06:47,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:06:47,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:06:47,723 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:06:47,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:47" (1/1) ... [2018-11-23 07:06:47,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:47" (1/1) ... [2018-11-23 07:06:47,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:06:47,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:06:47,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:06:47,801 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:06:47,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:47" (1/1) ... [2018-11-23 07:06:47,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:47" (1/1) ... [2018-11-23 07:06:47,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:47" (1/1) ... [2018-11-23 07:06:47,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:47" (1/1) ... [2018-11-23 07:06:47,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:47" (1/1) ... [2018-11-23 07:06:47,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:47" (1/1) ... [2018-11-23 07:06:47,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:47" (1/1) ... [2018-11-23 07:06:47,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:06:47,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:06:47,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:06:47,828 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:06:47,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/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 07:06:47,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 07:06:47,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 07:06:47,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 07:06:47,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 07:06:47,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:06:47,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:06:47,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 07:06:47,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 07:06:48,137 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:06:48,137 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 07:06:48,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:06:48 BoogieIcfgContainer [2018-11-23 07:06:48,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:06:48,138 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 07:06:48,138 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 07:06:48,150 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 07:06:48,150 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:06:48" (1/1) ... [2018-11-23 07:06:48,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:06:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:06:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 18 states and 27 transitions. [2018-11-23 07:06:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2018-11-23 07:06:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 07:06:48,192 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:06:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:06:48,277 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 07:06:48,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:06:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 18 states and 24 transitions. [2018-11-23 07:06:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2018-11-23 07:06:48,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 07:06:48,285 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:06:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:06:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:06:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:06:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:06:48,389 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~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.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=3.0, ULTIMATE.start_round_double_~x=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_round_double_#in~x|=3.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~mem2;havoc round_double_#t~union3;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=3.0, ULTIMATE.start_round_double_~lsw~0=5, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_round_double_#in~x|=3.0] [?] goto; VAL [ULTIMATE.start_main_~x~0=3.0, ULTIMATE.start_round_double_~lsw~0=5, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_round_double_#in~x|=3.0] [?] round_double_~exponent_less_1023~0 := ~bitwiseAnd(round_double_~msw~0, 2146435072) / 1048576 - 1023; VAL [ULTIMATE.start_main_~x~0=3.0, ULTIMATE.start_round_double_~exponent_less_1023~0=52, ULTIMATE.start_round_double_~lsw~0=5, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_round_double_#in~x|=3.0] [?] assume !(round_double_~exponent_less_1023~0 < 20); VAL [ULTIMATE.start_main_~x~0=3.0, ULTIMATE.start_round_double_~exponent_less_1023~0=52, ULTIMATE.start_round_double_~lsw~0=5, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_round_double_#in~x|=3.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=3.0, ULTIMATE.start_round_double_~exponent_less_1023~0=52, ULTIMATE.start_round_double_~lsw~0=5, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_round_double_#in~x|=3.0, |ULTIMATE.start_round_double_#res|=3.0] [?] main_#t~ret6 := round_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_double_#in~x := main_~res~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0);main_#t~ret7 := isnan_double_#res;assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; VAL [ULTIMATE.start_isnan_double_~x=3.0, ULTIMATE.start_main_~res~0=3.0, ULTIMATE.start_main_~x~0=3.0, ULTIMATE.start_round_double_~exponent_less_1023~0=52, ULTIMATE.start_round_double_~lsw~0=5, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isnan_double_#in~x|=3.0, |ULTIMATE.start_isnan_double_#res|=0, |ULTIMATE.start_main_#t~ret7|=0, |ULTIMATE.start_round_double_#in~x|=3.0, |ULTIMATE.start_round_double_#res|=3.0] [?] assume 0 == main_#t~ret7;havoc main_#t~ret7; VAL [ULTIMATE.start_isnan_double_~x=3.0, ULTIMATE.start_main_~res~0=3.0, ULTIMATE.start_main_~x~0=3.0, ULTIMATE.start_round_double_~exponent_less_1023~0=52, ULTIMATE.start_round_double_~lsw~0=5, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isnan_double_#in~x|=3.0, |ULTIMATE.start_isnan_double_#res|=0, |ULTIMATE.start_round_double_#in~x|=3.0, |ULTIMATE.start_round_double_#res|=3.0] [?] assume !false; VAL [ULTIMATE.start_isnan_double_~x=3.0, ULTIMATE.start_main_~res~0=3.0, ULTIMATE.start_main_~x~0=3.0, ULTIMATE.start_round_double_~exponent_less_1023~0=52, ULTIMATE.start_round_double_~lsw~0=5, ULTIMATE.start_round_double_~msw~0=0, ULTIMATE.start_round_double_~x=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isnan_double_#in~x|=3.0, |ULTIMATE.start_isnan_double_#res|=0, |ULTIMATE.start_round_double_#in~x|=3.0, |ULTIMATE.start_round_double_#res|=3.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0; [L74] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L75] round_double_#in~x := main_~x~0; [L75] havoc round_double_#res; [L75] 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=3.0, round_double_#in~x=3.0, round_double_~x=3.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~mem2; [L24] havoc round_double_#t~union3; [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=3.0, round_double_#in~x=3.0, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.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=3.0, round_double_#in~x=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [L27-L56] assume !(round_double_~exponent_less_1023~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=3.0, round_double_#in~x=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.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=3.0, round_double_#in~x=3.0, round_double_#res=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [L75] main_#t~ret6 := round_double_#res; [L75] main_~res~0 := main_#t~ret6; [L75] havoc main_#t~ret6; [L78] isnan_double_#in~x := main_~res~0; [L78] havoc isnan_double_#res; [L78] havoc isnan_double_~x; [L15] isnan_double_~x := isnan_double_#in~x; [L15] isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); [L78] main_#t~ret7 := isnan_double_#res; [L78] assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_#t~ret7=0, main_~res~0=3.0, main_~x~0=3.0, round_double_#in~x=3.0, round_double_#res=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [L78-L81] assume 0 == main_#t~ret7; [L78] havoc main_#t~ret7; VAL [#NULL.base=0, #NULL.offset=0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_~res~0=3.0, main_~x~0=3.0, round_double_#in~x=3.0, round_double_#res=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [L79] assert false; VAL [#NULL.base=0, #NULL.offset=0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_~res~0=3.0, main_~x~0=3.0, round_double_#in~x=3.0, round_double_#res=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.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~ret6, main_#t~ret7, main_~x~0, main_~res~0; [L74] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L75] round_double_#in~x := main_~x~0; [L75] havoc round_double_#res; [L75] 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=3.0, round_double_#in~x=3.0, round_double_~x=3.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~mem2; [L24] havoc round_double_#t~union3; [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=3.0, round_double_#in~x=3.0, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.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=3.0, round_double_#in~x=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [L27-L56] assume !(round_double_~exponent_less_1023~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=3.0, round_double_#in~x=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.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=3.0, round_double_#in~x=3.0, round_double_#res=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [L75] main_#t~ret6 := round_double_#res; [L75] main_~res~0 := main_#t~ret6; [L75] havoc main_#t~ret6; [L78] isnan_double_#in~x := main_~res~0; [L78] havoc isnan_double_#res; [L78] havoc isnan_double_~x; [L15] isnan_double_~x := isnan_double_#in~x; [L15] isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); [L78] main_#t~ret7 := isnan_double_#res; [L78] assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_#t~ret7=0, main_~res~0=3.0, main_~x~0=3.0, round_double_#in~x=3.0, round_double_#res=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [L78-L81] assume 0 == main_#t~ret7; [L78] havoc main_#t~ret7; VAL [#NULL.base=0, #NULL.offset=0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_~res~0=3.0, main_~x~0=3.0, round_double_#in~x=3.0, round_double_#res=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [L79] assert false; VAL [#NULL.base=0, #NULL.offset=0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_~res~0=3.0, main_~x~0=3.0, round_double_#in~x=3.0, round_double_#res=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0; [L74] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L75] round_double_#in~x := main_~x~0; [L75] havoc round_double_#res; [L75] 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=3.0, round_double_#in~x=3.0, round_double_~x=3.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~mem2; [L24] havoc round_double_#t~union3; [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=3.0, round_double_#in~x=3.0, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.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=3.0, round_double_#in~x=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [L27] COND FALSE !(round_double_~exponent_less_1023~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=3.0, round_double_#in~x=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.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=3.0, round_double_#in~x=3.0, round_double_#res=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [L75] main_#t~ret6 := round_double_#res; [L75] main_~res~0 := main_#t~ret6; [L75] havoc main_#t~ret6; [L78] isnan_double_#in~x := main_~res~0; [L78] havoc isnan_double_#res; [L78] havoc isnan_double_~x; [L15] isnan_double_~x := isnan_double_#in~x; [L15] isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); [L78] main_#t~ret7 := isnan_double_#res; [L78] assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_#t~ret7=0, main_~res~0=3.0, main_~x~0=3.0, round_double_#in~x=3.0, round_double_#res=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [L78] COND TRUE 0 == main_#t~ret7 [L78] havoc main_#t~ret7; VAL [#NULL!base=0, #NULL!offset=0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_~res~0=3.0, main_~x~0=3.0, round_double_#in~x=3.0, round_double_#res=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [L79] assert false; VAL [#NULL!base=0, #NULL!offset=0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_~res~0=3.0, main_~x~0=3.0, round_double_#in~x=3.0, round_double_#res=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.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~ret6, main_#t~ret7, main_~x~0, main_~res~0; [L74] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L75] round_double_#in~x := main_~x~0; [L75] havoc round_double_#res; [L75] 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=3.0, round_double_#in~x=3.0, round_double_~x=3.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~mem2; [L24] havoc round_double_#t~union3; [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=3.0, round_double_#in~x=3.0, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.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=3.0, round_double_#in~x=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [L27] COND FALSE !(round_double_~exponent_less_1023~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=3.0, round_double_#in~x=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.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=3.0, round_double_#in~x=3.0, round_double_#res=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [L75] main_#t~ret6 := round_double_#res; [L75] main_~res~0 := main_#t~ret6; [L75] havoc main_#t~ret6; [L78] isnan_double_#in~x := main_~res~0; [L78] havoc isnan_double_#res; [L78] havoc isnan_double_~x; [L15] isnan_double_~x := isnan_double_#in~x; [L15] isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); [L78] main_#t~ret7 := isnan_double_#res; [L78] assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_#t~ret7=0, main_~res~0=3.0, main_~x~0=3.0, round_double_#in~x=3.0, round_double_#res=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [L78] COND TRUE 0 == main_#t~ret7 [L78] havoc main_#t~ret7; VAL [#NULL!base=0, #NULL!offset=0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_~res~0=3.0, main_~x~0=3.0, round_double_#in~x=3.0, round_double_#res=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [L79] assert false; VAL [#NULL!base=0, #NULL!offset=0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_~res~0=3.0, main_~x~0=3.0, round_double_#in~x=3.0, round_double_#res=3.0, round_double_~exponent_less_1023~0=52, round_double_~lsw~0=5, round_double_~msw~0=0, round_double_~x=3.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L74] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.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~mem2; [L24] havoc #t~union3; [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] [L75] ~res~0 := #t~ret6; [L75] havoc #t~ret6; [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); [L78] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L78] COND TRUE 0 == #t~ret7 [L78] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0] [L79] 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; [L74] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.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~mem2; [L24] havoc #t~union3; [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] [L75] ~res~0 := #t~ret6; [L75] havoc #t~ret6; [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); [L78] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L78] COND TRUE 0 == #t~ret7 [L78] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0] [L79] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L74] double x = 0.0 / 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; [L75] double res = round_double(x); [L15] return x != x; [L78] COND TRUE !isnan_double(res) [L79] __VERIFIER_error() ----- [2018-11-23 07:06:48,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 07:06:48 ImpRootNode [2018-11-23 07:06:48,427 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 07:06:48,427 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:06:48,428 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:06:48,428 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:06:48,429 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:06:48" (3/4) ... [2018-11-23 07:06:48,432 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 07:06:48,433 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:06:48,433 INFO L168 Benchmark]: Toolchain (without parser) took 954.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -123.6 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:06:48,435 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:06:48,435 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.85 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:06:48,435 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 07:06:48,436 INFO L168 Benchmark]: Boogie Preprocessor took 26.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:06:48,436 INFO L168 Benchmark]: RCFGBuilder took 310.08 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-11-23 07:06:48,437 INFO L168 Benchmark]: CodeCheck took 288.97 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-23 07:06:48,437 INFO L168 Benchmark]: Witness Printer took 5.21 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:06:48,442 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, 26 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 55 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, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 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: 79]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 15, overapproximation of someBinaryArithmeticDOUBLEoperation at line 43, overapproximation of bitwiseAnd at line 26. Possible FailurePath: [L74] double x = 0.0 / 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; [L75] double res = round_double(x); [L15] return x != x; [L78] COND TRUE !isnan_double(res) [L79] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 242.85 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 310.08 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * CodeCheck took 288.97 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.21 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: 2.7 MB). Peak memory consumption was 2.7 MB. 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 07:06:50,065 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:06:50,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:06:50,076 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:06:50,076 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:06:50,077 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:06:50,078 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:06:50,080 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:06:50,081 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:06:50,082 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:06:50,083 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:06:50,083 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:06:50,084 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:06:50,084 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:06:50,085 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:06:50,086 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:06:50,087 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:06:50,088 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:06:50,090 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:06:50,091 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:06:50,092 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:06:50,093 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:06:50,095 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:06:50,095 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:06:50,096 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:06:50,096 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:06:50,097 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:06:50,098 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:06:50,099 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:06:50,100 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:06:50,100 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:06:50,100 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:06:50,100 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:06:50,101 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:06:50,101 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:06:50,102 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:06:50,102 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 07:06:50,115 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:06:50,115 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:06:50,116 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:06:50,116 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 07:06:50,117 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:06:50,117 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:06:50,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:06:50,117 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:06:50,117 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:06:50,118 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:06:50,118 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:06:50,118 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:06:50,118 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:06:50,118 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 07:06:50,118 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 07:06:50,119 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:06:50,119 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:06:50,119 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:06:50,119 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:06:50,119 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 07:06:50,120 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 07:06:50,120 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:06:50,120 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:06:50,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 07:06:50,120 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:06:50,121 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:06:50,121 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:06:50,121 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 07:06:50,121 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 07:06:50,121 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:06:50,121 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 07:06:50,122 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 07:06:50,122 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_48ac7012-f855-45d7-864e-e1bd35223368/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 -> b9e27277237c869a286fcb7699394ad2f7d80117 [2018-11-23 07:06:50,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:06:50,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:06:50,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:06:50,174 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:06:50,174 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:06:50,175 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1031_true-unreach-call.c [2018-11-23 07:06:50,228 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/data/16fa84379/0c487de419954f6d8811fa7cb5652fda/FLAG4027854f6 [2018-11-23 07:06:50,587 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:06:50,588 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/sv-benchmarks/c/float-newlib/double_req_bl_1031_true-unreach-call.c [2018-11-23 07:06:50,593 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/data/16fa84379/0c487de419954f6d8811fa7cb5652fda/FLAG4027854f6 [2018-11-23 07:06:50,603 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/data/16fa84379/0c487de419954f6d8811fa7cb5652fda [2018-11-23 07:06:50,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:06:50,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:06:50,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:06:50,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:06:50,611 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:06:50,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:06:50" (1/1) ... [2018-11-23 07:06:50,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f089c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:50, skipping insertion in model container [2018-11-23 07:06:50,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:06:50" (1/1) ... [2018-11-23 07:06:50,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:06:50,639 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:06:50,798 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:06:50,802 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:06:50,828 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:06:50,849 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:06:50,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:50 WrapperNode [2018-11-23 07:06:50,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:06:50,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:06:50,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:06:50,850 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:06:50,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:50" (1/1) ... [2018-11-23 07:06:50,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:50" (1/1) ... [2018-11-23 07:06:50,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:06:50,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:06:50,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:06:50,880 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:06:50,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:50" (1/1) ... [2018-11-23 07:06:50,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:50" (1/1) ... [2018-11-23 07:06:50,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:50" (1/1) ... [2018-11-23 07:06:50,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:50" (1/1) ... [2018-11-23 07:06:50,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:50" (1/1) ... [2018-11-23 07:06:50,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:50" (1/1) ... [2018-11-23 07:06:50,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:50" (1/1) ... [2018-11-23 07:06:50,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:06:50,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:06:50,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:06:50,965 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:06:50,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:06:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/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 07:06:51,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 07:06:51,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 07:06:51,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 07:06:51,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 07:06:51,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:06:51,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:06:51,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 07:06:51,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 07:06:51,165 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 07:06:51,738 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:06:51,738 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 07:06:51,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:06:51 BoogieIcfgContainer [2018-11-23 07:06:51,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:06:51,739 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 07:06:51,739 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 07:06:51,747 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 07:06:51,747 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:06:51" (1/1) ... [2018-11-23 07:06:51,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:06:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:06:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 18 states and 27 transitions. [2018-11-23 07:06:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2018-11-23 07:06:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 07:06:51,783 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:06:51,836 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 07:06:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:06:51,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:06:51,878 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 07:06:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:06:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 18 states and 24 transitions. [2018-11-23 07:06:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2018-11-23 07:06:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 07:06:51,886 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:06:51,886 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 07:06:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:06:51,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:06:51,993 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 07:06:52,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:06:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 20 states and 29 transitions. [2018-11-23 07:06:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2018-11-23 07:06:52,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 07:06:52,488 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:06:52,489 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 07:06:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:06:52,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:06:52,621 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 07:06:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:06:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 18 states and 23 transitions. [2018-11-23 07:06:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2018-11-23 07:06:55,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 07:06:55,833 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:06:55,834 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 07:06:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:06:55,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:06:55,864 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 07:06:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:06:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 18 states and 22 transitions. [2018-11-23 07:06:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2018-11-23 07:06:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 07:06:55,880 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:06:55,881 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 07:06:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:06:55,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:06:55,898 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 07:06:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:06:55,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 18 states and 20 transitions. [2018-11-23 07:06:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 07:06:55,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 07:06:55,902 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:06:55,903 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 07:06:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:06:55,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:06:56,003 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 07:06:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:06:56,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 10 states and 9 transitions. [2018-11-23 07:06:56,077 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 9 transitions. [2018-11-23 07:06:56,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 07:06:56,078 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 7 iterations. [2018-11-23 07:06:56,085 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 07:06:56,135 INFO L579 CodeCheckObserver]: Invariant with dag size 5 [2018-11-23 07:06:56,140 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:06:56,145 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:06:56,146 INFO L579 CodeCheckObserver]: Invariant with dag size 5 [2018-11-23 07:06:56,146 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:06:56,146 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:06:56,147 INFO L579 CodeCheckObserver]: Invariant with dag size 1 [2018-11-23 07:06:56,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 07:06:56 ImpRootNode [2018-11-23 07:06:56,150 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 07:06:56,150 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:06:56,150 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:06:56,150 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:06:56,151 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:06:51" (3/4) ... [2018-11-23 07:06:56,154 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 07:06:56,163 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-23 07:06:56,163 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 07:06:56,164 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 07:06:56,186 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-11-23 07:06:56,208 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_48ac7012-f855-45d7-864e-e1bd35223368/bin-2019/ukojak/witness.graphml [2018-11-23 07:06:56,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:06:56,209 INFO L168 Benchmark]: Toolchain (without parser) took 5603.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 950.5 MB in the beginning and 1.0 GB in the end (delta: -54.6 MB). Peak memory consumption was 101.1 MB. Max. memory is 11.5 GB. [2018-11-23 07:06:56,211 INFO L168 Benchmark]: CDTParser took 0.19 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 07:06:56,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.95 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 933.1 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:06:56,212 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.72 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:06:56,212 INFO L168 Benchmark]: Boogie Preprocessor took 84.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -210.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-23 07:06:56,212 INFO L168 Benchmark]: RCFGBuilder took 774.21 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: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2018-11-23 07:06:56,213 INFO L168 Benchmark]: CodeCheck took 4410.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.7 MB). Peak memory consumption was 93.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:06:56,213 INFO L168 Benchmark]: Witness Printer took 58.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:06:56,215 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, 26 locations, 1 error locations. SAFE Result, 4.3s OverallTime, 7 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 872 SDtfs, 308 SDslu, 272 SDs, 0 SdLazy, 858 SolverSat, 258 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 492 GetRequests, 471 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 56 ConstructedInterpolants, 7 QuantifiedInterpolants, 2707 SizeOfPredicates, 26 NumberOfNonLiveVariables, 208 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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: 79]: 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: 17]: Loop Invariant [2018-11-23 07:06:56,217 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:06:56,217 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 20]: Loop Invariant [2018-11-23 07:06:56,217 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 07:06:56,218 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 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 241.95 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 933.1 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.72 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -210.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 774.21 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: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * CodeCheck took 4410.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.7 MB). Peak memory consumption was 93.7 MB. Max. memory is 11.5 GB. * Witness Printer took 58.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB 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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! Received shutdown request...