./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a_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_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/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 4284cb37841cd94fe17da64cc250a8a1e69c6375 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/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 4284cb37841cd94fe17da64cc250a8a1e69c6375 ........................................................................................................................................................................................................................................................................................................................... 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 03:18:37,350 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:18:37,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:18:37,358 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:18:37,358 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:18:37,359 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:18:37,360 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:18:37,361 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:18:37,362 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:18:37,362 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:18:37,363 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:18:37,363 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:18:37,364 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:18:37,364 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:18:37,365 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:18:37,366 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:18:37,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:18:37,368 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:18:37,369 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:18:37,371 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:18:37,371 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:18:37,372 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:18:37,374 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:18:37,374 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:18:37,374 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:18:37,375 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:18:37,375 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:18:37,376 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:18:37,376 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:18:37,377 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:18:37,377 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:18:37,378 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:18:37,378 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:18:37,378 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:18:37,380 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:18:37,380 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:18:37,380 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 03:18:37,389 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:18:37,389 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:18:37,389 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:18:37,390 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 03:18:37,390 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:18:37,390 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:18:37,390 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:18:37,391 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:18:37,391 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:18:37,391 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:18:37,391 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:18:37,391 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:18:37,391 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:18:37,391 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:18:37,391 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:18:37,391 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:18:37,391 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:18:37,392 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:18:37,392 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 03:18:37,392 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 03:18:37,392 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:18:37,392 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:18:37,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 03:18:37,392 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:18:37,392 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:18:37,393 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:18:37,393 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 03:18:37,393 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:18:37,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:18:37,393 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_5a34adec-47a9-40fd-bfd0-448af2372f42/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 -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2018-11-23 03:18:37,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:18:37,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:18:37,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:18:37,429 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:18:37,429 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:18:37,430 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1232a_true-unreach-call.c [2018-11-23 03:18:37,464 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/data/72b0fd1fe/0650c00ad36b4bcd803d84f43f8dfb88/FLAG8df3fdfe8 [2018-11-23 03:18:37,862 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:18:37,862 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/sv-benchmarks/c/float-newlib/double_req_bl_1232a_true-unreach-call.c [2018-11-23 03:18:37,868 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/data/72b0fd1fe/0650c00ad36b4bcd803d84f43f8dfb88/FLAG8df3fdfe8 [2018-11-23 03:18:37,878 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/data/72b0fd1fe/0650c00ad36b4bcd803d84f43f8dfb88 [2018-11-23 03:18:37,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:18:37,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:18:37,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:18:37,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:18:37,884 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:18:37,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:18:37" (1/1) ... [2018-11-23 03:18:37,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bf86f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:37, skipping insertion in model container [2018-11-23 03:18:37,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:18:37" (1/1) ... [2018-11-23 03:18:37,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:18:37,906 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:18:38,024 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:18:38,026 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:18:38,045 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:18:38,059 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:18:38,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:38 WrapperNode [2018-11-23 03:18:38,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:18:38,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:18:38,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:18:38,060 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:18:38,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:38" (1/1) ... [2018-11-23 03:18:38,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:38" (1/1) ... [2018-11-23 03:18:38,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:18:38,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:18:38,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:18:38,128 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:18:38,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:38" (1/1) ... [2018-11-23 03:18:38,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:38" (1/1) ... [2018-11-23 03:18:38,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:38" (1/1) ... [2018-11-23 03:18:38,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:38" (1/1) ... [2018-11-23 03:18:38,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:38" (1/1) ... [2018-11-23 03:18:38,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:38" (1/1) ... [2018-11-23 03:18:38,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:38" (1/1) ... [2018-11-23 03:18:38,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:18:38,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:18:38,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:18:38,151 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:18:38,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/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 03:18:38,190 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 03:18:38,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 03:18:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 03:18:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:18:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:18:38,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:18:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:18:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:18:38,523 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:18:38,523 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 03:18:38,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:18:38 BoogieIcfgContainer [2018-11-23 03:18:38,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:18:38,524 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 03:18:38,524 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 03:18:38,531 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 03:18:38,531 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:18:38" (1/1) ... [2018-11-23 03:18:38,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:18:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:18:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 21 states and 28 transitions. [2018-11-23 03:18:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2018-11-23 03:18:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 03:18:38,567 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:18:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:18:38,644 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 03:18:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:18:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 21 states and 25 transitions. [2018-11-23 03:18:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-23 03:18:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 03:18:38,652 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:18:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:18:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:18:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:18:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:18:38,757 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 := 0.0;main_~y~0 := ~someUnaryDOUBLEoperation(0.0);fmin_double_#in~x, fmin_double_#in~y := main_~x~0, main_~y~0;havoc fmin_double_#res;havoc fmin_double_#t~ret4, fmin_double_#t~ret5, fmin_double_#t~ite6, fmin_double_~x, fmin_double_~y;fmin_double_~x := fmin_double_#in~x;fmin_double_~y := fmin_double_#in~y; VAL [ULTIMATE.start_fmin_double_~x=0.0, ULTIMATE.start_fmin_double_~y=1.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_main_~y~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fmin_double_#in~x|=0.0, |ULTIMATE.start_fmin_double_#in~y|=1.0] [?] CALL call fmin_double_#t~ret4 := __fpclassify_double(fmin_double_~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.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~union1;havoc #t~mem0;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~union3;havoc #t~mem2;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=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0] [?] goto; VAL [__fpclassify_double_~lsw~0=10, __fpclassify_double_~msw~0=2146435073, __fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.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=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0, |__fpclassify_double_#res|=0] [?] RET #88#return; VAL [ULTIMATE.start_fmin_double_~x=0.0, ULTIMATE.start_fmin_double_~y=1.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_main_~y~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fmin_double_#in~x|=0.0, |ULTIMATE.start_fmin_double_#in~y|=1.0, |ULTIMATE.start_fmin_double_#t~ret4|=0] [?] assume -2147483648 <= fmin_double_#t~ret4 && fmin_double_#t~ret4 <= 2147483647; VAL [ULTIMATE.start_fmin_double_~x=0.0, ULTIMATE.start_fmin_double_~y=1.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_main_~y~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fmin_double_#in~x|=0.0, |ULTIMATE.start_fmin_double_#in~y|=1.0, |ULTIMATE.start_fmin_double_#t~ret4|=0] [?] assume 0 == fmin_double_#t~ret4;havoc fmin_double_#t~ret4;fmin_double_#res := fmin_double_~y; VAL [ULTIMATE.start_fmin_double_~x=0.0, ULTIMATE.start_fmin_double_~y=1.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_main_~y~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fmin_double_#in~x|=0.0, |ULTIMATE.start_fmin_double_#in~y|=1.0, |ULTIMATE.start_fmin_double_#res|=1.0] [?] main_#t~ret9 := fmin_double_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9;main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [ULTIMATE.start_fmin_double_~x=0.0, ULTIMATE.start_fmin_double_~y=1.0, ULTIMATE.start_main_~res~0=1.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_main_~y~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fmin_double_#in~x|=0.0, |ULTIMATE.start_fmin_double_#in~y|=1.0, |ULTIMATE.start_fmin_double_#res|=1.0, |ULTIMATE.start_main_#t~short11|=false] [?] assume !main_#t~short11; VAL [ULTIMATE.start_fmin_double_~x=0.0, ULTIMATE.start_fmin_double_~y=1.0, ULTIMATE.start_main_~res~0=1.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_main_~y~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fmin_double_#in~x|=0.0, |ULTIMATE.start_fmin_double_#in~y|=1.0, |ULTIMATE.start_fmin_double_#res|=1.0, |ULTIMATE.start_main_#t~short11|=false] [?] assume !main_#t~short11;havoc main_#t~short11;havoc main_#t~ret10; VAL [ULTIMATE.start_fmin_double_~x=0.0, ULTIMATE.start_fmin_double_~y=1.0, ULTIMATE.start_main_~res~0=1.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_main_~y~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fmin_double_#in~x|=0.0, |ULTIMATE.start_fmin_double_#in~y|=1.0, |ULTIMATE.start_fmin_double_#res|=1.0] [?] assume !false; VAL [ULTIMATE.start_fmin_double_~x=0.0, ULTIMATE.start_fmin_double_~y=1.0, ULTIMATE.start_main_~res~0=1.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_main_~y~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fmin_double_#in~x|=0.0, |ULTIMATE.start_fmin_double_#in~y|=1.0, |ULTIMATE.start_fmin_double_#res|=1.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; [L74] main_~x~0 := 0.0; [L75] main_~y~0 := ~someUnaryDOUBLEoperation(0.0); [L76] fmin_double_#in~x, fmin_double_#in~y := main_~x~0, main_~y~0; [L76] havoc fmin_double_#res; [L76] havoc fmin_double_#t~ret4, fmin_double_#t~ret5, fmin_double_#t~ite6, fmin_double_~x, fmin_double_~y; [L45-L52] fmin_double_~x := fmin_double_#in~x; [L45-L52] fmin_double_~y := fmin_double_#in~y; VAL [#NULL.base=0, #NULL.offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~x~0=0.0, main_~y~0=1.0] [L46] CALL call fmin_double_#t~ret4 := __fpclassify_double(fmin_double_~x); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~x=0.0] [L22] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L23] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L24] ~msw~0 := #t~mem0; [L24] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] havoc #t~union1; [L24] havoc #t~mem0; [L25] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L25] ~lsw~0 := #t~mem2; [L25] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L22] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=10, ~msw~0=2146435073, ~x=0.0] [L28-L42] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L31-L42] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); [L34-L42] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); [L38-L42] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L42] #res := 0; [L18-L43] ensures true; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=10, ~msw~0=2146435073, ~x=0.0] [L46] RET call fmin_double_#t~ret4 := __fpclassify_double(fmin_double_~x); VAL [#NULL.base=0, #NULL.offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#t~ret4=0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~x~0=0.0, main_~y~0=1.0] [L46] assume -2147483648 <= fmin_double_#t~ret4 && fmin_double_#t~ret4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#t~ret4=0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~x~0=0.0, main_~y~0=1.0] [L46-L47] assume 0 == fmin_double_#t~ret4; [L46] havoc fmin_double_#t~ret4; [L47] fmin_double_#res := fmin_double_~y; VAL [#NULL.base=0, #NULL.offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~x~0=0.0, main_~y~0=1.0] [L76] main_#t~ret9 := fmin_double_#res; [L76] main_~res~0 := main_#t~ret9; [L76] havoc main_#t~ret9; [L79] main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_#t~short11=false, main_~res~0=1.0, main_~x~0=0.0, main_~y~0=1.0] [L79] assume !main_#t~short11; VAL [#NULL.base=0, #NULL.offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_#t~short11=false, main_~res~0=1.0, main_~x~0=0.0, main_~y~0=1.0] [L79-L82] assume !main_#t~short11; [L79] havoc main_#t~short11; [L79] havoc main_#t~ret10; VAL [#NULL.base=0, #NULL.offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~res~0=1.0, main_~x~0=0.0, main_~y~0=1.0] [L80] assert false; VAL [#NULL.base=0, #NULL.offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~res~0=1.0, main_~x~0=0.0, main_~y~0=1.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; [L74] main_~x~0 := 0.0; [L75] main_~y~0 := ~someUnaryDOUBLEoperation(0.0); [L76] fmin_double_#in~x, fmin_double_#in~y := main_~x~0, main_~y~0; [L76] havoc fmin_double_#res; [L76] havoc fmin_double_#t~ret4, fmin_double_#t~ret5, fmin_double_#t~ite6, fmin_double_~x, fmin_double_~y; [L45-L52] fmin_double_~x := fmin_double_#in~x; [L45-L52] fmin_double_~y := fmin_double_#in~y; VAL [#NULL.base=0, #NULL.offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~x~0=0.0, main_~y~0=1.0] [L46] CALL call fmin_double_#t~ret4 := __fpclassify_double(fmin_double_~x); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~x=0.0] [L22] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L23] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L24] ~msw~0 := #t~mem0; [L24] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] havoc #t~union1; [L24] havoc #t~mem0; [L25] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L25] ~lsw~0 := #t~mem2; [L25] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L22] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=10, ~msw~0=2146435073, ~x=0.0] [L28-L42] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L31-L42] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); [L34-L42] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); [L38-L42] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L42] #res := 0; [L18-L43] ensures true; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=10, ~msw~0=2146435073, ~x=0.0] [L46] RET call fmin_double_#t~ret4 := __fpclassify_double(fmin_double_~x); VAL [#NULL.base=0, #NULL.offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#t~ret4=0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~x~0=0.0, main_~y~0=1.0] [L46] assume -2147483648 <= fmin_double_#t~ret4 && fmin_double_#t~ret4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#t~ret4=0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~x~0=0.0, main_~y~0=1.0] [L46-L47] assume 0 == fmin_double_#t~ret4; [L46] havoc fmin_double_#t~ret4; [L47] fmin_double_#res := fmin_double_~y; VAL [#NULL.base=0, #NULL.offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~x~0=0.0, main_~y~0=1.0] [L76] main_#t~ret9 := fmin_double_#res; [L76] main_~res~0 := main_#t~ret9; [L76] havoc main_#t~ret9; [L79] main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_#t~short11=false, main_~res~0=1.0, main_~x~0=0.0, main_~y~0=1.0] [L79] assume !main_#t~short11; VAL [#NULL.base=0, #NULL.offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_#t~short11=false, main_~res~0=1.0, main_~x~0=0.0, main_~y~0=1.0] [L79-L82] assume !main_#t~short11; [L79] havoc main_#t~short11; [L79] havoc main_#t~ret10; VAL [#NULL.base=0, #NULL.offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~res~0=1.0, main_~x~0=0.0, main_~y~0=1.0] [L80] assert false; VAL [#NULL.base=0, #NULL.offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~res~0=1.0, main_~x~0=0.0, main_~y~0=1.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; [L74] main_~x~0 := 0.0; [L75] main_~y~0 := ~someUnaryDOUBLEoperation(0.0); [L76] fmin_double_#in~x, fmin_double_#in~y := main_~x~0, main_~y~0; [L76] havoc fmin_double_#res; [L76] havoc fmin_double_#t~ret4, fmin_double_#t~ret5, fmin_double_#t~ite6, fmin_double_~x, fmin_double_~y; [L45-L52] fmin_double_~x := fmin_double_#in~x; [L45-L52] fmin_double_~y := fmin_double_#in~y; VAL [#NULL!base=0, #NULL!offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~x~0=0.0, main_~y~0=1.0] [L46] CALL call fmin_double_#t~ret4 := __fpclassify_double(fmin_double_~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~x=0.0] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L23] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~union1; [L24] havoc #t~mem0; [L25] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=10, ~msw~0=2146435073, ~x=0.0] [L28-L29] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L31-L32] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) [L34-L35] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) [L38-L39] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L42] #res := 0; [L46] RET call fmin_double_#t~ret4 := __fpclassify_double(fmin_double_~x); VAL [#NULL!base=0, #NULL!offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#t~ret4=0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~x~0=0.0, main_~y~0=1.0] [L46] assume -2147483648 <= fmin_double_#t~ret4 && fmin_double_#t~ret4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#t~ret4=0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~x~0=0.0, main_~y~0=1.0] [L46] COND TRUE 0 == fmin_double_#t~ret4 [L46] havoc fmin_double_#t~ret4; [L47] fmin_double_#res := fmin_double_~y; VAL [#NULL!base=0, #NULL!offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~x~0=0.0, main_~y~0=1.0] [L76] main_#t~ret9 := fmin_double_#res; [L76] main_~res~0 := main_#t~ret9; [L76] havoc main_#t~ret9; [L79] main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_#t~short11=false, main_~res~0=1.0, main_~x~0=0.0, main_~y~0=1.0] [L79] COND FALSE !(main_#t~short11) VAL [#NULL!base=0, #NULL!offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_#t~short11=false, main_~res~0=1.0, main_~x~0=0.0, main_~y~0=1.0] [L79] COND TRUE !main_#t~short11 [L79] havoc main_#t~short11; [L79] havoc main_#t~ret10; VAL [#NULL!base=0, #NULL!offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~res~0=1.0, main_~x~0=0.0, main_~y~0=1.0] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~res~0=1.0, main_~x~0=0.0, main_~y~0=1.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; [L74] main_~x~0 := 0.0; [L75] main_~y~0 := ~someUnaryDOUBLEoperation(0.0); [L76] fmin_double_#in~x, fmin_double_#in~y := main_~x~0, main_~y~0; [L76] havoc fmin_double_#res; [L76] havoc fmin_double_#t~ret4, fmin_double_#t~ret5, fmin_double_#t~ite6, fmin_double_~x, fmin_double_~y; [L45-L52] fmin_double_~x := fmin_double_#in~x; [L45-L52] fmin_double_~y := fmin_double_#in~y; VAL [#NULL!base=0, #NULL!offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~x~0=0.0, main_~y~0=1.0] [L46] CALL call fmin_double_#t~ret4 := __fpclassify_double(fmin_double_~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~x=0.0] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L23] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~union1; [L24] havoc #t~mem0; [L25] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=10, ~msw~0=2146435073, ~x=0.0] [L28-L29] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L31-L32] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) [L34-L35] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) [L38-L39] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L42] #res := 0; [L46] RET call fmin_double_#t~ret4 := __fpclassify_double(fmin_double_~x); VAL [#NULL!base=0, #NULL!offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#t~ret4=0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~x~0=0.0, main_~y~0=1.0] [L46] assume -2147483648 <= fmin_double_#t~ret4 && fmin_double_#t~ret4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#t~ret4=0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~x~0=0.0, main_~y~0=1.0] [L46] COND TRUE 0 == fmin_double_#t~ret4 [L46] havoc fmin_double_#t~ret4; [L47] fmin_double_#res := fmin_double_~y; VAL [#NULL!base=0, #NULL!offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~x~0=0.0, main_~y~0=1.0] [L76] main_#t~ret9 := fmin_double_#res; [L76] main_~res~0 := main_#t~ret9; [L76] havoc main_#t~ret9; [L79] main_#t~short11 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_#t~short11=false, main_~res~0=1.0, main_~x~0=0.0, main_~y~0=1.0] [L79] COND FALSE !(main_#t~short11) VAL [#NULL!base=0, #NULL!offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_#t~short11=false, main_~res~0=1.0, main_~x~0=0.0, main_~y~0=1.0] [L79] COND TRUE !main_#t~short11 [L79] havoc main_#t~short11; [L79] havoc main_#t~ret10; VAL [#NULL!base=0, #NULL!offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~res~0=1.0, main_~x~0=0.0, main_~y~0=1.0] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, fmin_double_#in~x=0.0, fmin_double_#in~y=1.0, fmin_double_#res=1.0, fmin_double_~x=0.0, fmin_double_~y=1.0, main_~res~0=1.0, main_~x~0=0.0, main_~y~0=1.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L74] ~x~0 := 0.0; [L75] ~y~0 := ~someUnaryDOUBLEoperation(0.0); [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#NULL!base=0, #NULL!offset=0] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~x=0.0] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L23] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~union1; [L24] havoc #t~mem0; [L25] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=10, ~msw~0=2146435073, ~x=0.0] [L28-L29] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L31-L32] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) [L34-L35] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) [L38-L39] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L42] #res := 0; [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#NULL!base=0, #NULL!offset=0] [L46] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L46] COND TRUE 0 == #t~ret4 [L46] havoc #t~ret4; [L47] #res := ~y; VAL [#NULL!base=0, #NULL!offset=0] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0] [L79] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L74] ~x~0 := 0.0; [L75] ~y~0 := ~someUnaryDOUBLEoperation(0.0); [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#NULL!base=0, #NULL!offset=0] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~x=0.0] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L23] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~union1; [L24] havoc #t~mem0; [L25] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~union3; [L25] havoc #t~mem2; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=10, ~msw~0=2146435073, ~x=0.0] [L28-L29] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L31-L32] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) [L34-L35] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) [L38-L39] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L42] #res := 0; [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#NULL!base=0, #NULL!offset=0] [L46] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L46] COND TRUE 0 == #t~ret4 [L46] havoc #t~ret4; [L47] #res := ~y; VAL [#NULL!base=0, #NULL!offset=0] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0] [L79] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L74] double x = 0.0; [L75] double y = -0.0; [L46] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0] [L19] __uint32_t msw, lsw; VAL [\old(x)=0, x=0] [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L31-L32] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L34-L35] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L38-L39] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L42] return 0; [L46] RET, EXPR __fpclassify_double(x) [L46] COND TRUE __fpclassify_double(x) == 0 [L47] return y; [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() ----- [2018-11-23 03:18:38,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 03:18:38 ImpRootNode [2018-11-23 03:18:38,802 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 03:18:38,802 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:18:38,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:18:38,802 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:18:38,803 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:18:38" (3/4) ... [2018-11-23 03:18:38,806 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:18:38,806 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:18:38,807 INFO L168 Benchmark]: Toolchain (without parser) took 926.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 953.1 MB in the beginning and 1.1 GB in the end (delta: -122.6 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:18:38,808 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:18:38,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.45 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 939.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:18:38,809 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -194.6 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 03:18:38,809 INFO L168 Benchmark]: Boogie Preprocessor took 23.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:18:38,810 INFO L168 Benchmark]: RCFGBuilder took 372.53 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.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:18:38,810 INFO L168 Benchmark]: CodeCheck took 278.09 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: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:18:38,811 INFO L168 Benchmark]: Witness Printer took 3.96 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 03:18:38,814 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: 80]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someUnaryDOUBLEoperation at line 75. Possible FailurePath: [L74] double x = 0.0; [L75] double y = -0.0; [L46] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0] [L19] __uint32_t msw, lsw; VAL [\old(x)=0, x=0] [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L31-L32] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L34-L35] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L38-L39] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L42] return 0; [L46] RET, EXPR __fpclassify_double(x) [L46] COND TRUE __fpclassify_double(x) == 0 [L47] return y; [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.45 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 939.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -194.6 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 372.53 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.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * CodeCheck took 278.09 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: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.96 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 03:18:40,199 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:18:40,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:18:40,209 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:18:40,209 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:18:40,209 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:18:40,210 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:18:40,211 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:18:40,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:18:40,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:18:40,214 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:18:40,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:18:40,214 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:18:40,215 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:18:40,216 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:18:40,216 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:18:40,217 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:18:40,218 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:18:40,219 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:18:40,220 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:18:40,221 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:18:40,222 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:18:40,223 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:18:40,224 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:18:40,224 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:18:40,224 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:18:40,225 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:18:40,226 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:18:40,226 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:18:40,227 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:18:40,227 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:18:40,227 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:18:40,228 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:18:40,228 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:18:40,228 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:18:40,229 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:18:40,229 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 03:18:40,240 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:18:40,240 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:18:40,241 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:18:40,241 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 03:18:40,241 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:18:40,241 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:18:40,241 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:18:40,242 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:18:40,242 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:18:40,242 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:18:40,242 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:18:40,242 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:18:40,242 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:18:40,242 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 03:18:40,242 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 03:18:40,243 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:18:40,243 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:18:40,243 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:18:40,243 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:18:40,243 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 03:18:40,243 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 03:18:40,243 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:18:40,243 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:18:40,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 03:18:40,244 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:18:40,244 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:18:40,244 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:18:40,244 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 03:18:40,244 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 03:18:40,244 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:18:40,244 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 03:18:40,245 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 03:18:40,245 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_5a34adec-47a9-40fd-bfd0-448af2372f42/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 -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2018-11-23 03:18:40,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:18:40,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:18:40,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:18:40,282 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:18:40,283 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:18:40,283 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1232a_true-unreach-call.c [2018-11-23 03:18:40,318 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/data/361cb43e5/cdf1256e3f254e6796042b0b863e4160/FLAG84cf9512c [2018-11-23 03:18:40,715 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:18:40,716 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/sv-benchmarks/c/float-newlib/double_req_bl_1232a_true-unreach-call.c [2018-11-23 03:18:40,720 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/data/361cb43e5/cdf1256e3f254e6796042b0b863e4160/FLAG84cf9512c [2018-11-23 03:18:40,729 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/bin-2019/ukojak/data/361cb43e5/cdf1256e3f254e6796042b0b863e4160 [2018-11-23 03:18:40,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:18:40,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:18:40,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:18:40,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:18:40,735 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:18:40,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:18:40" (1/1) ... [2018-11-23 03:18:40,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249f8fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:40, skipping insertion in model container [2018-11-23 03:18:40,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:18:40" (1/1) ... [2018-11-23 03:18:40,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:18:40,763 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:18:40,896 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:18:40,900 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:18:40,921 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:18:40,940 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:18:40,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:40 WrapperNode [2018-11-23 03:18:40,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:18:40,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:18:40,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:18:40,941 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:18:40,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:40" (1/1) ... [2018-11-23 03:18:40,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:40" (1/1) ... [2018-11-23 03:18:40,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:18:40,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:18:40,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:18:40,971 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:18:40,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:40" (1/1) ... [2018-11-23 03:18:40,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:40" (1/1) ... [2018-11-23 03:18:41,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:40" (1/1) ... [2018-11-23 03:18:41,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:40" (1/1) ... [2018-11-23 03:18:41,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:40" (1/1) ... [2018-11-23 03:18:41,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:40" (1/1) ... [2018-11-23 03:18:41,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:40" (1/1) ... [2018-11-23 03:18:41,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:18:41,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:18:41,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:18:41,041 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:18:41,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:18:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a34adec-47a9-40fd-bfd0-448af2372f42/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 03:18:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 03:18:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 03:18:41,075 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 03:18:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:18:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 03:18:41,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:18:41,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:18:41,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:18:41,176 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:18:41,259 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:18:41,414 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:18:41,415 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 03:18:41,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:18:41 BoogieIcfgContainer [2018-11-23 03:18:41,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:18:41,415 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 03:18:41,416 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 03:18:41,422 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 03:18:41,422 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:18:41" (1/1) ... [2018-11-23 03:18:41,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:18:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:18:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 20 states and 27 transitions. [2018-11-23 03:18:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-11-23 03:18:41,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 03:18:41,458 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:18:41,491 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 03:18:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:18:41,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:18:41,532 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 03:18:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:18:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 20 states and 24 transitions. [2018-11-23 03:18:41,539 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2018-11-23 03:18:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 03:18:41,540 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:18:41,541 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 03:18:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:18:41,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:18:41,595 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 03:18:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:18:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 22 states and 27 transitions. [2018-11-23 03:18:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2018-11-23 03:18:41,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 03:18:41,685 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:18:41,686 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 03:18:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:18:41,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:18:41,704 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 03:18:41,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:18:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 22 states and 25 transitions. [2018-11-23 03:18:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 03:18:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 03:18:41,712 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:18:41,713 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 03:18:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:18:41,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:18:41,811 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:18:41,815 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:18:41,820 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 03:18:41,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:18:41,859 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:18:41,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-11-23 03:18:41,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:18:41,875 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 03:18:41,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:18:41,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-23 03:18:41,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 03:18:41,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:18:41,888 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 03:18:41,893 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 03:18:41,894 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:15 [2018-11-23 03:18:41,933 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 03:18:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:18:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 27 states and 31 transitions. [2018-11-23 03:18:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 03:18:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 03:18:42,211 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:18:42,212 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 03:18:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:18:42,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:18:42,351 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 03:18:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:18:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 26 states and 29 transitions. [2018-11-23 03:18:42,659 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 03:18:42,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 03:18:42,659 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:18:42,660 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 03:18:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:18:42,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:18:42,766 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:18:42,766 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:18:42,767 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:18:42,767 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:18:42,768 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 03:18:42,852 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:18:42,853 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 03:18:42,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:18:42,882 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 27 treesize of output 21 [2018-11-23 03:18:42,883 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 03:18:42,895 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 8 treesize of output 6 [2018-11-23 03:18:42,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 03:18:42,898 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 03:18:42,900 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:18:42,906 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 03:18:42,918 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 03:18:42,918 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:71, output treesize:28 [2018-11-23 03:18:55,230 WARN L180 SmtUtils]: Spent 3.99 s on a formula simplification. DAG size of input: 5082 DAG size of output: 282 [2018-11-23 03:18:55,573 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:18:55,574 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:18:55,575 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:18:55,579 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:18:55,580 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 03:18:55,649 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 03:18:55,652 INFO L168 Benchmark]: Toolchain (without parser) took 14920.18 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.3 MB). Free memory was 951.8 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 103.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:18:55,653 INFO L168 Benchmark]: CDTParser took 0.12 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 03:18:55,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.91 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 935.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 03:18:55,653 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.55 ms. Allocated memory is still 1.0 GB. Free memory is still 935.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:18:55,654 INFO L168 Benchmark]: Boogie Preprocessor took 69.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:18:55,654 INFO L168 Benchmark]: RCFGBuilder took 374.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:18:55,655 INFO L168 Benchmark]: CodeCheck took 14235.96 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -71.3 MB). Peak memory consumption was 106.5 MB. Max. memory is 11.5 GB. [2018-11-23 03:18:55,657 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.12 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 207.91 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 935.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 29.55 ms. Allocated memory is still 1.0 GB. Free memory is still 935.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 374.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * CodeCheck took 14235.96 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -71.3 MB). Peak memory consumption was 106.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...