./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1231b_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_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1231b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c714d208cb0b1f96f572e8a6108248eb76c73a94 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1231b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c714d208cb0b1f96f572e8a6108248eb76c73a94 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_2|)) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:13:03,416 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:13:03,417 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:13:03,425 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:13:03,425 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:13:03,426 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:13:03,427 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:13:03,429 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:13:03,430 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:13:03,431 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:13:03,432 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:13:03,432 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:13:03,433 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:13:03,433 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:13:03,434 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:13:03,435 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:13:03,435 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:13:03,437 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:13:03,438 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:13:03,439 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:13:03,440 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:13:03,441 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:13:03,443 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:13:03,443 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:13:03,444 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:13:03,444 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:13:03,445 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:13:03,446 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:13:03,447 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:13:03,447 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:13:03,448 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:13:03,448 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:13:03,448 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:13:03,448 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:13:03,449 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:13:03,451 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:13:03,451 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:13:03,461 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:13:03,462 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:13:03,462 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:13:03,462 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:13:03,463 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:13:03,463 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:13:03,463 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:13:03,463 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:13:03,463 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:13:03,464 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:13:03,464 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:13:03,464 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:13:03,464 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:13:03,464 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:13:03,464 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:13:03,464 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:13:03,465 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:13:03,465 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:13:03,465 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:13:03,465 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:13:03,465 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:13:03,465 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:13:03,465 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:13:03,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:13:03,466 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:13:03,466 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:13:03,466 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:13:03,466 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:13:03,466 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:13:03,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:13:03,467 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_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer 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 -> Automizer 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 -> c714d208cb0b1f96f572e8a6108248eb76c73a94 [2018-11-23 12:13:03,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:13:03,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:13:03,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:13:03,504 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:13:03,504 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:13:03,504 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1231b_true-unreach-call.c [2018-11-23 12:13:03,548 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/data/2d77919a3/0ed004ab30584e46afc65b0400005f63/FLAGc7373bf98 [2018-11-23 12:13:03,880 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:13:03,881 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/sv-benchmarks/c/float-newlib/double_req_bl_1231b_true-unreach-call.c [2018-11-23 12:13:03,885 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/data/2d77919a3/0ed004ab30584e46afc65b0400005f63/FLAGc7373bf98 [2018-11-23 12:13:04,308 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/data/2d77919a3/0ed004ab30584e46afc65b0400005f63 [2018-11-23 12:13:04,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:13:04,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:13:04,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:13:04,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:13:04,313 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:13:04,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:13:04" (1/1) ... [2018-11-23 12:13:04,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548675f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:04, skipping insertion in model container [2018-11-23 12:13:04,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:13:04" (1/1) ... [2018-11-23 12:13:04,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:13:04,333 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:13:04,452 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:13:04,454 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:13:04,468 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:13:04,481 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:13:04,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:04 WrapperNode [2018-11-23 12:13:04,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:13:04,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:13:04,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:13:04,482 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:13:04,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:04" (1/1) ... [2018-11-23 12:13:04,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:04" (1/1) ... [2018-11-23 12:13:04,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:13:04,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:13:04,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:13:04,500 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:13:04,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:04" (1/1) ... [2018-11-23 12:13:04,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:04" (1/1) ... [2018-11-23 12:13:04,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:04" (1/1) ... [2018-11-23 12:13:04,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:04" (1/1) ... [2018-11-23 12:13:04,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:04" (1/1) ... [2018-11-23 12:13:04,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:04" (1/1) ... [2018-11-23 12:13:04,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:04" (1/1) ... [2018-11-23 12:13:04,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:13:04,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:13:04,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:13:04,556 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:13:04,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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:2000 [2018-11-23 12:13:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 12:13:04,593 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 12:13:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:13:04,593 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:13:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 12:13:04,594 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 12:13:04,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:13:04,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:13:04,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 12:13:04,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:13:04,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:13:04,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:13:04,594 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-11-23 12:13:04,595 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-11-23 12:13:04,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:13:04,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:13:04,758 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:13:04,759 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:13:04,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:13:04 BoogieIcfgContainer [2018-11-23 12:13:04,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:13:04,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:13:04,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:13:04,763 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:13:04,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:13:04" (1/3) ... [2018-11-23 12:13:04,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3435cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:13:04, skipping insertion in model container [2018-11-23 12:13:04,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:04" (2/3) ... [2018-11-23 12:13:04,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3435cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:13:04, skipping insertion in model container [2018-11-23 12:13:04,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:13:04" (3/3) ... [2018-11-23 12:13:04,766 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b_true-unreach-call.c [2018-11-23 12:13:04,774 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:13:04,784 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:13:04,798 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:13:04,824 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:13:04,824 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:13:04,824 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:13:04,825 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:13:04,825 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:13:04,825 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:13:04,825 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:13:04,825 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:13:04,825 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:13:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 12:13:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:13:04,845 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:04,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:13:04,847 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:04,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:04,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1977344027, now seen corresponding path program 1 times [2018-11-23 12:13:04,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:04,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:04,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:04,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:04,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:13:04,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:04,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:13:04,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:13:04,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:13:04,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:13:04,975 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 12:13:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:04,989 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2018-11-23 12:13:04,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:13:04,990 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 12:13:04,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:04,997 INFO L225 Difference]: With dead ends: 69 [2018-11-23 12:13:04,998 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:13:05,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:13:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:13:05,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 12:13:05,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:13:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-23 12:13:05,029 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 27 [2018-11-23 12:13:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:05,029 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-23 12:13:05,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:13:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 12:13:05,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:13:05,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:05,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:13:05,031 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:05,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:05,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1791139434, now seen corresponding path program 1 times [2018-11-23 12:13:05,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:05,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:05,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:05,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:05,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:05,094 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 12:13:05,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:05,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:13:05,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:05,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:05,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:05,097 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 4 states. [2018-11-23 12:13:05,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:05,135 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-23 12:13:05,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:13:05,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 12:13:05,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:05,137 INFO L225 Difference]: With dead ends: 47 [2018-11-23 12:13:05,137 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:13:05,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:13:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 12:13:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:13:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 12:13:05,145 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2018-11-23 12:13:05,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:05,145 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 12:13:05,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:05,145 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 12:13:05,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:13:05,146 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:05,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:13:05,146 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:05,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:05,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1399464020, now seen corresponding path program 1 times [2018-11-23 12:13:05,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:05,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:05,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:05,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:05,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:05,201 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 12:13:05,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:05,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:13:05,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:05,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:05,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:05,203 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 4 states. [2018-11-23 12:13:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:05,228 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2018-11-23 12:13:05,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:13:05,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-23 12:13:05,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:05,229 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:13:05,229 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:13:05,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:05,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:13:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-11-23 12:13:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:13:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 12:13:05,234 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 31 [2018-11-23 12:13:05,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:05,235 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 12:13:05,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 12:13:05,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:13:05,235 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:05,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:13:05,236 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:05,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:05,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1202950515, now seen corresponding path program 1 times [2018-11-23 12:13:05,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:13:05,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:13:05,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:05,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:05,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:13:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:13:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:13:05,282 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=4294967304, |#NULL.offset|=4294967298, |old(#NULL.base)|=4294967304, |old(#NULL.offset)|=4294967298] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4294967304, |old(#NULL.offset)|=4294967298] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4294967304, |old(#NULL.offset)|=4294967298] [?] RET #78#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := #t~nondet7;havoc #t~nondet7;~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [main_~x~0=4294967301.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret8 := isnan_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=4294967301.0] [?] ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_double_~x=4294967301.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=4294967301.0, |isnan_double_#res|=0] [?] assume true; VAL [isnan_double_~x=4294967301.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=4294967301.0, |isnan_double_#res|=0] [?] RET #82#return; VAL [main_~x~0=4294967301.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [main_~x~0=4294967301.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0] [?] assume 0 == #t~ret8;havoc #t~ret8; VAL [main_~x~0=4294967301.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4294967301.0, |fmin_double_#in~y|=4294967300.0] [?] ~x := #in~x;~y := #in~y; VAL [fmin_double_~x=4294967301.0, fmin_double_~y=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4294967301.0, |fmin_double_#in~y|=4294967300.0] [?] CALL call #t~ret4 := __fpclassify_double(~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967301.0] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=4294967301.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967301.0] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=2146435073, __fpclassify_double_~x=4294967301.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967301.0] [?] goto; VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=2146435073, __fpclassify_double_~x=4294967301.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967301.0] [?] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=2146435073, __fpclassify_double_~x=4294967301.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967301.0] [?] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=2146435073, __fpclassify_double_~x=4294967301.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967301.0] [?] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=2146435073, __fpclassify_double_~x=4294967301.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967301.0] [?] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296));#res := 0; VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=2146435073, __fpclassify_double_~x=4294967301.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967301.0, |__fpclassify_double_#res|=0] [?] assume true; VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=2146435073, __fpclassify_double_~x=4294967301.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967301.0, |__fpclassify_double_#res|=0] [?] RET #86#return; VAL [fmin_double_~x=4294967301.0, fmin_double_~y=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4294967301.0, |fmin_double_#in~y|=4294967300.0, |fmin_double_#t~ret4|=0] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [fmin_double_~x=4294967301.0, fmin_double_~y=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4294967301.0, |fmin_double_#in~y|=4294967300.0, |fmin_double_#t~ret4|=0] [?] assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; VAL [fmin_double_~x=4294967301.0, fmin_double_~y=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4294967301.0, |fmin_double_#in~y|=4294967300.0, |fmin_double_#res|=4294967300.0] [?] assume true; VAL [fmin_double_~x=4294967301.0, fmin_double_~y=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=4294967301.0, |fmin_double_#in~y|=4294967300.0, |fmin_double_#res|=4294967300.0] [?] RET #84#return; VAL [main_~x~0=4294967301.0, main_~y~0=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret9|=4294967300.0] [?] ~res~0 := #t~ret9;havoc #t~ret9; VAL [main_~res~0=4294967300.0, main_~x~0=4294967301.0, main_~y~0=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); VAL [main_~res~0=4294967300.0, main_~x~0=4294967301.0, main_~y~0=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=4294967300.0, main_~x~0=4294967301.0, main_~y~0=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4294967304, #NULL.offset=4294967298, old(#NULL.base)=4294967304, old(#NULL.offset)=4294967298] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967304, old(#NULL.offset)=4294967298] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967304, old(#NULL.offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L60] ~x~0 := #t~nondet7; [L60] havoc #t~nondet7; [L61] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~x~0=4.294967301E9] [L62] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.294967301E9] [L16] ensures true; VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.294967301E9] [L62] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~x~0=4.294967301E9] [L62] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~x~0=4.294967301E9] [L62-L71] assume 0 == #t~ret8; [L62] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=4.294967301E9] [L64] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL.base=0, #NULL.offset=0] [L44-L51] ~x := #in~x; [L44-L51] ~y := #in~y; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL.base=0, #NULL.offset=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0] [L17-L42] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~lsw~0; VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, ~x=4.294967301E9] [L21] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L22] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L23] ~msw~0 := #t~mem0; [L23] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L24] ~lsw~0 := #t~mem2; [L24] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] havoc #t~mem2; [L24] havoc #t~union3; [L21] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L21] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L27-L41] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L30-L41] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L33-L41] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L37-L41] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L41] #res := 0; VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L17-L42] ensures true; VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L45] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45-L46] assume 0 == #t~ret4; [L45] havoc #t~ret4; [L46] #res := ~y; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL.base=0, #NULL.offset=0, #res=4.2949673E9, ~x=4.294967301E9, ~y=4.2949673E9] [L44-L51] ensures true; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL.base=0, #NULL.offset=0, #res=4.2949673E9, ~x=4.294967301E9, ~y=4.2949673E9] [L64] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L64] ~res~0 := #t~ret9; [L64] havoc #t~ret9; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L67-L70] assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L68] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4294967304, #NULL.offset=4294967298, old(#NULL.base)=4294967304, old(#NULL.offset)=4294967298] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967304, old(#NULL.offset)=4294967298] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967304, old(#NULL.offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L60] ~x~0 := #t~nondet7; [L60] havoc #t~nondet7; [L61] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~x~0=4.294967301E9] [L62] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.294967301E9] [L16] ensures true; VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.294967301E9] [L62] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~x~0=4.294967301E9] [L62] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~x~0=4.294967301E9] [L62-L71] assume 0 == #t~ret8; [L62] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=4.294967301E9] [L64] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL.base=0, #NULL.offset=0] [L44-L51] ~x := #in~x; [L44-L51] ~y := #in~y; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL.base=0, #NULL.offset=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0] [L17-L42] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~lsw~0; VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, ~x=4.294967301E9] [L21] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L22] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L23] ~msw~0 := #t~mem0; [L23] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L24] ~lsw~0 := #t~mem2; [L24] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] havoc #t~mem2; [L24] havoc #t~union3; [L21] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L21] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L27-L41] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L30-L41] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L33-L41] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L37-L41] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L41] #res := 0; VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L17-L42] ensures true; VAL [#in~x=4.294967301E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L45] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45-L46] assume 0 == #t~ret4; [L45] havoc #t~ret4; [L46] #res := ~y; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL.base=0, #NULL.offset=0, #res=4.2949673E9, ~x=4.294967301E9, ~y=4.2949673E9] [L44-L51] ensures true; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL.base=0, #NULL.offset=0, #res=4.2949673E9, ~x=4.294967301E9, ~y=4.2949673E9] [L64] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L64] ~res~0 := #t~ret9; [L64] havoc #t~ret9; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L67-L70] assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L68] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967304, #NULL!offset=4294967298, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L60] ~x~0 := #t~nondet7; [L60] havoc #t~nondet7; [L61] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~x~0=4.294967301E9] [L62] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.294967301E9] [L62] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~x~0=4.294967301E9] [L62] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~x~0=4.294967301E9] [L62] COND TRUE 0 == #t~ret8 [L62] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=4.294967301E9] [L64] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0] [L44-L51] ~x := #in~x; [L44-L51] ~y := #in~y; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0] [L17-L42] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~lsw~0; VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967301E9] [L21] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L22] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L23] ~msw~0 := #t~mem0; [L23] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L24] ~lsw~0 := #t~mem2; [L24] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~mem2; [L24] havoc #t~union3; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L27-L28] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L30-L31] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L33-L34] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L37-L38] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L41] #res := 0; VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L45] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45] COND TRUE 0 == #t~ret4 [L45] havoc #t~ret4; [L46] #res := ~y; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0, #res=4.2949673E9, ~x=4.294967301E9, ~y=4.2949673E9] [L64] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L64] ~res~0 := #t~ret9; [L64] havoc #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L67] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0) VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L68] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967304, #NULL!offset=4294967298, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L60] ~x~0 := #t~nondet7; [L60] havoc #t~nondet7; [L61] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~x~0=4.294967301E9] [L62] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.294967301E9] [L62] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~x~0=4.294967301E9] [L62] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~x~0=4.294967301E9] [L62] COND TRUE 0 == #t~ret8 [L62] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=4.294967301E9] [L64] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0] [L44-L51] ~x := #in~x; [L44-L51] ~y := #in~y; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0] [L17-L42] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~lsw~0; VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967301E9] [L21] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L22] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L23] ~msw~0 := #t~mem0; [L23] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L24] ~lsw~0 := #t~mem2; [L24] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~mem2; [L24] havoc #t~union3; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L27-L28] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L30-L31] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L33-L34] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L37-L38] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L41] #res := 0; VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L45] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45] COND TRUE 0 == #t~ret4 [L45] havoc #t~ret4; [L46] #res := ~y; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0, #res=4.2949673E9, ~x=4.294967301E9, ~y=4.2949673E9] [L64] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L64] ~res~0 := #t~ret9; [L64] havoc #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L67] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0) VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L68] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967304, #NULL!offset=4294967298, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L60] ~x~0 := #t~nondet7; [L60] havoc #t~nondet7; [L61] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~x~0=4.294967301E9] [L62] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.294967301E9] [L62] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~x~0=4.294967301E9] [L62] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~x~0=4.294967301E9] [L62] COND TRUE 0 == #t~ret8 [L62] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=4.294967301E9] [L64] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0] [L44-L51] ~x := #in~x; [L44-L51] ~y := #in~y; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0] [L17-L42] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~lsw~0; VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967301E9] [L21] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L22] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L23] ~msw~0 := #t~mem0; [L23] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L24] ~lsw~0 := #t~mem2; [L24] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~mem2; [L24] havoc #t~union3; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L27-L28] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L30-L31] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L33-L34] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L37-L38] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L41] #res := 0; VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L45] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45] COND TRUE 0 == #t~ret4 [L45] havoc #t~ret4; [L46] #res := ~y; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0, #res=4.2949673E9, ~x=4.294967301E9, ~y=4.2949673E9] [L64] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L64] ~res~0 := #t~ret9; [L64] havoc #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L67] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0) VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L68] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967304, #NULL!offset=4294967298, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L60] ~x~0 := #t~nondet7; [L60] havoc #t~nondet7; [L61] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~x~0=4.294967301E9] [L62] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.294967301E9] [L62] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~x~0=4.294967301E9] [L62] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~x~0=4.294967301E9] [L62] COND TRUE 0 == #t~ret8 [L62] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=4.294967301E9] [L64] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0] [L44-L51] ~x := #in~x; [L44-L51] ~y := #in~y; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0] [L17-L42] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~lsw~0; VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967301E9] [L21] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L22] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L23] ~msw~0 := #t~mem0; [L23] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L24] ~lsw~0 := #t~mem2; [L24] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~mem2; [L24] havoc #t~union3; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L27-L28] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L30-L31] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L33-L34] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L37-L38] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L41] #res := 0; VAL [#in~x=4.294967301E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.294967301E9] [L45] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967301E9, ~y=4.2949673E9] [L45] COND TRUE 0 == #t~ret4 [L45] havoc #t~ret4; [L46] #res := ~y; VAL [#in~x=4.294967301E9, #in~y=4.2949673E9, #NULL!base=0, #NULL!offset=0, #res=4.2949673E9, ~x=4.294967301E9, ~y=4.2949673E9] [L64] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L64] ~res~0 := #t~ret9; [L64] havoc #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L67] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0) VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L68] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.2949673E9, ~x~0=4.294967301E9, ~y~0=4.2949673E9] [L60] double x = __VERIFIER_nondet_double(); [L61] double y = 0.0 / 0.0; VAL [x=4294967301] [L62] CALL, EXPR isnan_double(x) VAL [\old(x)=4294967301] [L16] return x != x; VAL [\old(x)=4294967301, \result=0, x=4294967301] [L62] RET, EXPR isnan_double(x) VAL [isnan_double(x)=0, x=4294967301] [L62] COND TRUE !isnan_double(x) [L64] CALL, EXPR fmin_double(x, y) VAL [\old(x)=4294967301, \old(y)=4294967300] [L45] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967301] [L18] __uint32_t msw, lsw; VAL [\old(x)=4294967301, x=4294967301] [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967301, lsw=4294967297, msw=2146435073, x=4294967301] [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967301, lsw=4294967297, msw=2146435073, x=4294967301] [L33-L34] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967301, lsw=4294967297, msw=2146435073, x=4294967301] [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] return 0; VAL [\old(x)=4294967301, \result=0, lsw=4294967297, msw=2146435073, x=4294967301] [L45] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967301, \old(y)=4294967300, __fpclassify_double(x)=0, x=4294967301, y=4294967300] [L45] COND TRUE __fpclassify_double(x) == 0 [L46] return y; VAL [\old(x)=4294967301, \old(y)=4294967300, \result=4294967300, x=4294967301, y=4294967300] [L64] RET, EXPR fmin_double(x, y) VAL [fmin_double(x, y)=4294967300, x=4294967301, y=4294967300] [L64] double res = fmin_double(x, y); [L67] COND TRUE res != x VAL [res=4294967300, x=4294967301, y=4294967300] [L68] __VERIFIER_error() VAL [res=4294967300, x=4294967301, y=4294967300] ----- [2018-11-23 12:13:05,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:13:05 BoogieIcfgContainer [2018-11-23 12:13:05,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:13:05,320 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:13:05,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:13:05,321 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:13:05,321 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:13:04" (3/4) ... [2018-11-23 12:13:05,324 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 12:13:05,324 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:13:05,325 INFO L168 Benchmark]: Toolchain (without parser) took 1014.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -109.3 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-23 12:13:05,326 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:13:05,327 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.94 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 12:13:05,327 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.00 ms. Allocated memory is still 1.0 GB. Free memory is still 945.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:13:05,327 INFO L168 Benchmark]: Boogie Preprocessor took 55.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:13:05,328 INFO L168 Benchmark]: RCFGBuilder took 203.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:13:05,329 INFO L168 Benchmark]: TraceAbstraction took 560.50 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: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:13:05,329 INFO L168 Benchmark]: Witness Printer took 3.98 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 12:13:05,331 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 169.94 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.00 ms. Allocated memory is still 1.0 GB. Free memory is still 945.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 203.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 560.50 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: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.98 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 68]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L60] double x = __VERIFIER_nondet_double(); [L61] double y = 0.0 / 0.0; VAL [x=4294967301] [L62] CALL, EXPR isnan_double(x) VAL [\old(x)=4294967301] [L16] return x != x; VAL [\old(x)=4294967301, \result=0, x=4294967301] [L62] RET, EXPR isnan_double(x) VAL [isnan_double(x)=0, x=4294967301] [L62] COND TRUE !isnan_double(x) [L64] CALL, EXPR fmin_double(x, y) VAL [\old(x)=4294967301, \old(y)=4294967300] [L45] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967301] [L18] __uint32_t msw, lsw; VAL [\old(x)=4294967301, x=4294967301] [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967301, lsw=4294967297, msw=2146435073, x=4294967301] [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967301, lsw=4294967297, msw=2146435073, x=4294967301] [L33-L34] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967301, lsw=4294967297, msw=2146435073, x=4294967301] [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] return 0; VAL [\old(x)=4294967301, \result=0, lsw=4294967297, msw=2146435073, x=4294967301] [L45] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967301, \old(y)=4294967300, __fpclassify_double(x)=0, x=4294967301, y=4294967300] [L45] COND TRUE __fpclassify_double(x) == 0 [L46] return y; VAL [\old(x)=4294967301, \old(y)=4294967300, \result=4294967300, x=4294967301, y=4294967300] [L64] RET, EXPR fmin_double(x, y) VAL [fmin_double(x, y)=4294967300, x=4294967301, y=4294967300] [L64] double res = fmin_double(x, y); [L67] COND TRUE res != x VAL [res=4294967300, x=4294967301, y=4294967300] [L68] __VERIFIER_error() VAL [res=4294967300, x=4294967301, y=4294967300] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. UNSAFE Result, 0.5s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 139 SDtfs, 0 SDslu, 162 SDs, 0 SdLazy, 21 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, traceCheckStatistics: No data available, 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: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 2761 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 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 12:13:06,765 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:13:06,766 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:13:06,773 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:13:06,773 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:13:06,774 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:13:06,775 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:13:06,775 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:13:06,776 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:13:06,777 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:13:06,777 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:13:06,777 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:13:06,778 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:13:06,779 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:13:06,779 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:13:06,780 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:13:06,781 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:13:06,782 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:13:06,783 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:13:06,783 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:13:06,784 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:13:06,785 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:13:06,786 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:13:06,787 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:13:06,787 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:13:06,787 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:13:06,788 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:13:06,788 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:13:06,789 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:13:06,789 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:13:06,789 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:13:06,790 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:13:06,790 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:13:06,790 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:13:06,791 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:13:06,791 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:13:06,791 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 12:13:06,800 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:13:06,800 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:13:06,801 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:13:06,801 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:13:06,802 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:13:06,802 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:13:06,802 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:13:06,802 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:13:06,802 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:13:06,802 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:13:06,802 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:13:06,803 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:13:06,803 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:13:06,803 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:13:06,803 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 12:13:06,803 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 12:13:06,803 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:13:06,803 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:13:06,803 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:13:06,804 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:13:06,804 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:13:06,804 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:13:06,804 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:13:06,804 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:13:06,804 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:13:06,804 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:13:06,804 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:13:06,805 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:13:06,805 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 12:13:06,805 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:13:06,805 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 12:13:06,805 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 12:13:06,805 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_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer 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 -> Automizer 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 -> c714d208cb0b1f96f572e8a6108248eb76c73a94 [2018-11-23 12:13:06,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:13:06,845 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:13:06,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:13:06,848 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:13:06,849 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:13:06,849 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1231b_true-unreach-call.c [2018-11-23 12:13:06,895 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/data/2bab43045/4994214d28cd4db19bbe2040abf6188c/FLAG738b10d40 [2018-11-23 12:13:07,225 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:13:07,225 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/sv-benchmarks/c/float-newlib/double_req_bl_1231b_true-unreach-call.c [2018-11-23 12:13:07,229 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/data/2bab43045/4994214d28cd4db19bbe2040abf6188c/FLAG738b10d40 [2018-11-23 12:13:07,237 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/data/2bab43045/4994214d28cd4db19bbe2040abf6188c [2018-11-23 12:13:07,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:13:07,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:13:07,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:13:07,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:13:07,243 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:13:07,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:13:07" (1/1) ... [2018-11-23 12:13:07,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd6b773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:07, skipping insertion in model container [2018-11-23 12:13:07,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:13:07" (1/1) ... [2018-11-23 12:13:07,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:13:07,266 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:13:07,403 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:13:07,408 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:13:07,425 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:13:07,443 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:13:07,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:07 WrapperNode [2018-11-23 12:13:07,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:13:07,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:13:07,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:13:07,444 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:13:07,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:07" (1/1) ... [2018-11-23 12:13:07,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:07" (1/1) ... [2018-11-23 12:13:07,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:13:07,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:13:07,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:13:07,462 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:13:07,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:07" (1/1) ... [2018-11-23 12:13:07,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:07" (1/1) ... [2018-11-23 12:13:07,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:07" (1/1) ... [2018-11-23 12:13:07,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:07" (1/1) ... [2018-11-23 12:13:07,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:07" (1/1) ... [2018-11-23 12:13:07,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:07" (1/1) ... [2018-11-23 12:13:07,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:07" (1/1) ... [2018-11-23 12:13:07,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:13:07,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:13:07,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:13:07,486 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:13:07,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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:2000 [2018-11-23 12:13:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 12:13:07,565 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 12:13:07,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 12:13:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:13:07,566 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:13:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 12:13:07,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 12:13:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:13:07,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:13:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:13:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 12:13:07,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:13:07,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:13:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-11-23 12:13:07,567 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-11-23 12:13:07,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:13:07,674 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 12:13:07,752 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:13:07,752 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:13:07,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:13:07 BoogieIcfgContainer [2018-11-23 12:13:07,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:13:07,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:13:07,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:13:07,756 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:13:07,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:13:07" (1/3) ... [2018-11-23 12:13:07,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c0c9ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:13:07, skipping insertion in model container [2018-11-23 12:13:07,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:13:07" (2/3) ... [2018-11-23 12:13:07,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c0c9ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:13:07, skipping insertion in model container [2018-11-23 12:13:07,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:13:07" (3/3) ... [2018-11-23 12:13:07,758 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b_true-unreach-call.c [2018-11-23 12:13:07,764 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:13:07,769 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:13:07,782 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:13:07,801 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:13:07,801 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:13:07,801 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:13:07,801 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:13:07,801 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:13:07,802 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:13:07,802 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:13:07,802 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:13:07,802 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:13:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-23 12:13:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:13:07,818 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:07,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:13:07,820 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:07,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:07,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1136033273, now seen corresponding path program 1 times [2018-11-23 12:13:07,826 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:13:07,826 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 12:13:07,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:07,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:07,900 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 12:13:07,901 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:13:07,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:07,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:13:07,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:13:07,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:13:07,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:13:07,920 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-11-23 12:13:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:07,934 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2018-11-23 12:13:07,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:13:07,934 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-23 12:13:07,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:07,941 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:13:07,941 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:13:07,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:13:07,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:13:07,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 12:13:07,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:13:07,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-11-23 12:13:07,973 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 25 [2018-11-23 12:13:07,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:07,973 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-23 12:13:07,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:13:07,973 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-23 12:13:07,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:13:07,975 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:07,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:13:07,975 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:07,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:07,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1267021660, now seen corresponding path program 1 times [2018-11-23 12:13:07,976 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:13:07,976 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 12:13:07,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:08,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:08,059 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 12:13:08,060 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:13:08,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:08,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:13:08,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:08,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:08,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:08,068 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2018-11-23 12:13:08,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:08,098 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 12:13:08,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:13:08,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 12:13:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:08,101 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:13:08,101 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:13:08,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:08,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:13:08,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 12:13:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:13:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-23 12:13:08,108 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 26 [2018-11-23 12:13:08,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:08,108 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-23 12:13:08,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 12:13:08,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:13:08,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:08,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:13:08,110 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:08,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:08,110 INFO L82 PathProgramCache]: Analyzing trace with hash -938443286, now seen corresponding path program 1 times [2018-11-23 12:13:08,110 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:13:08,111 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 12:13:08,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:08,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:08,193 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 12:13:08,193 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:13:08,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:08,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:13:08,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:08,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:08,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:08,201 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2018-11-23 12:13:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:08,236 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-23 12:13:08,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:13:08,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 12:13:08,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:08,238 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:13:08,238 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:13:08,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:13:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-23 12:13:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:13:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-23 12:13:08,243 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 27 [2018-11-23 12:13:08,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:08,243 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-23 12:13:08,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 12:13:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:13:08,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:08,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:13:08,245 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:08,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:08,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2017668456, now seen corresponding path program 1 times [2018-11-23 12:13:08,246 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:13:08,246 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 12:13:08,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:08,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:08,319 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 12:13:08,319 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:13:08,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:08,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:13:08,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:08,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:08,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:08,332 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2018-11-23 12:13:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:08,369 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-23 12:13:08,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:13:08,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 12:13:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:08,371 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:13:08,371 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:13:08,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:13:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-23 12:13:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:13:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-23 12:13:08,375 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 28 [2018-11-23 12:13:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:08,375 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-23 12:13:08,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 12:13:08,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:13:08,376 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:08,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:13:08,376 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:08,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:08,376 INFO L82 PathProgramCache]: Analyzing trace with hash 527968686, now seen corresponding path program 1 times [2018-11-23 12:13:08,377 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:13:08,377 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 12:13:08,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:08,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:08,436 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 12:13:08,436 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:13:08,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:13:08,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:13:08,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:13:08,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:13:08,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:08,444 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2018-11-23 12:13:08,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:13:08,465 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-23 12:13:08,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:13:08,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-23 12:13:08,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:13:08,466 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:13:08,466 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:13:08,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:13:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:13:08,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-23 12:13:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:13:08,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-23 12:13:08,472 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 29 [2018-11-23 12:13:08,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:13:08,472 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-23 12:13:08,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:13:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 12:13:08,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:13:08,473 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:13:08,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:13:08,474 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:13:08,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:13:08,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1279485777, now seen corresponding path program 1 times [2018-11-23 12:13:08,474 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:13:08,474 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fc6bdbd-502d-4fa3-98b0-27f11daae0e2/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 12:13:08,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:13:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:13:08,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:13:08,699 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:13:08,700 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:13:08,700 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:13:08,701 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:13:08,706 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 12:13:08,998 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2018-11-23 12:13:08,999 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_2|)) 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.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) 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 12:13:09,001 INFO L168 Benchmark]: Toolchain (without parser) took 1761.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 942.5 MB in the beginning and 992.1 MB in the end (delta: -49.6 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. [2018-11-23 12:13:09,002 INFO L168 Benchmark]: CDTParser took 0.14 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 12:13:09,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.39 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 926.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:13:09,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.49 ms. Allocated memory is still 1.0 GB. Free memory is still 926.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:13:09,003 INFO L168 Benchmark]: Boogie Preprocessor took 24.42 ms. Allocated memory is still 1.0 GB. Free memory is still 926.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:13:09,004 INFO L168 Benchmark]: RCFGBuilder took 266.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 926.4 MB in the beginning and 1.1 GB in the end (delta: -190.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-23 12:13:09,004 INFO L168 Benchmark]: TraceAbstraction took 1247.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.1 MB in the end (delta: 124.7 MB). Peak memory consumption was 124.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:13:09,006 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 203.39 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 926.4 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 17.49 ms. Allocated memory is still 1.0 GB. Free memory is still 926.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.42 ms. Allocated memory is still 1.0 GB. Free memory is still 926.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 266.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 926.4 MB in the beginning and 1.1 GB in the end (delta: -190.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1247.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.1 MB in the end (delta: 124.7 MB). Peak memory consumption was 124.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_2|)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_2|)): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...