./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_0730b_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_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_0730b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/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 9c71a459772bdb184fdc6408fbdfc05dbcf613bc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_0730b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/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 9c71a459772bdb184fdc6408fbdfc05dbcf613bc ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 00:31:06,869 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:31:06,870 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:31:06,876 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:31:06,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:31:06,877 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:31:06,878 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:31:06,879 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:31:06,880 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:31:06,880 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:31:06,881 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:31:06,881 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:31:06,882 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:31:06,882 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:31:06,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:31:06,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:31:06,884 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:31:06,886 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:31:06,887 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:31:06,888 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:31:06,889 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:31:06,889 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:31:06,891 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:31:06,891 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:31:06,891 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:31:06,892 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:31:06,892 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:31:06,893 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:31:06,894 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:31:06,894 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:31:06,894 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:31:06,895 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:31:06,895 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:31:06,895 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:31:06,896 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:31:06,896 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:31:06,897 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 00:31:06,907 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:31:06,907 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:31:06,908 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:31:06,908 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 00:31:06,908 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:31:06,908 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:31:06,909 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:31:06,909 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:31:06,909 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:31:06,909 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:31:06,909 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:31:06,909 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:31:06,909 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:31:06,910 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:31:06,910 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:31:06,910 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:31:06,910 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:31:06,910 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:31:06,910 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 00:31:06,910 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 00:31:06,911 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:31:06,911 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:31:06,911 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 00:31:06,911 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:31:06,911 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:31:06,911 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:31:06,912 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 00:31:06,912 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:31:06,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:31:06,912 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_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/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 -> 9c71a459772bdb184fdc6408fbdfc05dbcf613bc [2018-11-23 00:31:06,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:31:06,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:31:06,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:31:06,948 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:31:06,949 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:31:06,949 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/float_req_bl_0730b_true-unreach-call.c [2018-11-23 00:31:06,984 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/data/0dbb63ca2/f1753832537b45fba7a5c88319586804/FLAG2e362a617 [2018-11-23 00:31:07,299 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:31:07,300 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/sv-benchmarks/c/float-newlib/float_req_bl_0730b_true-unreach-call.c [2018-11-23 00:31:07,304 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/data/0dbb63ca2/f1753832537b45fba7a5c88319586804/FLAG2e362a617 [2018-11-23 00:31:07,312 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/data/0dbb63ca2/f1753832537b45fba7a5c88319586804 [2018-11-23 00:31:07,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:31:07,316 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:31:07,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:31:07,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:31:07,319 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:31:07,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:31:07" (1/1) ... [2018-11-23 00:31:07,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b02929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:07, skipping insertion in model container [2018-11-23 00:31:07,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:31:07" (1/1) ... [2018-11-23 00:31:07,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:31:07,339 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:31:07,452 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:31:07,453 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:31:07,472 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:31:07,484 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:31:07,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:07 WrapperNode [2018-11-23 00:31:07,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:31:07,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:31:07,485 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:31:07,485 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:31:07,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:07" (1/1) ... [2018-11-23 00:31:07,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:07" (1/1) ... [2018-11-23 00:31:07,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:31:07,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:31:07,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:31:07,551 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:31:07,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:07" (1/1) ... [2018-11-23 00:31:07,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:07" (1/1) ... [2018-11-23 00:31:07,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:07" (1/1) ... [2018-11-23 00:31:07,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:07" (1/1) ... [2018-11-23 00:31:07,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:07" (1/1) ... [2018-11-23 00:31:07,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:07" (1/1) ... [2018-11-23 00:31:07,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:07" (1/1) ... [2018-11-23 00:31:07,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:31:07,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:31:07,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:31:07,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:31:07,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/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 00:31:07,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 00:31:07,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:31:07,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 00:31:07,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:31:07,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:31:07,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:31:07,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:31:07,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:31:07,937 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:31:07,938 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-11-23 00:31:07,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:31:07 BoogieIcfgContainer [2018-11-23 00:31:07,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:31:07,939 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 00:31:07,939 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 00:31:07,947 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 00:31:07,947 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:31:07" (1/1) ... [2018-11-23 00:31:07,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 24 states and 37 transitions. [2018-11-23 00:31:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-11-23 00:31:07,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 00:31:07,988 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:08,050 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 00:31:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 24 states and 34 transitions. [2018-11-23 00:31:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-11-23 00:31:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 00:31:08,058 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:08,134 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];~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30;havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~res~0;main_~x~0 := 0.0;__ieee754_sqrtf_#in~x := main_~x~0;havoc __ieee754_sqrtf_#res;havoc __ieee754_sqrtf_#t~mem0, __ieee754_sqrtf_#t~union1, __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, __ieee754_sqrtf_#t~post2, __ieee754_sqrtf_#t~mem3, __ieee754_sqrtf_#t~union4, __ieee754_sqrtf_~#sf_u~0.base, __ieee754_sqrtf_~#sf_u~0.offset, __ieee754_sqrtf_~x, __ieee754_sqrtf_~z~0, __ieee754_sqrtf_~r~0, __ieee754_sqrtf_~hx~0, __ieee754_sqrtf_~ix~0, __ieee754_sqrtf_~s~0, __ieee754_sqrtf_~q~0, __ieee754_sqrtf_~m~0, __ieee754_sqrtf_~t~0, __ieee754_sqrtf_~i~0;__ieee754_sqrtf_~x := __ieee754_sqrtf_#in~x;havoc __ieee754_sqrtf_~z~0;havoc __ieee754_sqrtf_~r~0;havoc __ieee754_sqrtf_~hx~0;havoc __ieee754_sqrtf_~ix~0;havoc __ieee754_sqrtf_~s~0;havoc __ieee754_sqrtf_~q~0;havoc __ieee754_sqrtf_~m~0;havoc __ieee754_sqrtf_~t~0;havoc __ieee754_sqrtf_~i~0; VAL [ULTIMATE.start___ieee754_sqrtf_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrtf_#in~x|=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] call __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset := #Ultimate.alloc(4);call write~real(__ieee754_sqrtf_~x, __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, 4);call __ieee754_sqrtf_#t~mem0 := read~int(__ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, 4);__ieee754_sqrtf_~ix~0 := (if __ieee754_sqrtf_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrtf_#t~mem0 % 4294967296 % 4294967296 else __ieee754_sqrtf_#t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(__ieee754_sqrtf_#t~union1, __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, 4);havoc __ieee754_sqrtf_#t~union1;havoc __ieee754_sqrtf_#t~mem0;call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset);havoc __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset; VAL [ULTIMATE.start___ieee754_sqrtf_~ix~0=9725, ULTIMATE.start___ieee754_sqrtf_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrtf_#in~x|=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] goto; VAL [ULTIMATE.start___ieee754_sqrtf_~ix~0=9725, ULTIMATE.start___ieee754_sqrtf_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrtf_#in~x|=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] __ieee754_sqrtf_~hx~0 := ~bitwiseAnd(__ieee754_sqrtf_~ix~0, 2147483647); VAL [ULTIMATE.start___ieee754_sqrtf_~ix~0=9725, ULTIMATE.start___ieee754_sqrtf_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrtf_#in~x|=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume !(__ieee754_sqrtf_~hx~0 % 4294967296 < 2139095040);__ieee754_sqrtf_#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(__ieee754_sqrtf_~x, __ieee754_sqrtf_~x), __ieee754_sqrtf_~x); VAL [ULTIMATE.start___ieee754_sqrtf_~hx~0=2139095040, ULTIMATE.start___ieee754_sqrtf_~ix~0=9725, ULTIMATE.start___ieee754_sqrtf_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrtf_#in~x|=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] main_#t~ret7 := __ieee754_sqrtf_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~someBinaryFLOATComparisonOperation(main_~res~0, 0.0); VAL [ULTIMATE.start___ieee754_sqrtf_~hx~0=2139095040, ULTIMATE.start___ieee754_sqrtf_~ix~0=9725, ULTIMATE.start___ieee754_sqrtf_~x=0.0, ULTIMATE.start_main_~res~0=5.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrtf_#in~x|=0.0, |ULTIMATE.start___ieee754_sqrtf_#res|=5.0, |ULTIMATE.start_main_#t~short9|=false, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume !main_#t~short9; VAL [ULTIMATE.start___ieee754_sqrtf_~hx~0=2139095040, ULTIMATE.start___ieee754_sqrtf_~ix~0=9725, ULTIMATE.start___ieee754_sqrtf_~x=0.0, ULTIMATE.start_main_~res~0=5.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrtf_#in~x|=0.0, |ULTIMATE.start___ieee754_sqrtf_#res|=5.0, |ULTIMATE.start_main_#t~short9|=false, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8; VAL [ULTIMATE.start___ieee754_sqrtf_~hx~0=2139095040, ULTIMATE.start___ieee754_sqrtf_~ix~0=9725, ULTIMATE.start___ieee754_sqrtf_~x=0.0, ULTIMATE.start_main_~res~0=5.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrtf_#in~x|=0.0, |ULTIMATE.start___ieee754_sqrtf_#res|=5.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] assume !false; VAL [ULTIMATE.start___ieee754_sqrtf_~hx~0=2139095040, ULTIMATE.start___ieee754_sqrtf_~ix~0=9725, ULTIMATE.start___ieee754_sqrtf_~x=0.0, ULTIMATE.start_main_~res~0=5.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___ieee754_sqrtf_#in~x|=0.0, |ULTIMATE.start___ieee754_sqrtf_#res|=5.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=(/ 1.0 1000000000000000000000000000000.0)] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; [?] havoc main_#res; [?] havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~res~0; [L101] main_~x~0 := 0.0; [L102] __ieee754_sqrtf_#in~x := main_~x~0; [L102] havoc __ieee754_sqrtf_#res; [L102] havoc __ieee754_sqrtf_#t~mem0, __ieee754_sqrtf_#t~union1, __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, __ieee754_sqrtf_#t~post2, __ieee754_sqrtf_#t~mem3, __ieee754_sqrtf_#t~union4, __ieee754_sqrtf_~#sf_u~0.base, __ieee754_sqrtf_~#sf_u~0.offset, __ieee754_sqrtf_~x, __ieee754_sqrtf_~z~0, __ieee754_sqrtf_~r~0, __ieee754_sqrtf_~hx~0, __ieee754_sqrtf_~ix~0, __ieee754_sqrtf_~s~0, __ieee754_sqrtf_~q~0, __ieee754_sqrtf_~m~0, __ieee754_sqrtf_~t~0, __ieee754_sqrtf_~i~0; [L14-L79] __ieee754_sqrtf_~x := __ieee754_sqrtf_#in~x; [L15] havoc __ieee754_sqrtf_~z~0; [L16] havoc __ieee754_sqrtf_~r~0; [L16] havoc __ieee754_sqrtf_~hx~0; [L17] havoc __ieee754_sqrtf_~ix~0; [L17] havoc __ieee754_sqrtf_~s~0; [L17] havoc __ieee754_sqrtf_~q~0; [L17] havoc __ieee754_sqrtf_~m~0; [L17] havoc __ieee754_sqrtf_~t~0; [L17] havoc __ieee754_sqrtf_~i~0; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L20] call __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset := #Ultimate.alloc(4); [L21] call write~real(__ieee754_sqrtf_~x, __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, 4); [L22] call __ieee754_sqrtf_#t~mem0 := read~int(__ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, 4); [L22] __ieee754_sqrtf_~ix~0 := (if __ieee754_sqrtf_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrtf_#t~mem0 % 4294967296 % 4294967296 else __ieee754_sqrtf_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(__ieee754_sqrtf_#t~union1, __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, 4); [L22] havoc __ieee754_sqrtf_#t~union1; [L22] havoc __ieee754_sqrtf_#t~mem0; [L20] call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset); [L20] havoc __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L24] __ieee754_sqrtf_~hx~0 := ~bitwiseAnd(__ieee754_sqrtf_~ix~0, 2147483647); VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L26-L27] assume !(__ieee754_sqrtf_~hx~0 % 4294967296 < 2139095040); [L27] __ieee754_sqrtf_#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(__ieee754_sqrtf_~x, __ieee754_sqrtf_~x), __ieee754_sqrtf_~x); VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L102] main_#t~ret7 := __ieee754_sqrtf_#res; [L102] main_~res~0 := main_#t~ret7; [L102] havoc main_#t~ret7; [L105] main_#t~short9 := ~someBinaryFLOATComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_#res=5.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_#t~short9=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L105] assume !main_#t~short9; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_#res=5.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_#t~short9=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L105-L108] assume !main_#t~short9; [L105] havoc main_#t~short9; [L105] havoc main_#t~ret8; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_#res=5.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L106] assert false; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_#res=5.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; [?] havoc main_#res; [?] havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~res~0; [L101] main_~x~0 := 0.0; [L102] __ieee754_sqrtf_#in~x := main_~x~0; [L102] havoc __ieee754_sqrtf_#res; [L102] havoc __ieee754_sqrtf_#t~mem0, __ieee754_sqrtf_#t~union1, __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, __ieee754_sqrtf_#t~post2, __ieee754_sqrtf_#t~mem3, __ieee754_sqrtf_#t~union4, __ieee754_sqrtf_~#sf_u~0.base, __ieee754_sqrtf_~#sf_u~0.offset, __ieee754_sqrtf_~x, __ieee754_sqrtf_~z~0, __ieee754_sqrtf_~r~0, __ieee754_sqrtf_~hx~0, __ieee754_sqrtf_~ix~0, __ieee754_sqrtf_~s~0, __ieee754_sqrtf_~q~0, __ieee754_sqrtf_~m~0, __ieee754_sqrtf_~t~0, __ieee754_sqrtf_~i~0; [L14-L79] __ieee754_sqrtf_~x := __ieee754_sqrtf_#in~x; [L15] havoc __ieee754_sqrtf_~z~0; [L16] havoc __ieee754_sqrtf_~r~0; [L16] havoc __ieee754_sqrtf_~hx~0; [L17] havoc __ieee754_sqrtf_~ix~0; [L17] havoc __ieee754_sqrtf_~s~0; [L17] havoc __ieee754_sqrtf_~q~0; [L17] havoc __ieee754_sqrtf_~m~0; [L17] havoc __ieee754_sqrtf_~t~0; [L17] havoc __ieee754_sqrtf_~i~0; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L20] call __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset := #Ultimate.alloc(4); [L21] call write~real(__ieee754_sqrtf_~x, __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, 4); [L22] call __ieee754_sqrtf_#t~mem0 := read~int(__ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, 4); [L22] __ieee754_sqrtf_~ix~0 := (if __ieee754_sqrtf_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrtf_#t~mem0 % 4294967296 % 4294967296 else __ieee754_sqrtf_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(__ieee754_sqrtf_#t~union1, __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset, 4); [L22] havoc __ieee754_sqrtf_#t~union1; [L22] havoc __ieee754_sqrtf_#t~mem0; [L20] call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset); [L20] havoc __ieee754_sqrtf_~#gf_u~0.base, __ieee754_sqrtf_~#gf_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L24] __ieee754_sqrtf_~hx~0 := ~bitwiseAnd(__ieee754_sqrtf_~ix~0, 2147483647); VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L26-L27] assume !(__ieee754_sqrtf_~hx~0 % 4294967296 < 2139095040); [L27] __ieee754_sqrtf_#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(__ieee754_sqrtf_~x, __ieee754_sqrtf_~x), __ieee754_sqrtf_~x); VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L102] main_#t~ret7 := __ieee754_sqrtf_#res; [L102] main_~res~0 := main_#t~ret7; [L102] havoc main_#t~ret7; [L105] main_#t~short9 := ~someBinaryFLOATComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_#res=5.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_#t~short9=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L105] assume !main_#t~short9; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_#res=5.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_#t~short9=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L105-L108] assume !main_#t~short9; [L105] havoc main_#t~short9; [L105] havoc main_#t~ret8; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_#res=5.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L106] assert false; VAL [#NULL.base=0, #NULL.offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_#res=5.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; [?] havoc main_#res; [?] havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~res~0; [L101] main_~x~0 := 0.0; [L102] __ieee754_sqrtf_#in~x := main_~x~0; [L102] havoc __ieee754_sqrtf_#res; [L102] havoc __ieee754_sqrtf_#t~mem0, __ieee754_sqrtf_#t~union1, __ieee754_sqrtf_~#gf_u~0, __ieee754_sqrtf_#t~post2, __ieee754_sqrtf_#t~mem3, __ieee754_sqrtf_#t~union4, __ieee754_sqrtf_~#sf_u~0, __ieee754_sqrtf_~x, __ieee754_sqrtf_~z~0, __ieee754_sqrtf_~r~0, __ieee754_sqrtf_~hx~0, __ieee754_sqrtf_~ix~0, __ieee754_sqrtf_~s~0, __ieee754_sqrtf_~q~0, __ieee754_sqrtf_~m~0, __ieee754_sqrtf_~t~0, __ieee754_sqrtf_~i~0; [L14-L79] __ieee754_sqrtf_~x := __ieee754_sqrtf_#in~x; [L15] havoc __ieee754_sqrtf_~z~0; [L16] havoc __ieee754_sqrtf_~r~0; [L16] havoc __ieee754_sqrtf_~hx~0; [L17] havoc __ieee754_sqrtf_~ix~0; [L17] havoc __ieee754_sqrtf_~s~0; [L17] havoc __ieee754_sqrtf_~q~0; [L17] havoc __ieee754_sqrtf_~m~0; [L17] havoc __ieee754_sqrtf_~t~0; [L17] havoc __ieee754_sqrtf_~i~0; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L20] FCALL call __ieee754_sqrtf_~#gf_u~0 := #Ultimate.alloc(4); [L21] FCALL call write~real(__ieee754_sqrtf_~x, { base: __ieee754_sqrtf_~#gf_u~0!base, offset: __ieee754_sqrtf_~#gf_u~0!offset }, 4); [L22] FCALL call __ieee754_sqrtf_#t~mem0 := read~int({ base: __ieee754_sqrtf_~#gf_u~0!base, offset: __ieee754_sqrtf_~#gf_u~0!offset }, 4); [L22] __ieee754_sqrtf_~ix~0 := (if __ieee754_sqrtf_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrtf_#t~mem0 % 4294967296 % 4294967296 else __ieee754_sqrtf_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(__ieee754_sqrtf_#t~union1, { base: __ieee754_sqrtf_~#gf_u~0!base, offset: __ieee754_sqrtf_~#gf_u~0!offset }, 4); [L22] havoc __ieee754_sqrtf_#t~union1; [L22] havoc __ieee754_sqrtf_#t~mem0; [L20] FCALL call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0); [L20] havoc __ieee754_sqrtf_~#gf_u~0; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L24] __ieee754_sqrtf_~hx~0 := ~bitwiseAnd(__ieee754_sqrtf_~ix~0, 2147483647); VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L26] COND TRUE !(__ieee754_sqrtf_~hx~0 % 4294967296 < 2139095040) [L27] __ieee754_sqrtf_#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(__ieee754_sqrtf_~x, __ieee754_sqrtf_~x), __ieee754_sqrtf_~x); VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L102] main_#t~ret7 := __ieee754_sqrtf_#res; [L102] main_~res~0 := main_#t~ret7; [L102] havoc main_#t~ret7; [L105] main_#t~short9 := ~someBinaryFLOATComparisonOperation(main_~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_#res=5.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_#t~short9=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L105] COND FALSE !(main_#t~short9) VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_#res=5.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_#t~short9=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L105] COND TRUE !main_#t~short9 [L105] havoc main_#t~short9; [L105] havoc main_#t~ret8; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_#res=5.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L106] assert false; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_#res=5.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; [?] havoc main_#res; [?] havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~res~0; [L101] main_~x~0 := 0.0; [L102] __ieee754_sqrtf_#in~x := main_~x~0; [L102] havoc __ieee754_sqrtf_#res; [L102] havoc __ieee754_sqrtf_#t~mem0, __ieee754_sqrtf_#t~union1, __ieee754_sqrtf_~#gf_u~0, __ieee754_sqrtf_#t~post2, __ieee754_sqrtf_#t~mem3, __ieee754_sqrtf_#t~union4, __ieee754_sqrtf_~#sf_u~0, __ieee754_sqrtf_~x, __ieee754_sqrtf_~z~0, __ieee754_sqrtf_~r~0, __ieee754_sqrtf_~hx~0, __ieee754_sqrtf_~ix~0, __ieee754_sqrtf_~s~0, __ieee754_sqrtf_~q~0, __ieee754_sqrtf_~m~0, __ieee754_sqrtf_~t~0, __ieee754_sqrtf_~i~0; [L14-L79] __ieee754_sqrtf_~x := __ieee754_sqrtf_#in~x; [L15] havoc __ieee754_sqrtf_~z~0; [L16] havoc __ieee754_sqrtf_~r~0; [L16] havoc __ieee754_sqrtf_~hx~0; [L17] havoc __ieee754_sqrtf_~ix~0; [L17] havoc __ieee754_sqrtf_~s~0; [L17] havoc __ieee754_sqrtf_~q~0; [L17] havoc __ieee754_sqrtf_~m~0; [L17] havoc __ieee754_sqrtf_~t~0; [L17] havoc __ieee754_sqrtf_~i~0; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L20] FCALL call __ieee754_sqrtf_~#gf_u~0 := #Ultimate.alloc(4); [L21] FCALL call write~real(__ieee754_sqrtf_~x, { base: __ieee754_sqrtf_~#gf_u~0!base, offset: __ieee754_sqrtf_~#gf_u~0!offset }, 4); [L22] FCALL call __ieee754_sqrtf_#t~mem0 := read~int({ base: __ieee754_sqrtf_~#gf_u~0!base, offset: __ieee754_sqrtf_~#gf_u~0!offset }, 4); [L22] __ieee754_sqrtf_~ix~0 := (if __ieee754_sqrtf_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrtf_#t~mem0 % 4294967296 % 4294967296 else __ieee754_sqrtf_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(__ieee754_sqrtf_#t~union1, { base: __ieee754_sqrtf_~#gf_u~0!base, offset: __ieee754_sqrtf_~#gf_u~0!offset }, 4); [L22] havoc __ieee754_sqrtf_#t~union1; [L22] havoc __ieee754_sqrtf_#t~mem0; [L20] FCALL call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0); [L20] havoc __ieee754_sqrtf_~#gf_u~0; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L24] __ieee754_sqrtf_~hx~0 := ~bitwiseAnd(__ieee754_sqrtf_~ix~0, 2147483647); VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L26] COND TRUE !(__ieee754_sqrtf_~hx~0 % 4294967296 < 2139095040) [L27] __ieee754_sqrtf_#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(__ieee754_sqrtf_~x, __ieee754_sqrtf_~x), __ieee754_sqrtf_~x); VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L102] main_#t~ret7 := __ieee754_sqrtf_#res; [L102] main_~res~0 := main_#t~ret7; [L102] havoc main_#t~ret7; [L105] main_#t~short9 := ~someBinaryFLOATComparisonOperation(main_~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_#res=5.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_#t~short9=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L105] COND FALSE !(main_#t~short9) VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_#res=5.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_#t~short9=false, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L105] COND TRUE !main_#t~short9 [L105] havoc main_#t~short9; [L105] havoc main_#t~ret8; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_#res=5.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L106] assert false; VAL [#NULL!base=0, #NULL!offset=0, __ieee754_sqrtf_#in~x=0.0, __ieee754_sqrtf_#res=5.0, __ieee754_sqrtf_~hx~0=2139095040, __ieee754_sqrtf_~ix~0=9725, __ieee754_sqrtf_~x=0.0, main_~res~0=5.0, main_~x~0=0.0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; [L101] ~x~0 := 0.0; [L14-L79] ~x := #in~x; [L15] havoc ~z~0; [L16] havoc ~r~0; [L16] havoc ~hx~0; [L17] havoc ~ix~0; [L17] havoc ~s~0; [L17] havoc ~q~0; [L17] havoc ~m~0; [L17] havoc ~t~0; [L17] havoc ~i~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L20] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L21] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L22] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L22] ~ix~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L20] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L20] havoc ~#gf_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L24] ~hx~0 := ~bitwiseAnd(~ix~0, 2147483647); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L26] COND TRUE !(~hx~0 % 4294967296 < 2139095040) [L27] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L102] ~res~0 := #t~ret7; [L102] havoc #t~ret7; [L105] #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L105] COND FALSE !(#t~short9) VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L105] COND TRUE !#t~short9 [L105] havoc #t~short9; [L105] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L106] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] ~one_sqrt~0 := 1.0; [L12] ~tiny_sqrt~0 := 1.0E-30; [L101] ~x~0 := 0.0; [L14-L79] ~x := #in~x; [L15] havoc ~z~0; [L16] havoc ~r~0; [L16] havoc ~hx~0; [L17] havoc ~ix~0; [L17] havoc ~s~0; [L17] havoc ~q~0; [L17] havoc ~m~0; [L17] havoc ~t~0; [L17] havoc ~i~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L20] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L21] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L22] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L22] ~ix~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L20] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L20] havoc ~#gf_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L24] ~hx~0 := ~bitwiseAnd(~ix~0, 2147483647); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L26] COND TRUE !(~hx~0 % 4294967296 < 2139095040) [L27] #res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L102] ~res~0 := #t~ret7; [L102] havoc #t~ret7; [L105] #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L105] COND FALSE !(#t~short9) VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L105] COND TRUE !#t~short9 [L105] havoc #t~short9; [L105] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L106] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~one_sqrt~0=1.0, ~tiny_sqrt~0=1/1000000000000000000000000000000] [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; [L101] float x = 0.0f; [L15] float z; [L16] __uint32_t r, hx; [L17] __int32_t ix, s, q, m, t, i; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L20] ieee_float_shape_type gf_u; [L21] gf_u.value = (x) [L22] EXPR gf_u.word [L22] (ix) = gf_u.word [L24] hx = ix & 0x7fffffff VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L26] COND TRUE !((hx) < 0x7f800000L) [L27] return x * x + x; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L102] float res = __ieee754_sqrtf(x); [L105] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L105] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L106] __VERIFIER_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] ----- [2018-11-23 00:31:08,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 12:31:08 ImpRootNode [2018-11-23 00:31:08,172 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 00:31:08,173 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:31:08,173 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:31:08,173 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:31:08,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:31:07" (3/4) ... [2018-11-23 00:31:08,176 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 00:31:08,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:31:08,177 INFO L168 Benchmark]: Toolchain (without parser) took 861.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -96.9 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:08,178 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:31:08,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.80 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 946.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:08,179 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 946.6 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:08,180 INFO L168 Benchmark]: Boogie Preprocessor took 23.20 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:08,180 INFO L168 Benchmark]: RCFGBuilder took 364.51 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: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:08,181 INFO L168 Benchmark]: CodeCheck took 233.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:08,181 INFO L168 Benchmark]: Witness Printer took 3.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:08,184 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, 37 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 57 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: 106]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of bitwiseAnd at line 24, overapproximation of someBinaryArithmeticFLOAToperation at line 27. Possible FailurePath: [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; [L101] float x = 0.0f; [L15] float z; [L16] __uint32_t r, hx; [L17] __int32_t ix, s, q, m, t, i; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L20] ieee_float_shape_type gf_u; [L21] gf_u.value = (x) [L22] EXPR gf_u.word [L22] (ix) = gf_u.word [L24] hx = ix & 0x7fffffff VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L26] COND TRUE !((hx) < 0x7f800000L) [L27] return x * x + x; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L102] float res = __ieee754_sqrtf(x); [L105] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L105] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L106] __VERIFIER_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 167.80 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 946.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 946.6 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.20 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 364.51 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: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. * CodeCheck took 233.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 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 00:31:09,603 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:31:09,604 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:31:09,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:31:09,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:31:09,612 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:31:09,613 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:31:09,614 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:31:09,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:31:09,615 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:31:09,616 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:31:09,616 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:31:09,617 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:31:09,617 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:31:09,618 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:31:09,619 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:31:09,619 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:31:09,620 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:31:09,622 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:31:09,623 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:31:09,623 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:31:09,624 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:31:09,626 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:31:09,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:31:09,626 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:31:09,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:31:09,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:31:09,628 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:31:09,628 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:31:09,629 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:31:09,629 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:31:09,630 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:31:09,630 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:31:09,630 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:31:09,631 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:31:09,631 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:31:09,631 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 00:31:09,642 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:31:09,642 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:31:09,642 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:31:09,643 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 00:31:09,643 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:31:09,643 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:31:09,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:31:09,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:31:09,644 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:31:09,644 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:31:09,644 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:31:09,644 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:31:09,644 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:31:09,644 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 00:31:09,644 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 00:31:09,645 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:31:09,645 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:31:09,645 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:31:09,645 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:31:09,645 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 00:31:09,645 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 00:31:09,645 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:31:09,645 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:31:09,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 00:31:09,646 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:31:09,646 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:31:09,646 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:31:09,646 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 00:31:09,646 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 00:31:09,647 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:31:09,647 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 00:31:09,647 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 00:31:09,647 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_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/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 -> 9c71a459772bdb184fdc6408fbdfc05dbcf613bc [2018-11-23 00:31:09,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:31:09,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:31:09,686 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:31:09,687 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:31:09,688 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:31:09,688 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/float_req_bl_0730b_true-unreach-call.c [2018-11-23 00:31:09,733 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/data/a9687d72a/fe422348856a489da2800d57af6da250/FLAG404c31e93 [2018-11-23 00:31:10,058 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:31:10,059 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/sv-benchmarks/c/float-newlib/float_req_bl_0730b_true-unreach-call.c [2018-11-23 00:31:10,064 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/data/a9687d72a/fe422348856a489da2800d57af6da250/FLAG404c31e93 [2018-11-23 00:31:10,072 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/data/a9687d72a/fe422348856a489da2800d57af6da250 [2018-11-23 00:31:10,074 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:31:10,075 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:31:10,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:31:10,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:31:10,079 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:31:10,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:31:10" (1/1) ... [2018-11-23 00:31:10,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d0518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:10, skipping insertion in model container [2018-11-23 00:31:10,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:31:10" (1/1) ... [2018-11-23 00:31:10,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:31:10,104 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:31:10,243 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:31:10,247 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:31:10,268 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:31:10,285 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:31:10,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:10 WrapperNode [2018-11-23 00:31:10,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:31:10,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:31:10,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:31:10,286 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:31:10,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:10" (1/1) ... [2018-11-23 00:31:10,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:10" (1/1) ... [2018-11-23 00:31:10,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:31:10,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:31:10,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:31:10,311 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:31:10,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:10" (1/1) ... [2018-11-23 00:31:10,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:10" (1/1) ... [2018-11-23 00:31:10,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:10" (1/1) ... [2018-11-23 00:31:10,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:10" (1/1) ... [2018-11-23 00:31:10,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:10" (1/1) ... [2018-11-23 00:31:10,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:10" (1/1) ... [2018-11-23 00:31:10,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:10" (1/1) ... [2018-11-23 00:31:10,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:31:10,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:31:10,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:31:10,387 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:31:10,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/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 00:31:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-23 00:31:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:31:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 00:31:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:31:10,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:31:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 00:31:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 00:31:10,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:31:10,976 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:31:11,864 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:31:11,864 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-11-23 00:31:11,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:31:11 BoogieIcfgContainer [2018-11-23 00:31:11,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:31:11,865 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 00:31:11,865 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 00:31:11,871 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 00:31:11,871 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:31:11" (1/1) ... [2018-11-23 00:31:11,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 24 states and 37 transitions. [2018-11-23 00:31:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-11-23 00:31:11,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 00:31:11,901 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:11,933 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:11,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:11,955 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 00:31:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 24 states and 34 transitions. [2018-11-23 00:31:11,963 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-11-23 00:31:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 00:31:11,964 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:11,965 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:12,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:12,046 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 00:31:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 24 states and 33 transitions. [2018-11-23 00:31:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2018-11-23 00:31:12,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 00:31:12,452 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:12,453 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:12,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:12,512 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 00:31:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 26 states and 36 transitions. [2018-11-23 00:31:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2018-11-23 00:31:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 00:31:14,607 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:14,607 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:14,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:14,714 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 00:31:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 26 states and 35 transitions. [2018-11-23 00:31:15,390 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2018-11-23 00:31:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 00:31:15,391 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:15,391 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:15,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:15,403 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 00:31:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 26 states and 33 transitions. [2018-11-23 00:31:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2018-11-23 00:31:15,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 00:31:15,408 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:15,409 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:15,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:15,544 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 00:31:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:15,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 31 states and 38 transitions. [2018-11-23 00:31:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-11-23 00:31:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 00:31:15,807 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:15,808 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:15,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:15,837 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 00:31:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 31 states and 36 transitions. [2018-11-23 00:31:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 00:31:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 00:31:15,841 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:15,842 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:15,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:15,899 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 00:31:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 32 states and 38 transitions. [2018-11-23 00:31:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 00:31:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 00:31:15,977 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:15,977 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:15,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:16,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 33 states and 40 transitions. [2018-11-23 00:31:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 00:31:16,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 00:31:16,185 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:16,186 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:16,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 34 states and 42 transitions. [2018-11-23 00:31:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2018-11-23 00:31:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 00:31:16,400 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:16,400 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:16,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:16,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 35 states and 44 transitions. [2018-11-23 00:31:16,638 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2018-11-23 00:31:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 00:31:16,638 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:16,639 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:16,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 36 states and 46 transitions. [2018-11-23 00:31:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2018-11-23 00:31:16,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 00:31:16,901 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:16,902 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:16,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:17,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 37 states and 48 transitions. [2018-11-23 00:31:17,172 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-11-23 00:31:17,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 00:31:17,172 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:17,173 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:17,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 38 states and 50 transitions. [2018-11-23 00:31:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2018-11-23 00:31:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 00:31:17,474 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:17,475 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:17,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 39 states and 52 transitions. [2018-11-23 00:31:17,796 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2018-11-23 00:31:17,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 00:31:17,796 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:17,797 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:17,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 40 states and 54 transitions. [2018-11-23 00:31:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2018-11-23 00:31:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 00:31:18,129 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:18,130 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:18,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 41 states and 56 transitions. [2018-11-23 00:31:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2018-11-23 00:31:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 00:31:18,482 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:18,483 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:18,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 42 states and 58 transitions. [2018-11-23 00:31:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2018-11-23 00:31:18,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 00:31:18,889 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:18,889 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:18,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 43 states and 60 transitions. [2018-11-23 00:31:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2018-11-23 00:31:19,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 00:31:19,369 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:19,369 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:19,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 44 states and 62 transitions. [2018-11-23 00:31:19,756 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2018-11-23 00:31:19,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 00:31:19,756 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:19,757 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:19,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 45 states and 64 transitions. [2018-11-23 00:31:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2018-11-23 00:31:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 00:31:20,191 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:20,191 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:20,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:20,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 46 states and 66 transitions. [2018-11-23 00:31:20,671 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2018-11-23 00:31:20,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 00:31:20,672 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:20,672 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:20,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 47 states and 68 transitions. [2018-11-23 00:31:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2018-11-23 00:31:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 00:31:21,164 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:21,164 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:21,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 48 states and 70 transitions. [2018-11-23 00:31:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2018-11-23 00:31:21,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 00:31:21,700 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:21,700 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:21,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 49 states and 72 transitions. [2018-11-23 00:31:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2018-11-23 00:31:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 00:31:22,286 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:22,287 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:22,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:22,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:22,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 50 states and 74 transitions. [2018-11-23 00:31:22,837 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2018-11-23 00:31:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 00:31:22,837 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:22,838 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:22,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 51 states and 76 transitions. [2018-11-23 00:31:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2018-11-23 00:31:23,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 00:31:23,413 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:23,414 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:23,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 52 states and 78 transitions. [2018-11-23 00:31:24,030 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 78 transitions. [2018-11-23 00:31:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 00:31:24,030 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:24,031 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:24,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 53 states and 80 transitions. [2018-11-23 00:31:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2018-11-23 00:31:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 00:31:24,723 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:24,724 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:24,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 54 states and 82 transitions. [2018-11-23 00:31:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2018-11-23 00:31:25,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 00:31:25,493 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:25,494 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:25,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 55 states and 84 transitions. [2018-11-23 00:31:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 84 transitions. [2018-11-23 00:31:26,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 00:31:26,318 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:26,319 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:26,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 56 states and 86 transitions. [2018-11-23 00:31:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2018-11-23 00:31:27,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 00:31:27,052 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 00:31:27,052 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 00:31:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:27,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:27,141 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-23 00:31:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 00:31:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 14 states and 13 transitions. [2018-11-23 00:31:27,565 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-23 00:31:27,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 00:31:27,566 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 34 iterations. [2018-11-23 00:31:27,572 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 00:31:27,605 INFO L579 CodeCheckObserver]: Invariant with dag size 3 [2018-11-23 00:31:27,610 INFO L579 CodeCheckObserver]: Invariant with dag size 7 [2018-11-23 00:31:27,611 INFO L579 CodeCheckObserver]: Invariant with dag size 3 [2018-11-23 00:31:27,611 INFO L579 CodeCheckObserver]: Invariant with dag size 3 [2018-11-23 00:31:27,611 INFO L579 CodeCheckObserver]: Invariant with dag size 1 [2018-11-23 00:31:27,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 12:31:27 ImpRootNode [2018-11-23 00:31:27,611 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 00:31:27,612 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:31:27,612 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:31:27,612 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:31:27,612 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:31:11" (3/4) ... [2018-11-23 00:31:27,614 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 00:31:27,619 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-11-23 00:31:27,620 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 00:31:27,637 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ~Pluszero~LONGDOUBLE() == \result [2018-11-23 00:31:27,658 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b2d3d760-4b09-42e5-abfe-1c8d95f242f3/bin-2019/ukojak/witness.graphml [2018-11-23 00:31:27,658 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:31:27,659 INFO L168 Benchmark]: Toolchain (without parser) took 17584.36 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.8 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 150.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:27,660 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:31:27,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.78 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:27,660 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.37 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:31:27,660 INFO L168 Benchmark]: Boogie Preprocessor took 75.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -203.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:27,660 INFO L168 Benchmark]: RCFGBuilder took 1477.52 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:27,660 INFO L168 Benchmark]: CodeCheck took 15746.69 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -43.4 MB). Peak memory consumption was 136.9 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:27,661 INFO L168 Benchmark]: Witness Printer took 46.26 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:31:27,661 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, 37 locations, 1 error locations. SAFE Result, 15.6s OverallTime, 34 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 536870912 SDtfs, 805306372 SDslu, 536870912 SDs, 0 SdLazy, 268435340 SolverSat, -268435568 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 89.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7428 GetRequests, 7293 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3901 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 846 NumberOfCodeBlocks, 846 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 813 ConstructedInterpolants, 3 QuantifiedInterpolants, 60767 SizeOfPredicates, 54 NumberOfNonLiveVariables, 3034 ConjunctsInSsa, 390 ConjunctsInUnsatCore, 33 InterpolantComputations, 9 PerfectInterpolantSequences, 325/2925 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: 106]: 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: 19]: Loop Invariant Derived loop invariant: ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ~Pluszero~LONGDOUBLE() == \result - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 209.78 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.37 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -203.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1477.52 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * CodeCheck took 15746.69 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -43.4 MB). Peak memory consumption was 136.9 MB. Max. memory is 11.5 GB. * Witness Printer took 46.26 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be correct! Received shutdown request...