./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1252a_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_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1252a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/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 b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1252a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/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 b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 ........................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_6 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_5|)) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 08:33:16,379 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:33:16,380 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:33:16,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:33:16,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:33:16,387 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:33:16,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:33:16,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:33:16,389 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:33:16,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:33:16,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:33:16,390 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:33:16,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:33:16,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:33:16,392 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:33:16,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:33:16,393 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:33:16,394 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:33:16,395 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:33:16,396 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:33:16,397 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:33:16,398 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:33:16,400 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:33:16,400 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:33:16,400 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:33:16,401 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:33:16,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:33:16,402 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:33:16,403 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:33:16,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:33:16,403 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:33:16,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:33:16,404 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:33:16,404 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:33:16,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:33:16,405 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:33:16,406 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 08:33:16,413 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:33:16,413 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:33:16,413 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:33:16,413 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 08:33:16,414 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:33:16,414 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:33:16,414 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:33:16,414 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:33:16,414 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:33:16,414 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:33:16,414 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:33:16,414 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:33:16,414 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:33:16,415 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:33:16,415 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:33:16,415 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:33:16,415 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:33:16,415 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:33:16,415 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 08:33:16,415 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 08:33:16,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:33:16,416 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:33:16,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 08:33:16,416 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:33:16,416 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:33:16,416 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:33:16,416 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 08:33:16,416 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:33:16,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:33:16,417 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_68baa4ae-c373-4bf7-9281-f27594749a49/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 -> b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 [2018-11-23 08:33:16,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:33:16,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:33:16,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:33:16,457 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:33:16,457 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:33:16,458 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1252a_true-unreach-call.c [2018-11-23 08:33:16,495 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/data/555941618/56b242614c4747649be3b4a28dc88da6/FLAGc26122391 [2018-11-23 08:33:16,913 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:33:16,914 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/sv-benchmarks/c/float-newlib/double_req_bl_1252a_true-unreach-call.c [2018-11-23 08:33:16,918 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/data/555941618/56b242614c4747649be3b4a28dc88da6/FLAGc26122391 [2018-11-23 08:33:16,929 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/data/555941618/56b242614c4747649be3b4a28dc88da6 [2018-11-23 08:33:16,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:33:16,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:33:16,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:33:16,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:33:16,936 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:33:16,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:33:16" (1/1) ... [2018-11-23 08:33:16,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b02929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:16, skipping insertion in model container [2018-11-23 08:33:16,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:33:16" (1/1) ... [2018-11-23 08:33:16,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:33:16,966 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:33:17,092 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:33:17,094 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:33:17,109 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:33:17,123 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:33:17,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:17 WrapperNode [2018-11-23 08:33:17,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:33:17,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:33:17,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:33:17,124 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:33:17,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:17" (1/1) ... [2018-11-23 08:33:17,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:17" (1/1) ... [2018-11-23 08:33:17,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:33:17,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:33:17,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:33:17,185 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:33:17,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:17" (1/1) ... [2018-11-23 08:33:17,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:17" (1/1) ... [2018-11-23 08:33:17,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:17" (1/1) ... [2018-11-23 08:33:17,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:17" (1/1) ... [2018-11-23 08:33:17,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:17" (1/1) ... [2018-11-23 08:33:17,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:17" (1/1) ... [2018-11-23 08:33:17,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:17" (1/1) ... [2018-11-23 08:33:17,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:33:17,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:33:17,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:33:17,207 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:33:17,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/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 08:33:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 08:33:17,240 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 08:33:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 08:33:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 08:33:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:33:17,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:33:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 08:33:17,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 08:33:17,548 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:33:17,548 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 08:33:17,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:33:17 BoogieIcfgContainer [2018-11-23 08:33:17,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:33:17,549 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 08:33:17,549 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 08:33:17,556 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 08:33:17,556 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:33:17" (1/1) ... [2018-11-23 08:33:17,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:33:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions. [2018-11-23 08:33:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2018-11-23 08:33:17,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 08:33:17,600 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:33:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:17,682 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 08:33:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:33:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 21 states and 25 transitions. [2018-11-23 08:33:17,689 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-23 08:33:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 08:33:17,689 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:33:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:33:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:33:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:33:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 08:33:17,785 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~ret9, main_#t~ret10, main_#t~short11, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~someUnaryDOUBLEoperation(0.0);main_~y~0 := 0.0;fmax_double_#in~x, fmax_double_#in~y := main_~x~0, main_~y~0;havoc fmax_double_#res;havoc fmax_double_#t~ret4, fmax_double_#t~ret5, fmax_double_#t~ite6, fmax_double_~x, fmax_double_~y;fmax_double_~x := fmax_double_#in~x;fmax_double_~y := fmax_double_#in~y; VAL [ULTIMATE.start_fmax_double_~x=1.0, ULTIMATE.start_fmax_double_~y=0.0, ULTIMATE.start_main_~x~0=1.0, ULTIMATE.start_main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fmax_double_#in~x|=1.0, |ULTIMATE.start_fmax_double_#in~y|=0.0] [?] CALL call fmax_double_#t~ret4 := __fpclassify_double(fmax_double_~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=1.0] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=1.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=1.0] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__fpclassify_double_~lsw~0=10, __fpclassify_double_~msw~0=2146435073, __fpclassify_double_~x=1.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=1.0] [?] goto; VAL [__fpclassify_double_~lsw~0=10, __fpclassify_double_~msw~0=2146435073, __fpclassify_double_~x=1.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=1.0] [?] BeginParallelComposition{ParallelCodeBlock0: assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2;ParallelCodeBlock1: assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296));BeginParallelComposition{ParallelCodeBlock0: assume (~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719);#res := 4;ParallelCodeBlock1: assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719));BeginParallelComposition{ParallelCodeBlock0: assume ~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223);#res := 3;ParallelCodeBlock1: assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223));BeginParallelComposition{ParallelCodeBlock0: assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1;ParallelCodeBlock1: assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296));#res := 0;}EndParallelComposition}EndParallelComposition}EndParallelComposition}EndParallelCompositionassume true; VAL [__fpclassify_double_~lsw~0=10, __fpclassify_double_~msw~0=2146435073, __fpclassify_double_~x=1.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=1.0, |__fpclassify_double_#res|=0] [?] RET #88#return; VAL [ULTIMATE.start_fmax_double_~x=1.0, ULTIMATE.start_fmax_double_~y=0.0, ULTIMATE.start_main_~x~0=1.0, ULTIMATE.start_main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fmax_double_#in~x|=1.0, |ULTIMATE.start_fmax_double_#in~y|=0.0, |ULTIMATE.start_fmax_double_#t~ret4|=0] [?] assume -2147483648 <= fmax_double_#t~ret4 && fmax_double_#t~ret4 <= 2147483647; VAL [ULTIMATE.start_fmax_double_~x=1.0, ULTIMATE.start_fmax_double_~y=0.0, ULTIMATE.start_main_~x~0=1.0, ULTIMATE.start_main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fmax_double_#in~x|=1.0, |ULTIMATE.start_fmax_double_#in~y|=0.0, |ULTIMATE.start_fmax_double_#t~ret4|=0] [?] assume 0 == fmax_double_#t~ret4;havoc fmax_double_#t~ret4;fmax_double_#res := fmax_double_~y; VAL [ULTIMATE.start_fmax_double_~x=1.0, ULTIMATE.start_fmax_double_~y=0.0, ULTIMATE.start_main_~x~0=1.0, ULTIMATE.start_main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fmax_double_#in~x|=1.0, |ULTIMATE.start_fmax_double_#in~y|=0.0, |ULTIMATE.start_fmax_double_#res|=0.0] [?] main_#t~ret9 := fmax_double_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9;main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [ULTIMATE.start_fmax_double_~x=1.0, ULTIMATE.start_fmax_double_~y=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=1.0, ULTIMATE.start_main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fmax_double_#in~x|=1.0, |ULTIMATE.start_fmax_double_#in~y|=0.0, |ULTIMATE.start_fmax_double_#res|=0.0, |ULTIMATE.start_main_#t~short11|=false] [?] assume !main_#t~short11; VAL [ULTIMATE.start_fmax_double_~x=1.0, ULTIMATE.start_fmax_double_~y=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=1.0, ULTIMATE.start_main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fmax_double_#in~x|=1.0, |ULTIMATE.start_fmax_double_#in~y|=0.0, |ULTIMATE.start_fmax_double_#res|=0.0, |ULTIMATE.start_main_#t~short11|=false] [?] assume !main_#t~short11;havoc main_#t~ret10;havoc main_#t~short11; VAL [ULTIMATE.start_fmax_double_~x=1.0, ULTIMATE.start_fmax_double_~y=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=1.0, ULTIMATE.start_main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fmax_double_#in~x|=1.0, |ULTIMATE.start_fmax_double_#in~y|=0.0, |ULTIMATE.start_fmax_double_#res|=0.0] [?] assume !false; VAL [ULTIMATE.start_fmax_double_~x=1.0, ULTIMATE.start_fmax_double_~y=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=1.0, ULTIMATE.start_main_~y~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fmax_double_#in~x|=1.0, |ULTIMATE.start_fmax_double_#in~y|=0.0, |ULTIMATE.start_fmax_double_#res|=0.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret9, main_#t~ret10, main_#t~short11, main_~x~0, main_~y~0, main_~res~0; [L79] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L80] main_~y~0 := 0.0; [L81] fmax_double_#in~x, fmax_double_#in~y := main_~x~0, main_~y~0; [L81] havoc fmax_double_#res; [L81] havoc fmax_double_#t~ret4, fmax_double_#t~ret5, fmax_double_#t~ite6, fmax_double_~x, fmax_double_~y; [L50-L58] fmax_double_~x := fmax_double_#in~x; [L50-L58] fmax_double_~y := fmax_double_#in~y; VAL [#NULL.base=0, #NULL.offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~x~0=1.0, main_~y~0=0.0] [L52] CALL call fmax_double_#t~ret4 := __fpclassify_double(fmax_double_~x); VAL [#in~x=1.0, #NULL.base=0, #NULL.offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=1.0, #NULL.base=0, #NULL.offset=0, ~x=1.0] [L27] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L28] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L29] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L29] ~msw~0 := #t~mem0; [L29] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L29] havoc #t~mem0; [L29] havoc #t~union1; [L30] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L30] ~lsw~0 := #t~mem2; [L30] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L27] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=1.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=10, ~msw~0=2146435073, ~x=1.0] [L33-L47] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L36-L47] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); [L39-L47] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); [L43-L47] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L47] #res := 0; [L23-L48] ensures true; VAL [#in~x=1.0, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=10, ~msw~0=2146435073, ~x=1.0] [L52] RET call fmax_double_#t~ret4 := __fpclassify_double(fmax_double_~x); VAL [#NULL.base=0, #NULL.offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#t~ret4=0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~x~0=1.0, main_~y~0=0.0] [L52] assume -2147483648 <= fmax_double_#t~ret4 && fmax_double_#t~ret4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#t~ret4=0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~x~0=1.0, main_~y~0=0.0] [L52-L53] assume 0 == fmax_double_#t~ret4; [L52] havoc fmax_double_#t~ret4; [L53] fmax_double_#res := fmax_double_~y; VAL [#NULL.base=0, #NULL.offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~x~0=1.0, main_~y~0=0.0] [L81] main_#t~ret9 := fmax_double_#res; [L81] main_~res~0 := main_#t~ret9; [L81] havoc main_#t~ret9; [L84] main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_#t~short11=false, main_~res~0=0.0, main_~x~0=1.0, main_~y~0=0.0] [L84] assume !main_#t~short11; VAL [#NULL.base=0, #NULL.offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_#t~short11=false, main_~res~0=0.0, main_~x~0=1.0, main_~y~0=0.0] [L84-L87] assume !main_#t~short11; [L84] havoc main_#t~ret10; [L84] havoc main_#t~short11; VAL [#NULL.base=0, #NULL.offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~res~0=0.0, main_~x~0=1.0, main_~y~0=0.0] [L85] assert false; VAL [#NULL.base=0, #NULL.offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~res~0=0.0, main_~x~0=1.0, main_~y~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~ret9, main_#t~ret10, main_#t~short11, main_~x~0, main_~y~0, main_~res~0; [L79] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L80] main_~y~0 := 0.0; [L81] fmax_double_#in~x, fmax_double_#in~y := main_~x~0, main_~y~0; [L81] havoc fmax_double_#res; [L81] havoc fmax_double_#t~ret4, fmax_double_#t~ret5, fmax_double_#t~ite6, fmax_double_~x, fmax_double_~y; [L50-L58] fmax_double_~x := fmax_double_#in~x; [L50-L58] fmax_double_~y := fmax_double_#in~y; VAL [#NULL.base=0, #NULL.offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~x~0=1.0, main_~y~0=0.0] [L52] CALL call fmax_double_#t~ret4 := __fpclassify_double(fmax_double_~x); VAL [#in~x=1.0, #NULL.base=0, #NULL.offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=1.0, #NULL.base=0, #NULL.offset=0, ~x=1.0] [L27] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L28] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L29] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L29] ~msw~0 := #t~mem0; [L29] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L29] havoc #t~mem0; [L29] havoc #t~union1; [L30] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L30] ~lsw~0 := #t~mem2; [L30] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L27] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=1.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=10, ~msw~0=2146435073, ~x=1.0] [L33-L47] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L36-L47] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); [L39-L47] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); [L43-L47] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L47] #res := 0; [L23-L48] ensures true; VAL [#in~x=1.0, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=10, ~msw~0=2146435073, ~x=1.0] [L52] RET call fmax_double_#t~ret4 := __fpclassify_double(fmax_double_~x); VAL [#NULL.base=0, #NULL.offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#t~ret4=0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~x~0=1.0, main_~y~0=0.0] [L52] assume -2147483648 <= fmax_double_#t~ret4 && fmax_double_#t~ret4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#t~ret4=0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~x~0=1.0, main_~y~0=0.0] [L52-L53] assume 0 == fmax_double_#t~ret4; [L52] havoc fmax_double_#t~ret4; [L53] fmax_double_#res := fmax_double_~y; VAL [#NULL.base=0, #NULL.offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~x~0=1.0, main_~y~0=0.0] [L81] main_#t~ret9 := fmax_double_#res; [L81] main_~res~0 := main_#t~ret9; [L81] havoc main_#t~ret9; [L84] main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_#t~short11=false, main_~res~0=0.0, main_~x~0=1.0, main_~y~0=0.0] [L84] assume !main_#t~short11; VAL [#NULL.base=0, #NULL.offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_#t~short11=false, main_~res~0=0.0, main_~x~0=1.0, main_~y~0=0.0] [L84-L87] assume !main_#t~short11; [L84] havoc main_#t~ret10; [L84] havoc main_#t~short11; VAL [#NULL.base=0, #NULL.offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~res~0=0.0, main_~x~0=1.0, main_~y~0=0.0] [L85] assert false; VAL [#NULL.base=0, #NULL.offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~res~0=0.0, main_~x~0=1.0, main_~y~0=0.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret9, main_#t~ret10, main_#t~short11, main_~x~0, main_~y~0, main_~res~0; [L79] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L80] main_~y~0 := 0.0; [L81] fmax_double_#in~x, fmax_double_#in~y := main_~x~0, main_~y~0; [L81] havoc fmax_double_#res; [L81] havoc fmax_double_#t~ret4, fmax_double_#t~ret5, fmax_double_#t~ite6, fmax_double_~x, fmax_double_~y; [L50-L58] fmax_double_~x := fmax_double_#in~x; [L50-L58] fmax_double_~y := fmax_double_#in~y; VAL [#NULL!base=0, #NULL!offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~x~0=1.0, main_~y~0=0.0] [L52] CALL call fmax_double_#t~ret4 := __fpclassify_double(fmax_double_~x); VAL [#in~x=1.0, #NULL!base=0, #NULL!offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=1.0, #NULL!base=0, #NULL!offset=0, ~x=1.0] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L28] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] havoc #t~mem0; [L29] havoc #t~union1; [L30] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=1.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=10, ~msw~0=2146435073, ~x=1.0] [L33-L34] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L36-L37] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) [L39-L40] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) [L43-L44] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L47] #res := 0; [L52] RET call fmax_double_#t~ret4 := __fpclassify_double(fmax_double_~x); VAL [#NULL!base=0, #NULL!offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#t~ret4=0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~x~0=1.0, main_~y~0=0.0] [L52] assume -2147483648 <= fmax_double_#t~ret4 && fmax_double_#t~ret4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#t~ret4=0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~x~0=1.0, main_~y~0=0.0] [L52] COND TRUE 0 == fmax_double_#t~ret4 [L52] havoc fmax_double_#t~ret4; [L53] fmax_double_#res := fmax_double_~y; VAL [#NULL!base=0, #NULL!offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~x~0=1.0, main_~y~0=0.0] [L81] main_#t~ret9 := fmax_double_#res; [L81] main_~res~0 := main_#t~ret9; [L81] havoc main_#t~ret9; [L84] main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_#t~short11=false, main_~res~0=0.0, main_~x~0=1.0, main_~y~0=0.0] [L84] COND FALSE !(main_#t~short11) VAL [#NULL!base=0, #NULL!offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_#t~short11=false, main_~res~0=0.0, main_~x~0=1.0, main_~y~0=0.0] [L84] COND TRUE !main_#t~short11 [L84] havoc main_#t~ret10; [L84] havoc main_#t~short11; VAL [#NULL!base=0, #NULL!offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~res~0=0.0, main_~x~0=1.0, main_~y~0=0.0] [L85] assert false; VAL [#NULL!base=0, #NULL!offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~res~0=0.0, main_~x~0=1.0, main_~y~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~ret9, main_#t~ret10, main_#t~short11, main_~x~0, main_~y~0, main_~res~0; [L79] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L80] main_~y~0 := 0.0; [L81] fmax_double_#in~x, fmax_double_#in~y := main_~x~0, main_~y~0; [L81] havoc fmax_double_#res; [L81] havoc fmax_double_#t~ret4, fmax_double_#t~ret5, fmax_double_#t~ite6, fmax_double_~x, fmax_double_~y; [L50-L58] fmax_double_~x := fmax_double_#in~x; [L50-L58] fmax_double_~y := fmax_double_#in~y; VAL [#NULL!base=0, #NULL!offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~x~0=1.0, main_~y~0=0.0] [L52] CALL call fmax_double_#t~ret4 := __fpclassify_double(fmax_double_~x); VAL [#in~x=1.0, #NULL!base=0, #NULL!offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=1.0, #NULL!base=0, #NULL!offset=0, ~x=1.0] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L28] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] havoc #t~mem0; [L29] havoc #t~union1; [L30] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=1.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=10, ~msw~0=2146435073, ~x=1.0] [L33-L34] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L36-L37] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) [L39-L40] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) [L43-L44] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L47] #res := 0; [L52] RET call fmax_double_#t~ret4 := __fpclassify_double(fmax_double_~x); VAL [#NULL!base=0, #NULL!offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#t~ret4=0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~x~0=1.0, main_~y~0=0.0] [L52] assume -2147483648 <= fmax_double_#t~ret4 && fmax_double_#t~ret4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#t~ret4=0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~x~0=1.0, main_~y~0=0.0] [L52] COND TRUE 0 == fmax_double_#t~ret4 [L52] havoc fmax_double_#t~ret4; [L53] fmax_double_#res := fmax_double_~y; VAL [#NULL!base=0, #NULL!offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~x~0=1.0, main_~y~0=0.0] [L81] main_#t~ret9 := fmax_double_#res; [L81] main_~res~0 := main_#t~ret9; [L81] havoc main_#t~ret9; [L84] main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_#t~short11=false, main_~res~0=0.0, main_~x~0=1.0, main_~y~0=0.0] [L84] COND FALSE !(main_#t~short11) VAL [#NULL!base=0, #NULL!offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_#t~short11=false, main_~res~0=0.0, main_~x~0=1.0, main_~y~0=0.0] [L84] COND TRUE !main_#t~short11 [L84] havoc main_#t~ret10; [L84] havoc main_#t~short11; VAL [#NULL!base=0, #NULL!offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~res~0=0.0, main_~x~0=1.0, main_~y~0=0.0] [L85] assert false; VAL [#NULL!base=0, #NULL!offset=0, fmax_double_#in~x=1.0, fmax_double_#in~y=0.0, fmax_double_#res=0.0, fmax_double_~x=1.0, fmax_double_~y=0.0, main_~res~0=0.0, main_~x~0=1.0, main_~y~0=0.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L79] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L80] ~y~0 := 0.0; [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#NULL!base=0, #NULL!offset=0] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=1.0, #NULL!base=0, #NULL!offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=1.0, #NULL!base=0, #NULL!offset=0, ~x=1.0] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L28] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] havoc #t~mem0; [L29] havoc #t~union1; [L30] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=1.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=10, ~msw~0=2146435073, ~x=1.0] [L33-L34] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L36-L37] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) [L39-L40] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) [L43-L44] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L47] #res := 0; [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#NULL!base=0, #NULL!offset=0] [L52] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L52] COND TRUE 0 == #t~ret4 [L52] havoc #t~ret4; [L53] #res := ~y; VAL [#NULL!base=0, #NULL!offset=0] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L84] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0] [L84] COND TRUE !#t~short11 [L84] havoc #t~ret10; [L84] havoc #t~short11; VAL [#NULL!base=0, #NULL!offset=0] [L85] 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; [L79] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L80] ~y~0 := 0.0; [L50-L58] ~x := #in~x; [L50-L58] ~y := #in~y; VAL [#NULL!base=0, #NULL!offset=0] [L52] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=1.0, #NULL!base=0, #NULL!offset=0] [L23-L48] ~x := #in~x; [L24] havoc ~msw~0; [L24] havoc ~lsw~0; VAL [#in~x=1.0, #NULL!base=0, #NULL!offset=0, ~x=1.0] [L27] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L28] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L29] ~msw~0 := #t~mem0; [L29] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L29] havoc #t~mem0; [L29] havoc #t~union1; [L30] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L30] ~lsw~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L30] havoc #t~mem2; [L30] havoc #t~union3; [L27] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L27] havoc ~#ew_u~0; VAL [#in~x=1.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=10, ~msw~0=2146435073, ~x=1.0] [L33-L34] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L36-L37] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) [L39-L40] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) [L43-L44] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L47] #res := 0; [L52] RET call #t~ret4 := __fpclassify_double(~x); VAL [#NULL!base=0, #NULL!offset=0] [L52] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L52] COND TRUE 0 == #t~ret4 [L52] havoc #t~ret4; [L53] #res := ~y; VAL [#NULL!base=0, #NULL!offset=0] [L81] ~res~0 := #t~ret9; [L81] havoc #t~ret9; [L84] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L84] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0] [L84] COND TRUE !#t~short11 [L84] havoc #t~ret10; [L84] havoc #t~short11; VAL [#NULL!base=0, #NULL!offset=0] [L85] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L79] double x = -0.0; [L80] double y = 0.0; [L52] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=1] [L24] __uint32_t msw, lsw; VAL [\old(x)=1, x=1] [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L36-L37] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L39-L40] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L43-L44] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L47] return 0; [L52] RET, EXPR __fpclassify_double(x) [L52] COND TRUE __fpclassify_double(x) == 0 [L53] return y; [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() ----- [2018-11-23 08:33:17,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 08:33:17 ImpRootNode [2018-11-23 08:33:17,835 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 08:33:17,835 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:33:17,835 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:33:17,835 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:33:17,836 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:33:17" (3/4) ... [2018-11-23 08:33:17,842 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 08:33:17,842 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:33:17,842 INFO L168 Benchmark]: Toolchain (without parser) took 910.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -116.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:33:17,844 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:33:17,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.71 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:33:17,845 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 08:33:17,846 INFO L168 Benchmark]: Boogie Preprocessor took 20.84 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 08:33:17,846 INFO L168 Benchmark]: RCFGBuilder took 342.14 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:33:17,847 INFO L168 Benchmark]: CodeCheck took 285.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-23 08:33:17,847 INFO L168 Benchmark]: Witness Printer took 6.88 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 08:33:17,851 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 2 procedures, 31 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 79 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, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 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: 85]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 79. Possible FailurePath: [L79] double x = -0.0; [L80] double y = 0.0; [L52] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=1] [L24] __uint32_t msw, lsw; VAL [\old(x)=1, x=1] [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L36-L37] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L39-L40] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L43-L44] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L47] return 0; [L52] RET, EXPR __fpclassify_double(x) [L52] COND TRUE __fpclassify_double(x) == 0 [L53] return y; [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 190.71 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 342.14 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * CodeCheck took 285.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Witness Printer took 6.88 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 08:33:19,285 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:33:19,286 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:33:19,294 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:33:19,294 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:33:19,295 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:33:19,295 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:33:19,297 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:33:19,298 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:33:19,298 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:33:19,299 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:33:19,299 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:33:19,300 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:33:19,301 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:33:19,302 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:33:19,302 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:33:19,303 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:33:19,304 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:33:19,306 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:33:19,307 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:33:19,308 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:33:19,309 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:33:19,311 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:33:19,311 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:33:19,312 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:33:19,312 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:33:19,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:33:19,314 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:33:19,314 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:33:19,315 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:33:19,315 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:33:19,315 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:33:19,316 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:33:19,316 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:33:19,316 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:33:19,318 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:33:19,318 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 08:33:19,329 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:33:19,329 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:33:19,330 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:33:19,330 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 08:33:19,330 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:33:19,331 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:33:19,331 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:33:19,331 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:33:19,331 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:33:19,331 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:33:19,331 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:33:19,331 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:33:19,332 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:33:19,332 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 08:33:19,332 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 08:33:19,332 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:33:19,332 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:33:19,332 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:33:19,332 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:33:19,332 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 08:33:19,333 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 08:33:19,333 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:33:19,333 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:33:19,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 08:33:19,333 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:33:19,333 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:33:19,333 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:33:19,333 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 08:33:19,333 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 08:33:19,333 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:33:19,333 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 08:33:19,334 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 08:33:19,334 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_68baa4ae-c373-4bf7-9281-f27594749a49/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 -> b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 [2018-11-23 08:33:19,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:33:19,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:33:19,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:33:19,374 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:33:19,374 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:33:19,374 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1252a_true-unreach-call.c [2018-11-23 08:33:19,410 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/data/68a8e1583/ce18b7cebfc3406aa86c3f19279dff82/FLAGe0c254ceb [2018-11-23 08:33:19,812 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:33:19,813 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/sv-benchmarks/c/float-newlib/double_req_bl_1252a_true-unreach-call.c [2018-11-23 08:33:19,817 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/data/68a8e1583/ce18b7cebfc3406aa86c3f19279dff82/FLAGe0c254ceb [2018-11-23 08:33:19,825 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/bin-2019/ukojak/data/68a8e1583/ce18b7cebfc3406aa86c3f19279dff82 [2018-11-23 08:33:19,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:33:19,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:33:19,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:33:19,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:33:19,831 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:33:19,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:33:19" (1/1) ... [2018-11-23 08:33:19,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d0518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:19, skipping insertion in model container [2018-11-23 08:33:19,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:33:19" (1/1) ... [2018-11-23 08:33:19,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:33:19,853 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:33:19,976 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:33:19,980 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:33:20,001 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:33:20,020 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:33:20,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:20 WrapperNode [2018-11-23 08:33:20,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:33:20,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:33:20,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:33:20,021 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:33:20,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:20" (1/1) ... [2018-11-23 08:33:20,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:20" (1/1) ... [2018-11-23 08:33:20,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:33:20,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:33:20,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:33:20,050 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:33:20,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:20" (1/1) ... [2018-11-23 08:33:20,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:20" (1/1) ... [2018-11-23 08:33:20,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:20" (1/1) ... [2018-11-23 08:33:20,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:20" (1/1) ... [2018-11-23 08:33:20,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:20" (1/1) ... [2018-11-23 08:33:20,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:20" (1/1) ... [2018-11-23 08:33:20,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:20" (1/1) ... [2018-11-23 08:33:20,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:33:20,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:33:20,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:33:20,120 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:33:20,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:33:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68baa4ae-c373-4bf7-9281-f27594749a49/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 08:33:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 08:33:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 08:33:20,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 08:33:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 08:33:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 08:33:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:33:20,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:33:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 08:33:20,266 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 08:33:20,358 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 08:33:20,507 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:33:20,507 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 08:33:20,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:33:20 BoogieIcfgContainer [2018-11-23 08:33:20,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:33:20,508 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 08:33:20,508 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 08:33:20,517 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 08:33:20,517 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:33:20" (1/1) ... [2018-11-23 08:33:20,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:33:20,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:33:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 20 states and 27 transitions. [2018-11-23 08:33:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-11-23 08:33:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 08:33:20,555 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:33:20,590 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:33:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:20,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:20,628 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 08:33:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:33:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 20 states and 24 transitions. [2018-11-23 08:33:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2018-11-23 08:33:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 08:33:20,636 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:33:20,637 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:33:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:20,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:20,695 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 08:33:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:33:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 22 states and 27 transitions. [2018-11-23 08:33:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2018-11-23 08:33:20,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 08:33:20,790 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:33:20,791 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:33:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:20,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:20,807 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 08:33:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:33:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 22 states and 25 transitions. [2018-11-23 08:33:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 08:33:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 08:33:20,812 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:33:20,812 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:33:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:20,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:20,902 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:33:20,902 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:33:20,906 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 08:33:20,954 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:33:20,954 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:33:20,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-11-23 08:33:20,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:33:20,966 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 08:33:20,969 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:33:20,969 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 08:33:20,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 08:33:20,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:33:20,976 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 08:33:20,981 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 08:33:20,982 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 08:33:21,026 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 08:33:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:33:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 27 states and 31 transitions. [2018-11-23 08:33:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 08:33:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 08:33:21,296 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:33:21,296 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:33:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:21,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:21,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 08:33:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 08:33:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 26 states and 29 transitions. [2018-11-23 08:33:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 08:33:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 08:33:21,729 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 08:33:21,730 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 08:33:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:33:21,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:33:21,834 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:33:21,834 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:33:21,835 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:33:21,836 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:33:21,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2018-11-23 08:33:21,925 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:33:21,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 49 treesize of output 48 [2018-11-23 08:33:21,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:33:21,950 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 11 treesize of output 9 [2018-11-23 08:33:21,950 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:33:21,966 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 08:33:21,971 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 4 [2018-11-23 08:33:21,972 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 08:33:21,974 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:33:21,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:33:21,989 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 08:33:21,990 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:71, output treesize:23 [2018-11-23 08:33:36,954 WARN L180 SmtUtils]: Spent 4.94 s on a formula simplification. DAG size of input: 4731 DAG size of output: 257 [2018-11-23 08:33:37,466 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 26 [2018-11-23 08:33:37,538 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:33:37,539 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:33:37,539 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:33:37,540 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:33:37,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2018-11-23 08:33:37,622 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_6 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_5|)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:219) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:210) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:142) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.createTraceCheck(CodeCheckObserver.java:624) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:454) 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 08:33:37,625 INFO L168 Benchmark]: Toolchain (without parser) took 17797.10 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 320.3 MB). Free memory was 950.8 MB in the beginning and 1.2 GB in the end (delta: -265.7 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2018-11-23 08:33:37,625 INFO L168 Benchmark]: CDTParser took 0.13 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 08:33:37,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.47 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.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 08:33:37,626 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.88 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:33:37,626 INFO L168 Benchmark]: Boogie Preprocessor took 69.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -201.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:33:37,627 INFO L168 Benchmark]: RCFGBuilder took 388.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. [2018-11-23 08:33:37,627 INFO L168 Benchmark]: CodeCheck took 17116.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -119.7 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. [2018-11-23 08:33:37,630 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_6 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_5|)) de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_6 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_5|)): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 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 191.47 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.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 28.88 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -201.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 388.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. * CodeCheck took 17116.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -119.7 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...