./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1011b_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_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1011b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/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 dbef25694faa90ff4d63502c2f243449da0e6c28 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1011b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/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 dbef25694faa90ff4d63502c2f243449da0e6c28 ................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:06:22,221 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:06:22,222 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:06:22,231 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:06:22,231 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:06:22,232 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:06:22,233 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:06:22,235 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:06:22,236 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:06:22,237 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:06:22,238 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:06:22,238 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:06:22,239 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:06:22,240 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:06:22,241 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:06:22,241 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:06:22,242 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:06:22,243 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:06:22,245 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:06:22,246 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:06:22,247 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:06:22,248 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:06:22,250 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:06:22,251 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:06:22,251 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:06:22,251 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:06:22,252 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:06:22,253 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:06:22,254 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:06:22,254 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:06:22,255 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:06:22,255 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:06:22,255 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:06:22,255 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:06:22,256 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:06:22,257 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:06:22,257 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 06:06:22,269 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:06:22,269 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:06:22,270 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:06:22,270 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 06:06:22,270 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:06:22,271 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:06:22,271 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:06:22,271 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:06:22,271 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:06:22,271 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:06:22,272 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:06:22,272 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:06:22,272 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:06:22,272 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:06:22,272 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:06:22,272 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:06:22,273 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:06:22,273 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:06:22,273 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 06:06:22,273 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 06:06:22,273 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:06:22,273 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:06:22,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 06:06:22,274 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:06:22,274 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:06:22,274 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:06:22,274 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 06:06:22,275 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:06:22,275 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:06:22,275 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_7fc8b988-fd03-421b-b041-3d138cbed85d/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 -> dbef25694faa90ff4d63502c2f243449da0e6c28 [2018-11-23 06:06:22,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:06:22,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:06:22,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:06:22,319 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:06:22,319 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:06:22,320 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1011b_true-unreach-call.c [2018-11-23 06:06:22,374 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/data/bc51ca6f6/42ccd7c00eac43c7a7304700019ad448/FLAG47b308809 [2018-11-23 06:06:22,765 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:06:22,766 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/sv-benchmarks/c/float-newlib/double_req_bl_1011b_true-unreach-call.c [2018-11-23 06:06:22,770 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/data/bc51ca6f6/42ccd7c00eac43c7a7304700019ad448/FLAG47b308809 [2018-11-23 06:06:22,781 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/data/bc51ca6f6/42ccd7c00eac43c7a7304700019ad448 [2018-11-23 06:06:22,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:06:22,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:06:22,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:06:22,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:06:22,789 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:06:22,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:06:22" (1/1) ... [2018-11-23 06:06:22,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ac0340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:22, skipping insertion in model container [2018-11-23 06:06:22,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:06:22" (1/1) ... [2018-11-23 06:06:22,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:06:22,822 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:06:22,971 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:06:22,973 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:06:22,991 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:06:23,007 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:06:23,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:23 WrapperNode [2018-11-23 06:06:23,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:06:23,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:06:23,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:06:23,008 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:06:23,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:23" (1/1) ... [2018-11-23 06:06:23,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:23" (1/1) ... [2018-11-23 06:06:23,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:06:23,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:06:23,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:06:23,035 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:06:23,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:23" (1/1) ... [2018-11-23 06:06:23,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:23" (1/1) ... [2018-11-23 06:06:23,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:23" (1/1) ... [2018-11-23 06:06:23,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:23" (1/1) ... [2018-11-23 06:06:23,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:23" (1/1) ... [2018-11-23 06:06:23,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:23" (1/1) ... [2018-11-23 06:06:23,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:23" (1/1) ... [2018-11-23 06:06:23,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:06:23,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:06:23,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:06:23,103 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:06:23,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/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 06:06:23,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 06:06:23,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:06:23,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 06:06:23,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:06:23,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:06:23,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:06:23,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:06:23,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:06:23,343 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:06:23,343 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 06:06:23,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:06:23 BoogieIcfgContainer [2018-11-23 06:06:23,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:06:23,344 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 06:06:23,344 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 06:06:23,355 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 06:06:23,355 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:06:23" (1/1) ... [2018-11-23 06:06:23,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:06:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:06:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 15 states and 22 transitions. [2018-11-23 06:06:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2018-11-23 06:06:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 06:06:23,398 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:06:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:06:23,484 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 06:06:23,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:06:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 15 states and 17 transitions. [2018-11-23 06:06:23,491 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 06:06:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 06:06:23,491 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:06:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:06:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:06:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:06:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:06:23,593 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := ~someUnaryDOUBLEoperation(0.0);fabs_double_#in~x := main_~x~0;havoc fabs_double_#res;havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, fabs_double_#t~mem4, fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, fabs_double_~x, fabs_double_~high~0;fabs_double_~x := fabs_double_#in~x;havoc fabs_double_~high~0; VAL [ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0] [?] call fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset := #Ultimate.alloc(8);call write~real(fabs_double_~x, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8);call fabs_double_#t~mem2 := read~int(fabs_double_~#gh_u~1.base, 4 + fabs_double_~#gh_u~1.offset, 4);fabs_double_~high~0 := fabs_double_#t~mem2;call write~real(fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8);havoc fabs_double_#t~mem2;havoc fabs_double_#t~union3;call ULTIMATE.dealloc(fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset);havoc fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset; VAL [ULTIMATE.start_fabs_double_~high~0=14, ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0] [?] goto; VAL [ULTIMATE.start_fabs_double_~high~0=14, ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0] [?] call fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset := #Ultimate.alloc(8);call write~real(fabs_double_~x, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8);call write~int(~bitwiseAnd(fabs_double_~high~0, 2147483647), fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4);call fabs_double_#t~mem4 := read~real(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8);fabs_double_~x := fabs_double_#t~mem4;call write~int(fabs_double_#t~union5.lsw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 4);call write~int(fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4);havoc fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw;havoc fabs_double_#t~mem4;call ULTIMATE.dealloc(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset);havoc fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset; VAL [ULTIMATE.start_fabs_double_~high~0=14, ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0] [?] goto; VAL [ULTIMATE.start_fabs_double_~high~0=14, ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0] [?] fabs_double_#res := fabs_double_~x;main_#t~ret6 := fabs_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;main_#t~short8 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [ULTIMATE.start_fabs_double_~high~0=14, ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0, |ULTIMATE.start_fabs_double_#res|=0.0, |ULTIMATE.start_main_#t~short8|=false] [?] assume !main_#t~short8; VAL [ULTIMATE.start_fabs_double_~high~0=14, ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0, |ULTIMATE.start_fabs_double_#res|=0.0, |ULTIMATE.start_main_#t~short8|=false] [?] assume !main_#t~short8;havoc main_#t~short8;havoc main_#t~ret7; VAL [ULTIMATE.start_fabs_double_~high~0=14, ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0, |ULTIMATE.start_fabs_double_#res|=0.0] [?] assume !false; VAL [ULTIMATE.start_fabs_double_~high~0=14, ULTIMATE.start_fabs_double_~x=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=0.0, |ULTIMATE.start_fabs_double_#res|=0.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0; [L47] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L48] fabs_double_#in~x := main_~x~0; [L48] havoc fabs_double_#res; [L48] havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, fabs_double_#t~mem4, fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, fabs_double_~x, fabs_double_~high~0; [L25-L39] fabs_double_~x := fabs_double_#in~x; [L26] havoc fabs_double_~high~0; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_~x=0.0, main_~x~0=0.0] [L28] call fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset := #Ultimate.alloc(8); [L29] call write~real(fabs_double_~x, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8); [L30] call fabs_double_#t~mem2 := read~int(fabs_double_~#gh_u~1.base, 4 + fabs_double_~#gh_u~1.offset, 4); [L30] fabs_double_~high~0 := fabs_double_#t~mem2; [L30] call write~real(fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8); [L30] havoc fabs_double_#t~mem2; [L30] havoc fabs_double_#t~union3; [L28] call ULTIMATE.dealloc(fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset); [L28] havoc fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~x~0=0.0] [L33] call fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset := #Ultimate.alloc(8); [L34] call write~real(fabs_double_~x, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8); [L35] call write~int(~bitwiseAnd(fabs_double_~high~0, 2147483647), fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4); [L36] call fabs_double_#t~mem4 := read~real(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8); [L36] fabs_double_~x := fabs_double_#t~mem4; [L36] call write~int(fabs_double_#t~union5.lsw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 4); [L36] call write~int(fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4); [L36] havoc fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw; [L36] havoc fabs_double_#t~mem4; [L33] call ULTIMATE.dealloc(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset); [L33] havoc fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~x~0=0.0] [L38] fabs_double_#res := fabs_double_~x; [L48] main_#t~ret6 := fabs_double_#res; [L48] main_~res~0 := main_#t~ret6; [L48] havoc main_#t~ret6; [L51] main_#t~short8 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_#t~short8=false, main_~res~0=0.0, main_~x~0=0.0] [L51] assume !main_#t~short8; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_#t~short8=false, main_~res~0=0.0, main_~x~0=0.0] [L51-L54] assume !main_#t~short8; [L51] havoc main_#t~short8; [L51] havoc main_#t~ret7; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0] [L52] assert false; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0; [L47] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L48] fabs_double_#in~x := main_~x~0; [L48] havoc fabs_double_#res; [L48] havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, fabs_double_#t~mem4, fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, fabs_double_~x, fabs_double_~high~0; [L25-L39] fabs_double_~x := fabs_double_#in~x; [L26] havoc fabs_double_~high~0; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_~x=0.0, main_~x~0=0.0] [L28] call fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset := #Ultimate.alloc(8); [L29] call write~real(fabs_double_~x, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8); [L30] call fabs_double_#t~mem2 := read~int(fabs_double_~#gh_u~1.base, 4 + fabs_double_~#gh_u~1.offset, 4); [L30] fabs_double_~high~0 := fabs_double_#t~mem2; [L30] call write~real(fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8); [L30] havoc fabs_double_#t~mem2; [L30] havoc fabs_double_#t~union3; [L28] call ULTIMATE.dealloc(fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset); [L28] havoc fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~x~0=0.0] [L33] call fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset := #Ultimate.alloc(8); [L34] call write~real(fabs_double_~x, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8); [L35] call write~int(~bitwiseAnd(fabs_double_~high~0, 2147483647), fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4); [L36] call fabs_double_#t~mem4 := read~real(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8); [L36] fabs_double_~x := fabs_double_#t~mem4; [L36] call write~int(fabs_double_#t~union5.lsw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 4); [L36] call write~int(fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4); [L36] havoc fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw; [L36] havoc fabs_double_#t~mem4; [L33] call ULTIMATE.dealloc(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset); [L33] havoc fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~x~0=0.0] [L38] fabs_double_#res := fabs_double_~x; [L48] main_#t~ret6 := fabs_double_#res; [L48] main_~res~0 := main_#t~ret6; [L48] havoc main_#t~ret6; [L51] main_#t~short8 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_#t~short8=false, main_~res~0=0.0, main_~x~0=0.0] [L51] assume !main_#t~short8; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_#t~short8=false, main_~res~0=0.0, main_~x~0=0.0] [L51-L54] assume !main_#t~short8; [L51] havoc main_#t~short8; [L51] havoc main_#t~ret7; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0] [L52] assert false; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0; [L47] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L48] fabs_double_#in~x := main_~x~0; [L48] havoc fabs_double_#res; [L48] havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1, fabs_double_#t~mem4, fabs_double_#t~union5, fabs_double_~#sh_u~0, fabs_double_~x, fabs_double_~high~0; [L25-L39] fabs_double_~x := fabs_double_#in~x; [L26] havoc fabs_double_~high~0; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_~x=0.0, main_~x~0=0.0] [L28] FCALL call fabs_double_~#gh_u~1 := #Ultimate.alloc(8); [L29] FCALL call write~real(fabs_double_~x, { base: fabs_double_~#gh_u~1!base, offset: fabs_double_~#gh_u~1!offset }, 8); [L30] FCALL call fabs_double_#t~mem2 := read~int({ base: fabs_double_~#gh_u~1!base, offset: 4 + fabs_double_~#gh_u~1!offset }, 4); [L30] fabs_double_~high~0 := fabs_double_#t~mem2; [L30] FCALL call write~real(fabs_double_#t~union3, { base: fabs_double_~#gh_u~1!base, offset: fabs_double_~#gh_u~1!offset }, 8); [L30] havoc fabs_double_#t~mem2; [L30] havoc fabs_double_#t~union3; [L28] FCALL call ULTIMATE.dealloc(fabs_double_~#gh_u~1); [L28] havoc fabs_double_~#gh_u~1; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~x~0=0.0] [L33] FCALL call fabs_double_~#sh_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(fabs_double_~x, { base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 8); [L35] FCALL call write~int(~bitwiseAnd(fabs_double_~high~0, 2147483647), { base: fabs_double_~#sh_u~0!base, offset: 4 + fabs_double_~#sh_u~0!offset }, 4); [L36] FCALL call fabs_double_#t~mem4 := read~real({ base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 8); [L36] fabs_double_~x := fabs_double_#t~mem4; [L36] FCALL call write~int(fabs_double_#t~union5!lsw, { base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 4); [L36] FCALL call write~int(fabs_double_#t~union5!msw, { base: fabs_double_~#sh_u~0!base, offset: 4 + fabs_double_~#sh_u~0!offset }, 4); [L36] havoc fabs_double_#t~union5; [L36] havoc fabs_double_#t~mem4; [L33] FCALL call ULTIMATE.dealloc(fabs_double_~#sh_u~0); [L33] havoc fabs_double_~#sh_u~0; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~x~0=0.0] [L38] fabs_double_#res := fabs_double_~x; [L48] main_#t~ret6 := fabs_double_#res; [L48] main_~res~0 := main_#t~ret6; [L48] havoc main_#t~ret6; [L51] main_#t~short8 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_#t~short8=false, main_~res~0=0.0, main_~x~0=0.0] [L51] COND FALSE !(main_#t~short8) VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_#t~short8=false, main_~res~0=0.0, main_~x~0=0.0] [L51] COND TRUE !main_#t~short8 [L51] havoc main_#t~short8; [L51] havoc main_#t~ret7; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0] [L52] assert false; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0; [L47] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L48] fabs_double_#in~x := main_~x~0; [L48] havoc fabs_double_#res; [L48] havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1, fabs_double_#t~mem4, fabs_double_#t~union5, fabs_double_~#sh_u~0, fabs_double_~x, fabs_double_~high~0; [L25-L39] fabs_double_~x := fabs_double_#in~x; [L26] havoc fabs_double_~high~0; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_~x=0.0, main_~x~0=0.0] [L28] FCALL call fabs_double_~#gh_u~1 := #Ultimate.alloc(8); [L29] FCALL call write~real(fabs_double_~x, { base: fabs_double_~#gh_u~1!base, offset: fabs_double_~#gh_u~1!offset }, 8); [L30] FCALL call fabs_double_#t~mem2 := read~int({ base: fabs_double_~#gh_u~1!base, offset: 4 + fabs_double_~#gh_u~1!offset }, 4); [L30] fabs_double_~high~0 := fabs_double_#t~mem2; [L30] FCALL call write~real(fabs_double_#t~union3, { base: fabs_double_~#gh_u~1!base, offset: fabs_double_~#gh_u~1!offset }, 8); [L30] havoc fabs_double_#t~mem2; [L30] havoc fabs_double_#t~union3; [L28] FCALL call ULTIMATE.dealloc(fabs_double_~#gh_u~1); [L28] havoc fabs_double_~#gh_u~1; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~x~0=0.0] [L33] FCALL call fabs_double_~#sh_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(fabs_double_~x, { base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 8); [L35] FCALL call write~int(~bitwiseAnd(fabs_double_~high~0, 2147483647), { base: fabs_double_~#sh_u~0!base, offset: 4 + fabs_double_~#sh_u~0!offset }, 4); [L36] FCALL call fabs_double_#t~mem4 := read~real({ base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 8); [L36] fabs_double_~x := fabs_double_#t~mem4; [L36] FCALL call write~int(fabs_double_#t~union5!lsw, { base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 4); [L36] FCALL call write~int(fabs_double_#t~union5!msw, { base: fabs_double_~#sh_u~0!base, offset: 4 + fabs_double_~#sh_u~0!offset }, 4); [L36] havoc fabs_double_#t~union5; [L36] havoc fabs_double_#t~mem4; [L33] FCALL call ULTIMATE.dealloc(fabs_double_~#sh_u~0); [L33] havoc fabs_double_~#sh_u~0; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~x~0=0.0] [L38] fabs_double_#res := fabs_double_~x; [L48] main_#t~ret6 := fabs_double_#res; [L48] main_~res~0 := main_#t~ret6; [L48] havoc main_#t~ret6; [L51] main_#t~short8 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_#t~short8=false, main_~res~0=0.0, main_~x~0=0.0] [L51] COND FALSE !(main_#t~short8) VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_#t~short8=false, main_~res~0=0.0, main_~x~0=0.0] [L51] COND TRUE !main_#t~short8 [L51] havoc main_#t~short8; [L51] havoc main_#t~ret7; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0] [L52] assert false; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=0.0, fabs_double_#res=0.0, fabs_double_~high~0=14, fabs_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L47] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L25-L39] ~x := #in~x; [L26] havoc ~high~0; VAL [#NULL!base=0, #NULL!offset=0] [L28] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L29] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] FCALL call #t~mem2 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L30] ~high~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L28] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L28] havoc ~#gh_u~1; VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L35] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L36] ~x := #t~mem4; [L36] FCALL call write~int(#t~union5!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L36] FCALL call write~int(#t~union5!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L33] havoc ~#sh_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L38] #res := ~x; [L48] ~res~0 := #t~ret6; [L48] havoc #t~ret6; [L51] #t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L51] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0] [L51] COND TRUE !#t~short8 [L51] havoc #t~short8; [L51] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0] [L52] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L47] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L25-L39] ~x := #in~x; [L26] havoc ~high~0; VAL [#NULL!base=0, #NULL!offset=0] [L28] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L29] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] FCALL call #t~mem2 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L30] ~high~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L28] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L28] havoc ~#gh_u~1; VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L35] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L36] ~x := #t~mem4; [L36] FCALL call write~int(#t~union5!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L36] FCALL call write~int(#t~union5!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] havoc #t~union5; [L36] havoc #t~mem4; [L33] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L33] havoc ~#sh_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L38] #res := ~x; [L48] ~res~0 := #t~ret6; [L48] havoc #t~ret6; [L51] #t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L51] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0] [L51] COND TRUE !#t~short8 [L51] havoc #t~short8; [L51] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0] [L52] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L47] double x = -0.0; [L26] __uint32_t high; [L28] ieee_double_shape_type gh_u; [L29] gh_u.value = (x) [L30] EXPR gh_u.parts.msw [L30] (high) = gh_u.parts.msw [L33] ieee_double_shape_type sh_u; [L34] sh_u.value = (x) [L35] sh_u.parts.msw = (high & 0x7fffffff) [L36] EXPR sh_u.value [L36] (x) = sh_u.value [L38] return x; [L48] double res = fabs_double(x); [L51] EXPR res == 0.0 && __signbit_double(res) == 0 [L51] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L52] __VERIFIER_error() ----- [2018-11-23 06:06:23,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 06:06:23 ImpRootNode [2018-11-23 06:06:23,621 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 06:06:23,621 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:06:23,621 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:06:23,621 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:06:23,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:06:23" (3/4) ... [2018-11-23 06:06:23,625 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:06:23,625 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:06:23,626 INFO L168 Benchmark]: Toolchain (without parser) took 842.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:06:23,627 INFO L168 Benchmark]: CDTParser took 0.18 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 06:06:23,628 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.65 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:06:23,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.79 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:06:23,629 INFO L168 Benchmark]: Boogie Preprocessor took 67.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -220.5 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:06:23,630 INFO L168 Benchmark]: RCFGBuilder took 240.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:06:23,630 INFO L168 Benchmark]: CodeCheck took 276.79 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: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:06:23,631 INFO L168 Benchmark]: Witness Printer took 3.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:06:23,634 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, 19 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 48 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, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 36 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: 52]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someUnaryDOUBLEoperation at line 47, overapproximation of bitwiseAnd at line 35. Possible FailurePath: [L47] double x = -0.0; [L26] __uint32_t high; [L28] ieee_double_shape_type gh_u; [L29] gh_u.value = (x) [L30] EXPR gh_u.parts.msw [L30] (high) = gh_u.parts.msw [L33] ieee_double_shape_type sh_u; [L34] sh_u.value = (x) [L35] sh_u.parts.msw = (high & 0x7fffffff) [L36] EXPR sh_u.value [L36] (x) = sh_u.value [L38] return x; [L48] double res = fabs_double(x); [L51] EXPR res == 0.0 && __signbit_double(res) == 0 [L51] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L52] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 222.65 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.79 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -220.5 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 240.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * CodeCheck took 276.79 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: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. 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 06:06:25,214 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:06:25,215 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:06:25,223 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:06:25,223 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:06:25,224 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:06:25,225 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:06:25,226 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:06:25,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:06:25,228 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:06:25,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:06:25,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:06:25,230 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:06:25,231 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:06:25,232 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:06:25,232 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:06:25,233 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:06:25,235 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:06:25,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:06:25,237 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:06:25,238 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:06:25,239 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:06:25,241 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:06:25,241 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:06:25,241 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:06:25,242 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:06:25,243 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:06:25,243 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:06:25,244 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:06:25,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:06:25,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:06:25,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:06:25,246 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:06:25,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:06:25,247 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:06:25,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:06:25,248 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 06:06:25,260 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:06:25,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:06:25,261 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:06:25,262 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 06:06:25,262 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:06:25,262 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:06:25,263 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:06:25,263 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:06:25,263 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:06:25,263 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:06:25,263 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:06:25,263 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:06:25,264 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:06:25,264 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 06:06:25,264 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 06:06:25,264 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:06:25,264 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:06:25,264 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:06:25,265 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:06:25,265 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 06:06:25,265 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 06:06:25,265 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:06:25,265 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:06:25,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 06:06:25,266 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:06:25,266 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:06:25,266 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:06:25,266 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 06:06:25,266 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 06:06:25,266 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:06:25,267 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 06:06:25,267 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 06:06:25,267 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_7fc8b988-fd03-421b-b041-3d138cbed85d/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 -> dbef25694faa90ff4d63502c2f243449da0e6c28 [2018-11-23 06:06:25,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:06:25,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:06:25,313 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:06:25,314 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:06:25,315 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:06:25,315 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1011b_true-unreach-call.c [2018-11-23 06:06:25,370 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/data/7110cca9e/b9494946e13642e688538e65c07ba64a/FLAG782ec43a5 [2018-11-23 06:06:25,714 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:06:25,715 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/sv-benchmarks/c/float-newlib/double_req_bl_1011b_true-unreach-call.c [2018-11-23 06:06:25,719 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/data/7110cca9e/b9494946e13642e688538e65c07ba64a/FLAG782ec43a5 [2018-11-23 06:06:26,138 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/bin-2019/ukojak/data/7110cca9e/b9494946e13642e688538e65c07ba64a [2018-11-23 06:06:26,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:06:26,143 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:06:26,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:06:26,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:06:26,146 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:06:26,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:06:26" (1/1) ... [2018-11-23 06:06:26,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2129d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:26, skipping insertion in model container [2018-11-23 06:06:26,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:06:26" (1/1) ... [2018-11-23 06:06:26,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:06:26,173 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:06:26,313 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:06:26,318 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:06:26,338 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:06:26,360 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:06:26,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:26 WrapperNode [2018-11-23 06:06:26,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:06:26,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:06:26,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:06:26,362 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:06:26,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:26" (1/1) ... [2018-11-23 06:06:26,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:26" (1/1) ... [2018-11-23 06:06:26,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:06:26,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:06:26,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:06:26,392 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:06:26,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:26" (1/1) ... [2018-11-23 06:06:26,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:26" (1/1) ... [2018-11-23 06:06:26,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:26" (1/1) ... [2018-11-23 06:06:26,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:26" (1/1) ... [2018-11-23 06:06:26,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:26" (1/1) ... [2018-11-23 06:06:26,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:26" (1/1) ... [2018-11-23 06:06:26,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:26" (1/1) ... [2018-11-23 06:06:26,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:06:26,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:06:26,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:06:26,422 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:06:26,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:06:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7fc8b988-fd03-421b-b041-3d138cbed85d/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 06:06:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 06:06:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:06:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 06:06:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 06:06:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:06:26,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:06:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 06:06:26,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:06:26,647 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 06:06:26,690 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 06:06:26,714 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 06:06:26,765 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:06:26,765 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 06:06:26,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:06:26 BoogieIcfgContainer [2018-11-23 06:06:26,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:06:26,767 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 06:06:26,767 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 06:06:26,779 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 06:06:26,779 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:06:26" (1/1) ... [2018-11-23 06:06:26,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:06:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:06:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 15 states and 22 transitions. [2018-11-23 06:06:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2018-11-23 06:06:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 06:06:26,824 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:06:26,870 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:06:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:06:26,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:06:26,908 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 06:06:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:06:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 15 states and 17 transitions. [2018-11-23 06:06:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 06:06:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 06:06:26,917 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:06:26,918 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:06:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:06:26,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:06:26,995 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:06:26,996 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:06:27,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 06:06:27,067 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:06:27,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:06:27,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-11-23 06:06:27,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 06:06:27,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:06:27,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 06:06:27,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,109 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:06:27,121 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:18 [2018-11-23 06:06:27,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-11-23 06:06:27,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-11-23 06:06:27,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-11-23 06:06:27,183 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,191 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 06:06:27,211 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:87, output treesize:48 [2018-11-23 06:06:27,270 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 06:06:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:06:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 15 states and 16 transitions. [2018-11-23 06:06:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 06:06:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 06:06:27,518 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:06:27,519 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:06:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:06:27,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:06:27,545 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 06:06:27,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:06:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 15 states and 14 transitions. [2018-11-23 06:06:27,549 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-23 06:06:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 06:06:27,550 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 06:06:27,552 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 06:06:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:06:27,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:06:27,591 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:06:27,592 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:06:27,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 06:06:27,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:06:27,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-23 06:06:27,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 06:06:27,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 06:06:27,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 06:06:27,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 06:06:27,673 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:18 [2018-11-23 06:06:27,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-11-23 06:06:27,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-11-23 06:06:27,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-11-23 06:06:27,706 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,710 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 06:06:27,734 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:92, output treesize:53 [2018-11-23 06:06:27,871 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:06:27,872 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:06:27,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 06:06:27,906 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:06:27,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2018-11-23 06:06:27,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 06:06:27,932 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 06:06:27,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 06:06:27,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,939 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:06:27,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 06:06:27,960 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:86, output treesize:58 [2018-11-23 06:06:28,045 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 06:06:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 06:06:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 13 states and 12 transitions. [2018-11-23 06:06:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2018-11-23 06:06:28,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 06:06:28,615 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 5 iterations. [2018-11-23 06:06:28,621 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 06:06:28,675 INFO L579 CodeCheckObserver]: Invariant with dag size 27 [2018-11-23 06:06:28,677 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.reportResult(CodeCheckObserver.java:815) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.createInvariantResults(CodeCheckObserver.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:539) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 06:06:28,679 INFO L168 Benchmark]: Toolchain (without parser) took 2536.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 943.8 MB in the beginning and 958.8 MB in the end (delta: -14.9 MB). Peak memory consumption was 119.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:06:28,680 INFO L168 Benchmark]: CDTParser took 0.20 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 06:06:28,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.44 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 927.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:06:28,681 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.33 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:06:28,681 INFO L168 Benchmark]: Boogie Preprocessor took 29.54 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:06:28,681 INFO L168 Benchmark]: RCFGBuilder took 344.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-23 06:06:28,682 INFO L168 Benchmark]: CodeCheck took 1911.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 958.8 MB in the end (delta: 146.3 MB). Peak memory consumption was 146.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:06:28,684 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, 19 locations, 1 error locations. SAFE Result, 1.8s OverallTime, 5 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 140 SDtfs, 46 SDslu, 36 SDs, 0 SdLazy, 174 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 255 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 35 ConstructedInterpolants, 12 QuantifiedInterpolants, 5256 SizeOfPredicates, 17 NumberOfNonLiveVariables, 140 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 52]: 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 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 217.44 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 927.7 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 30.33 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.54 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 344.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * CodeCheck took 1911.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 958.8 MB in the end (delta: 146.3 MB). Peak memory consumption was 146.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...