./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1251b_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_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1251b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/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 26bba4d307ba1cab1a3fe043c826d85928a7cf56 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1251b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/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 26bba4d307ba1cab1a3fe043c826d85928a7cf56 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:50:46,533 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:50:46,534 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:50:46,542 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:50:46,542 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:50:46,543 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:50:46,543 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:50:46,545 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:50:46,546 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:50:46,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:50:46,547 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:50:46,547 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:50:46,548 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:50:46,549 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:50:46,550 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:50:46,550 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:50:46,551 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:50:46,552 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:50:46,554 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:50:46,555 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:50:46,556 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:50:46,556 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:50:46,558 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:50:46,558 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:50:46,558 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:50:46,559 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:50:46,560 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:50:46,561 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:50:46,561 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:50:46,562 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:50:46,562 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:50:46,563 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:50:46,563 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:50:46,563 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:50:46,564 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:50:46,564 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:50:46,565 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 03:50:46,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:50:46,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:50:46,576 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:50:46,576 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:50:46,576 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:50:46,576 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:50:46,576 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:50:46,577 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:50:46,577 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:50:46,577 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:50:46,577 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:50:46,577 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:50:46,577 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:50:46,578 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:50:46,578 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:50:46,578 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:50:46,578 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:50:46,578 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:50:46,578 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:50:46,578 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:50:46,578 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:50:46,579 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:50:46,579 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:50:46,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:50:46,579 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:50:46,579 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:50:46,579 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:50:46,580 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:50:46,580 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:50:46,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:50:46,580 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_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/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 -> 26bba4d307ba1cab1a3fe043c826d85928a7cf56 [2018-11-23 03:50:46,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:50:46,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:50:46,613 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:50:46,614 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:50:46,615 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:50:46,615 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-11-23 03:50:46,654 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/data/212b018f5/6df86976dcb945a682abec56dd1e5552/FLAGdc2c1ce14 [2018-11-23 03:50:46,999 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:50:47,000 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/sv-benchmarks/c/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-11-23 03:50:47,004 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/data/212b018f5/6df86976dcb945a682abec56dd1e5552/FLAGdc2c1ce14 [2018-11-23 03:50:47,430 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/data/212b018f5/6df86976dcb945a682abec56dd1e5552 [2018-11-23 03:50:47,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:50:47,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:50:47,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:50:47,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:50:47,436 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:50:47,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:50:47" (1/1) ... [2018-11-23 03:50:47,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46704e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:47, skipping insertion in model container [2018-11-23 03:50:47,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:50:47" (1/1) ... [2018-11-23 03:50:47,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:50:47,462 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:50:47,592 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:50:47,593 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:50:47,609 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:50:47,621 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:50:47,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:47 WrapperNode [2018-11-23 03:50:47,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:50:47,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:50:47,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:50:47,622 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:50:47,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:47" (1/1) ... [2018-11-23 03:50:47,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:47" (1/1) ... [2018-11-23 03:50:47,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:50:47,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:50:47,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:50:47,637 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:50:47,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:47" (1/1) ... [2018-11-23 03:50:47,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:47" (1/1) ... [2018-11-23 03:50:47,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:47" (1/1) ... [2018-11-23 03:50:47,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:47" (1/1) ... [2018-11-23 03:50:47,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:47" (1/1) ... [2018-11-23 03:50:47,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:47" (1/1) ... [2018-11-23 03:50:47,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:47" (1/1) ... [2018-11-23 03:50:47,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:50:47,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:50:47,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:50:47,691 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:50:47,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/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 03:50:47,726 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 03:50:47,726 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 03:50:47,726 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:50:47,726 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:50:47,726 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 03:50:47,726 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 03:50:47,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:50:47,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:50:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-11-23 03:50:47,727 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-11-23 03:50:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 03:50:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:50:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:50:47,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:50:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:50:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:50:47,888 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:50:47,888 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 03:50:47,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:50:47 BoogieIcfgContainer [2018-11-23 03:50:47,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:50:47,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:50:47,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:50:47,892 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:50:47,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:50:47" (1/3) ... [2018-11-23 03:50:47,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab7f102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:50:47, skipping insertion in model container [2018-11-23 03:50:47,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:47" (2/3) ... [2018-11-23 03:50:47,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab7f102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:50:47, skipping insertion in model container [2018-11-23 03:50:47,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:50:47" (3/3) ... [2018-11-23 03:50:47,895 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b_true-unreach-call.c [2018-11-23 03:50:47,902 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:50:47,908 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:50:47,920 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:50:47,946 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:50:47,947 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:50:47,947 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:50:47,947 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:50:47,948 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:50:47,948 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:50:47,948 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:50:47,948 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:50:47,948 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:50:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 03:50:47,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 03:50:47,969 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:50:47,969 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 03:50:47,971 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:50:47,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:47,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2032926079, now seen corresponding path program 1 times [2018-11-23 03:50:47,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:50:47,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:50:48,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:48,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:50:48,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:50:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:50:48,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:50:48,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:50:48,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 03:50:48,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:50:48,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:50:48,085 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 03:50:48,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:50:48,101 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2018-11-23 03:50:48,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:50:48,102 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 03:50:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:50:48,108 INFO L225 Difference]: With dead ends: 69 [2018-11-23 03:50:48,109 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 03:50:48,111 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 03:50:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 03:50:48,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 03:50:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 03:50:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-23 03:50:48,139 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 27 [2018-11-23 03:50:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:50:48,139 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-23 03:50:48,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 03:50:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 03:50:48,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 03:50:48,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:50:48,141 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 03:50:48,142 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:50:48,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:48,142 INFO L82 PathProgramCache]: Analyzing trace with hash 544472172, now seen corresponding path program 1 times [2018-11-23 03:50:48,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:50:48,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:50:48,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:48,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:50:48,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:50:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:50:48,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:50:48,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:50:48,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 03:50:48,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:50:48,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:50:48,217 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 4 states. [2018-11-23 03:50:48,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:50:48,255 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-23 03:50:48,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:50:48,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 03:50:48,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:50:48,258 INFO L225 Difference]: With dead ends: 47 [2018-11-23 03:50:48,258 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 03:50:48,259 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 03:50:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 03:50:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 03:50:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 03:50:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 03:50:48,264 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2018-11-23 03:50:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:50:48,264 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 03:50:48,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 03:50:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 03:50:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 03:50:48,265 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:50:48,265 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 03:50:48,266 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:50:48,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:48,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2058062536, now seen corresponding path program 1 times [2018-11-23 03:50:48,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:50:48,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:50:48,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:48,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:50:48,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:50:48,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:50:48,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:50:48,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:50:48,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 03:50:48,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:50:48,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:50:48,333 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 4 states. [2018-11-23 03:50:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:50:48,355 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2018-11-23 03:50:48,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:50:48,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-23 03:50:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:50:48,357 INFO L225 Difference]: With dead ends: 51 [2018-11-23 03:50:48,357 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 03:50:48,357 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 03:50:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 03:50:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-11-23 03:50:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 03:50:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 03:50:48,362 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 31 [2018-11-23 03:50:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:50:48,363 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 03:50:48,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 03:50:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 03:50:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 03:50:48,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:50:48,364 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 03:50:48,364 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:50:48,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:48,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2040391255, now seen corresponding path program 1 times [2018-11-23 03:50:48,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:50:48,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:50:48,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:48,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:50:48,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:50:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:50:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:50:48,408 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 #82#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=4294967300.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|=4294967300.0] [?] ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_double_~x=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=4294967300.0, |isnan_double_#res|=0] [?] assume true; VAL [isnan_double_~x=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=4294967300.0, |isnan_double_#res|=0] [?] RET #86#return; VAL [main_~x~0=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [main_~x~0=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0] [?] assume 0 == #t~ret8;havoc #t~ret8; VAL [main_~x~0=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967300.0, |fmax_double_#in~y|=4294967302.0] [?] ~x := #in~x;~y := #in~y; VAL [fmax_double_~x=4294967300.0, fmax_double_~y=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967300.0, |fmax_double_#in~y|=4294967302.0] [?] CALL call #t~ret4 := __fpclassify_double(~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967300.0] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967300.0] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union1;havoc #t~mem0;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~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=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967300.0] [?] goto; VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=2146435073, __fpclassify_double_~x=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967300.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=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967300.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=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967300.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=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967300.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=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967300.0, |__fpclassify_double_#res|=0] [?] assume true; VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=2146435073, __fpclassify_double_~x=4294967300.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967300.0, |__fpclassify_double_#res|=0] [?] RET #78#return; VAL [fmax_double_~x=4294967300.0, fmax_double_~y=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967300.0, |fmax_double_#in~y|=4294967302.0, |fmax_double_#t~ret4|=0] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [fmax_double_~x=4294967300.0, fmax_double_~y=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967300.0, |fmax_double_#in~y|=4294967302.0, |fmax_double_#t~ret4|=0] [?] assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; VAL [fmax_double_~x=4294967300.0, fmax_double_~y=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967300.0, |fmax_double_#in~y|=4294967302.0, |fmax_double_#res|=4294967302.0] [?] assume true; VAL [fmax_double_~x=4294967300.0, fmax_double_~y=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967300.0, |fmax_double_#in~y|=4294967302.0, |fmax_double_#res|=4294967302.0] [?] RET #88#return; VAL [main_~x~0=4294967300.0, main_~y~0=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret9|=4294967302.0] [?] ~res~0 := #t~ret9;havoc #t~ret9; VAL [main_~res~0=4294967302.0, main_~x~0=4294967300.0, main_~y~0=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); VAL [main_~res~0=4294967302.0, main_~x~0=4294967300.0, main_~y~0=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=4294967302.0, main_~x~0=4294967300.0, main_~y~0=4294967302.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] [L64] ~x~0 := #t~nondet7; [L64] havoc #t~nondet7; [L65] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~x~0=4.2949673E9] [L72] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.2949673E9] [L16] ensures true; VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.2949673E9] [L72] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~x~0=4.2949673E9] [L72] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~x~0=4.2949673E9] [L72-L81] assume 0 == #t~ret8; [L72] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=4.2949673E9] [L74] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL.base=0, #NULL.offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, ~x=4.2949673E9] [L30] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L31] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L32] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L32] ~msw~0 := #t~mem0; [L32] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L32] havoc #t~union1; [L32] havoc #t~mem0; [L33] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L33] ~lsw~0 := #t~mem2; [L33] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L33] havoc #t~mem2; [L33] havoc #t~union3; [L30] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L30] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L36-L50] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L39-L50] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L42-L50] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L46-L50] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L50] #res := 0; VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L26-L51] ensures true; VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55-L56] assume 0 == #t~ret4; [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL.base=0, #NULL.offset=0, #res=4.294967302E9, ~x=4.2949673E9, ~y=4.294967302E9] [L53-L61] ensures true; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL.base=0, #NULL.offset=0, #res=4.294967302E9, ~x=4.2949673E9, ~y=4.294967302E9] [L74] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L74] ~res~0 := #t~ret9; [L74] havoc #t~ret9; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L77-L80] assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L78] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] ----- ----- 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] [L64] ~x~0 := #t~nondet7; [L64] havoc #t~nondet7; [L65] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~x~0=4.2949673E9] [L72] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.2949673E9] [L16] ensures true; VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.2949673E9] [L72] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~x~0=4.2949673E9] [L72] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~x~0=4.2949673E9] [L72-L81] assume 0 == #t~ret8; [L72] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=4.2949673E9] [L74] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL.base=0, #NULL.offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, ~x=4.2949673E9] [L30] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L31] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L32] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L32] ~msw~0 := #t~mem0; [L32] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L32] havoc #t~union1; [L32] havoc #t~mem0; [L33] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L33] ~lsw~0 := #t~mem2; [L33] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L33] havoc #t~mem2; [L33] havoc #t~union3; [L30] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L30] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L36-L50] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L39-L50] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L42-L50] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L46-L50] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L50] #res := 0; VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L26-L51] ensures true; VAL [#in~x=4.2949673E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55-L56] assume 0 == #t~ret4; [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL.base=0, #NULL.offset=0, #res=4.294967302E9, ~x=4.2949673E9, ~y=4.294967302E9] [L53-L61] ensures true; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL.base=0, #NULL.offset=0, #res=4.294967302E9, ~x=4.2949673E9, ~y=4.294967302E9] [L74] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L74] ~res~0 := #t~ret9; [L74] havoc #t~ret9; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L77-L80] assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L78] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [?] 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] [L64] ~x~0 := #t~nondet7; [L64] havoc #t~nondet7; [L65] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~x~0=4.2949673E9] [L72] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.2949673E9] [L72] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~x~0=4.2949673E9] [L72] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~x~0=4.2949673E9] [L72] COND TRUE 0 == #t~ret8 [L72] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=4.2949673E9] [L74] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~x=4.2949673E9] [L30] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L31] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L32] ~msw~0 := #t~mem0; [L32] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] havoc #t~union1; [L32] havoc #t~mem0; [L33] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L33] ~lsw~0 := #t~mem2; [L33] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L33] havoc #t~mem2; [L33] havoc #t~union3; [L30] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L30] havoc ~#ew_u~0; VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L36-L37] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L39-L40] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L42-L43] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L46-L47] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L50] #res := 0; VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55] COND TRUE 0 == #t~ret4 [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0, #res=4.294967302E9, ~x=4.2949673E9, ~y=4.294967302E9] [L74] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L74] ~res~0 := #t~ret9; [L74] havoc #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L77] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0) VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L78] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] ----- ----- 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] [L64] ~x~0 := #t~nondet7; [L64] havoc #t~nondet7; [L65] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~x~0=4.2949673E9] [L72] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.2949673E9] [L72] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~x~0=4.2949673E9] [L72] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~x~0=4.2949673E9] [L72] COND TRUE 0 == #t~ret8 [L72] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=4.2949673E9] [L74] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~x=4.2949673E9] [L30] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L31] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L32] ~msw~0 := #t~mem0; [L32] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] havoc #t~union1; [L32] havoc #t~mem0; [L33] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L33] ~lsw~0 := #t~mem2; [L33] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L33] havoc #t~mem2; [L33] havoc #t~union3; [L30] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L30] havoc ~#ew_u~0; VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L36-L37] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L39-L40] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L42-L43] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L46-L47] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L50] #res := 0; VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55] COND TRUE 0 == #t~ret4 [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0, #res=4.294967302E9, ~x=4.2949673E9, ~y=4.294967302E9] [L74] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L74] ~res~0 := #t~ret9; [L74] havoc #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L77] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0) VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L78] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [?] 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] [L64] ~x~0 := #t~nondet7; [L64] havoc #t~nondet7; [L65] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~x~0=4.2949673E9] [L72] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.2949673E9] [L72] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~x~0=4.2949673E9] [L72] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~x~0=4.2949673E9] [L72] COND TRUE 0 == #t~ret8 [L72] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=4.2949673E9] [L74] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~x=4.2949673E9] [L30] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L31] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L32] ~msw~0 := #t~mem0; [L32] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] havoc #t~union1; [L32] havoc #t~mem0; [L33] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L33] ~lsw~0 := #t~mem2; [L33] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L33] havoc #t~mem2; [L33] havoc #t~union3; [L30] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L30] havoc ~#ew_u~0; VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L36-L37] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L39-L40] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L42-L43] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L46-L47] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L50] #res := 0; VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55] COND TRUE 0 == #t~ret4 [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0, #res=4.294967302E9, ~x=4.2949673E9, ~y=4.294967302E9] [L74] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L74] ~res~0 := #t~ret9; [L74] havoc #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L77] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0) VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L78] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] ----- ----- 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] [L64] ~x~0 := #t~nondet7; [L64] havoc #t~nondet7; [L65] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~x~0=4.2949673E9] [L72] CALL call #t~ret8 := isnan_double(~x~0); VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.2949673E9] [L72] RET call #t~ret8 := isnan_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~x~0=4.2949673E9] [L72] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~x~0=4.2949673E9] [L72] COND TRUE 0 == #t~ret8 [L72] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=4.2949673E9] [L74] CALL call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~x=4.2949673E9] [L30] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L31] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L32] ~msw~0 := #t~mem0; [L32] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] havoc #t~union1; [L32] havoc #t~mem0; [L33] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L33] ~lsw~0 := #t~mem2; [L33] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L33] havoc #t~mem2; [L33] havoc #t~union3; [L30] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L30] havoc ~#ew_u~0; VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L36-L37] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L39-L40] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L42-L43] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L46-L47] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L50] #res := 0; VAL [#in~x=4.2949673E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=2146435073, ~x=4.2949673E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.2949673E9, ~y=4.294967302E9] [L55] COND TRUE 0 == #t~ret4 [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.2949673E9, #in~y=4.294967302E9, #NULL!base=0, #NULL!offset=0, #res=4.294967302E9, ~x=4.2949673E9, ~y=4.294967302E9] [L74] RET call #t~ret9 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L74] ~res~0 := #t~ret9; [L74] havoc #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L77] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0) VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L78] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967302E9, ~x~0=4.2949673E9, ~y~0=4.294967302E9] [L64] double x = __VERIFIER_nondet_double(); [L65] double y = 0.0 / 0.0; VAL [x=4294967300] [L72] CALL, EXPR isnan_double(x) VAL [\old(x)=4294967300] [L16] return x != x; VAL [\old(x)=4294967300, \result=0, x=4294967300] [L72] RET, EXPR isnan_double(x) VAL [isnan_double(x)=0, x=4294967300] [L72] COND TRUE !isnan_double(x) [L74] CALL, EXPR fmax_double(x, y) VAL [\old(x)=4294967300, \old(y)=4294967302] [L55] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967300] [L27] __uint32_t msw, lsw; VAL [\old(x)=4294967300, x=4294967300] [L30] ieee_double_shape_type ew_u; [L31] ew_u.value = (x) [L32] EXPR ew_u.parts.msw [L32] (msw) = ew_u.parts.msw [L33] EXPR ew_u.parts.lsw [L33] (lsw) = ew_u.parts.lsw [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967300, lsw=4294967297, msw=2146435073, x=4294967300] [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967300, lsw=4294967297, msw=2146435073, x=4294967300] [L42-L43] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967300, lsw=4294967297, msw=2146435073, x=4294967300] [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L50] return 0; VAL [\old(x)=4294967300, \result=0, lsw=4294967297, msw=2146435073, x=4294967300] [L55] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967300, \old(y)=4294967302, __fpclassify_double(x)=0, x=4294967300, y=4294967302] [L55] COND TRUE __fpclassify_double(x) == 0 [L56] return y; VAL [\old(x)=4294967300, \old(y)=4294967302, \result=4294967302, x=4294967300, y=4294967302] [L74] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=4294967302, x=4294967300, y=4294967302] [L74] double res = fmax_double(x, y); [L77] COND TRUE res != x VAL [res=4294967302, x=4294967300, y=4294967302] [L78] __VERIFIER_error() VAL [res=4294967302, x=4294967300, y=4294967302] ----- [2018-11-23 03:50:48,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:50:48 BoogieIcfgContainer [2018-11-23 03:50:48,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:50:48,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:50:48,446 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:50:48,446 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:50:48,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:50:47" (3/4) ... [2018-11-23 03:50:48,450 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:50:48,450 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:50:48,450 INFO L168 Benchmark]: Toolchain (without parser) took 1017.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -122.8 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:50:48,452 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:50:48,452 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.29 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 939.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:50:48,453 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.34 ms. Allocated memory is still 1.0 GB. Free memory is still 939.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:50:48,453 INFO L168 Benchmark]: Boogie Preprocessor took 54.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -208.5 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:50:48,454 INFO L168 Benchmark]: RCFGBuilder took 197.73 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-11-23 03:50:48,454 INFO L168 Benchmark]: TraceAbstraction took 556.12 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: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:50:48,455 INFO L168 Benchmark]: Witness Printer took 3.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:50:48,458 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 188.29 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 939.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.34 ms. Allocated memory is still 1.0 GB. Free memory is still 939.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -208.5 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 197.73 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 556.12 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: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 78]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryArithmeticDOUBLEoperation at line 65. Possible FailurePath: [L64] double x = __VERIFIER_nondet_double(); [L65] double y = 0.0 / 0.0; VAL [x=4294967300] [L72] CALL, EXPR isnan_double(x) VAL [\old(x)=4294967300] [L16] return x != x; VAL [\old(x)=4294967300, \result=0, x=4294967300] [L72] RET, EXPR isnan_double(x) VAL [isnan_double(x)=0, x=4294967300] [L72] COND TRUE !isnan_double(x) [L74] CALL, EXPR fmax_double(x, y) VAL [\old(x)=4294967300, \old(y)=4294967302] [L55] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967300] [L27] __uint32_t msw, lsw; VAL [\old(x)=4294967300, x=4294967300] [L30] ieee_double_shape_type ew_u; [L31] ew_u.value = (x) [L32] EXPR ew_u.parts.msw [L32] (msw) = ew_u.parts.msw [L33] EXPR ew_u.parts.lsw [L33] (lsw) = ew_u.parts.lsw [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967300, lsw=4294967297, msw=2146435073, x=4294967300] [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967300, lsw=4294967297, msw=2146435073, x=4294967300] [L42-L43] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967300, lsw=4294967297, msw=2146435073, x=4294967300] [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L50] return 0; VAL [\old(x)=4294967300, \result=0, lsw=4294967297, msw=2146435073, x=4294967300] [L55] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967300, \old(y)=4294967302, __fpclassify_double(x)=0, x=4294967300, y=4294967302] [L55] COND TRUE __fpclassify_double(x) == 0 [L56] return y; VAL [\old(x)=4294967300, \old(y)=4294967302, \result=4294967302, x=4294967300, y=4294967302] [L74] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=4294967302, x=4294967300, y=4294967302] [L74] double res = fmax_double(x, y); [L77] COND TRUE res != x VAL [res=4294967302, x=4294967300, y=4294967302] [L78] __VERIFIER_error() VAL [res=4294967302, x=4294967300, y=4294967302] - 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.1s 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 03:50:49,852 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:50:49,853 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:50:49,860 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:50:49,860 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:50:49,861 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:50:49,862 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:50:49,863 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:50:49,864 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:50:49,864 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:50:49,865 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:50:49,865 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:50:49,866 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:50:49,866 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:50:49,867 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:50:49,868 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:50:49,868 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:50:49,869 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:50:49,871 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:50:49,872 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:50:49,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:50:49,873 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:50:49,875 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:50:49,875 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:50:49,875 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:50:49,876 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:50:49,876 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:50:49,877 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:50:49,878 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:50:49,878 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:50:49,878 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:50:49,879 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:50:49,879 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:50:49,879 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:50:49,880 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:50:49,880 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:50:49,880 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 03:50:49,890 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:50:49,891 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:50:49,891 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:50:49,891 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:50:49,892 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:50:49,892 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:50:49,892 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:50:49,892 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:50:49,892 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:50:49,892 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:50:49,893 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:50:49,893 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:50:49,893 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:50:49,893 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:50:49,893 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 03:50:49,893 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 03:50:49,893 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:50:49,893 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:50:49,893 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:50:49,893 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:50:49,894 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:50:49,894 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:50:49,894 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:50:49,894 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:50:49,894 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:50:49,894 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:50:49,894 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:50:49,894 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:50:49,894 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 03:50:49,894 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:50:49,894 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 03:50:49,895 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 03:50:49,895 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_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/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 -> 26bba4d307ba1cab1a3fe043c826d85928a7cf56 [2018-11-23 03:50:49,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:50:49,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:50:49,941 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:50:49,942 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:50:49,943 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:50:49,943 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-11-23 03:50:49,988 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/data/0b49cceed/746ed5e32bcb4f728a6df04daabeaa18/FLAG89f412d10 [2018-11-23 03:50:50,383 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:50:50,383 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/sv-benchmarks/c/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-11-23 03:50:50,387 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/data/0b49cceed/746ed5e32bcb4f728a6df04daabeaa18/FLAG89f412d10 [2018-11-23 03:50:50,395 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/bin-2019/uautomizer/data/0b49cceed/746ed5e32bcb4f728a6df04daabeaa18 [2018-11-23 03:50:50,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:50:50,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:50:50,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:50:50,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:50:50,402 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:50:50,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:50:50" (1/1) ... [2018-11-23 03:50:50,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d0518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:50, skipping insertion in model container [2018-11-23 03:50:50,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:50:50" (1/1) ... [2018-11-23 03:50:50,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:50:50,430 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:50:50,563 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:50:50,566 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:50:50,584 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:50:50,602 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:50:50,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:50 WrapperNode [2018-11-23 03:50:50,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:50:50,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:50:50,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:50:50,603 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:50:50,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:50" (1/1) ... [2018-11-23 03:50:50,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:50" (1/1) ... [2018-11-23 03:50:50,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:50:50,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:50:50,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:50:50,620 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:50:50,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:50" (1/1) ... [2018-11-23 03:50:50,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:50" (1/1) ... [2018-11-23 03:50:50,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:50" (1/1) ... [2018-11-23 03:50:50,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:50" (1/1) ... [2018-11-23 03:50:50,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:50" (1/1) ... [2018-11-23 03:50:50,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:50" (1/1) ... [2018-11-23 03:50:50,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:50" (1/1) ... [2018-11-23 03:50:50,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:50:50,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:50:50,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:50:50,643 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:50:50,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/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 03:50:50,716 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 03:50:50,716 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 03:50:50,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 03:50:50,716 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:50:50,716 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:50:50,716 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 03:50:50,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 03:50:50,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:50:50,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:50:50,716 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-11-23 03:50:50,716 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-11-23 03:50:50,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:50:50,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 03:50:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:50:50,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:50:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:50:50,819 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:50:50,905 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:50:50,905 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 03:50:50,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:50:50 BoogieIcfgContainer [2018-11-23 03:50:50,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:50:50,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:50:50,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:50:50,908 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:50:50,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:50:50" (1/3) ... [2018-11-23 03:50:50,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e6f01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:50:50, skipping insertion in model container [2018-11-23 03:50:50,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:50:50" (2/3) ... [2018-11-23 03:50:50,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e6f01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:50:50, skipping insertion in model container [2018-11-23 03:50:50,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:50:50" (3/3) ... [2018-11-23 03:50:50,911 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b_true-unreach-call.c [2018-11-23 03:50:50,918 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:50:50,924 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:50:50,937 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:50:50,960 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:50:50,960 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:50:50,960 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:50:50,960 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:50:50,960 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:50:50,960 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:50:50,960 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:50:50,960 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:50:50,961 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:50:50,972 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-23 03:50:50,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 03:50:50,977 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:50:50,978 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 03:50:50,979 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:50:50,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:50,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1614855583, now seen corresponding path program 1 times [2018-11-23 03:50:50,985 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 03:50:50,986 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/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 03:50:50,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:50:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:50:51,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:50:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:50:51,060 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 03:50:51,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:50:51,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:50:51,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 03:50:51,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:50:51,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:50:51,082 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-11-23 03:50:51,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:50:51,100 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2018-11-23 03:50:51,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:50:51,101 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-23 03:50:51,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:50:51,107 INFO L225 Difference]: With dead ends: 64 [2018-11-23 03:50:51,107 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 03:50:51,109 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 03:50:51,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 03:50:51,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 03:50:51,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 03:50:51,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-11-23 03:50:51,136 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 25 [2018-11-23 03:50:51,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:50:51,136 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-23 03:50:51,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 03:50:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-23 03:50:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 03:50:51,138 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:50:51,138 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 03:50:51,138 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:50:51,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:51,139 INFO L82 PathProgramCache]: Analyzing trace with hash 756047800, now seen corresponding path program 1 times [2018-11-23 03:50:51,139 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 03:50:51,139 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/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 03:50:51,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:50:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:50:51,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:50:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:50:51,229 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 03:50:51,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:50:51,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:50:51,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 03:50:51,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:50:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:50:51,238 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2018-11-23 03:50:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:50:51,278 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 03:50:51,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:50:51,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 03:50:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:50:51,281 INFO L225 Difference]: With dead ends: 43 [2018-11-23 03:50:51,281 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 03:50:51,282 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 03:50:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 03:50:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 03:50:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 03:50:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-23 03:50:51,289 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 26 [2018-11-23 03:50:51,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:50:51,289 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-23 03:50:51,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 03:50:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 03:50:51,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 03:50:51,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:50:51,291 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 03:50:51,291 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:50:51,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:51,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1333859716, now seen corresponding path program 1 times [2018-11-23 03:50:51,292 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 03:50:51,292 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/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 03:50:51,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:50:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:50:51,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:50:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:50:51,374 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 03:50:51,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:50:51,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:50:51,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 03:50:51,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:50:51,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:50:51,386 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2018-11-23 03:50:51,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:50:51,432 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-23 03:50:51,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:50:51,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 03:50:51,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:50:51,433 INFO L225 Difference]: With dead ends: 46 [2018-11-23 03:50:51,433 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 03:50:51,434 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 03:50:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 03:50:51,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-23 03:50:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 03:50:51,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-23 03:50:51,439 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 27 [2018-11-23 03:50:51,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:50:51,439 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-23 03:50:51,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 03:50:51,440 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 03:50:51,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 03:50:51,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:50:51,440 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 03:50:51,440 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:50:51,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:51,441 INFO L82 PathProgramCache]: Analyzing trace with hash -868690628, now seen corresponding path program 1 times [2018-11-23 03:50:51,441 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 03:50:51,441 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/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 03:50:51,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:50:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:50:51,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:50:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:50:51,509 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 03:50:51,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:50:51,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:50:51,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 03:50:51,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:50:51,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:50:51,521 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2018-11-23 03:50:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:50:51,561 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-23 03:50:51,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:50:51,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 03:50:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:50:51,562 INFO L225 Difference]: With dead ends: 46 [2018-11-23 03:50:51,562 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 03:50:51,562 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 03:50:51,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 03:50:51,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-23 03:50:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 03:50:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-23 03:50:51,567 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 28 [2018-11-23 03:50:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:50:51,567 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-23 03:50:51,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 03:50:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 03:50:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 03:50:51,568 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:50:51,569 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 03:50:51,569 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:50:51,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:51,569 INFO L82 PathProgramCache]: Analyzing trace with hash 931842184, now seen corresponding path program 1 times [2018-11-23 03:50:51,569 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 03:50:51,569 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/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 03:50:51,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:50:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:50:51,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:50:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:50:51,626 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 03:50:51,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:50:51,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:50:51,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 03:50:51,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:50:51,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:50:51,634 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2018-11-23 03:50:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:50:51,671 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-23 03:50:51,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:50:51,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-23 03:50:51,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:50:51,672 INFO L225 Difference]: With dead ends: 46 [2018-11-23 03:50:51,672 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 03:50:51,673 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 03:50:51,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 03:50:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-23 03:50:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 03:50:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-11-23 03:50:51,676 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 29 [2018-11-23 03:50:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:50:51,676 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-11-23 03:50:51,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 03:50:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 03:50:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 03:50:51,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:50:51,677 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 03:50:51,677 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:50:51,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:50:51,678 INFO L82 PathProgramCache]: Analyzing trace with hash -875612279, now seen corresponding path program 1 times [2018-11-23 03:50:51,678 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 03:50:51,678 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fbf017ab-3bb0-4b63-9c3d-384eaf294ebe/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 03:50:51,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:50:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:50:51,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:50:51,851 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:50:51,852 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:50:51,853 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:50:51,854 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:50:51,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2018-11-23 03:50:51,970 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-11-23 03:50:52,171 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2018-11-23 03:50:52,172 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 03:50:52,174 INFO L168 Benchmark]: Toolchain (without parser) took 1776.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 949.7 MB in the beginning and 1.0 GB in the end (delta: -67.1 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. [2018-11-23 03:50:52,175 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:50:52,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.05 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:50:52,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.32 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:50:52,176 INFO L168 Benchmark]: Boogie Preprocessor took 22.85 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:50:52,176 INFO L168 Benchmark]: RCFGBuilder took 262.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -202.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:50:52,177 INFO L168 Benchmark]: TraceAbstraction took 1268.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 119.7 MB). Peak memory consumption was 119.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:50:52,180 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 204.05 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.32 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.85 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 262.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -202.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1268.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 119.7 MB). Peak memory consumption was 119.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...