./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1031_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_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1031_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/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 b9e27277237c869a286fcb7699394ad2f7d80117 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1031_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/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 b9e27277237c869a286fcb7699394ad2f7d80117 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:54:07,064 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:54:07,065 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:54:07,073 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:54:07,074 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:54:07,075 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:54:07,076 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:54:07,077 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:54:07,078 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:54:07,079 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:54:07,080 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:54:07,080 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:54:07,081 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:54:07,081 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:54:07,082 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:54:07,083 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:54:07,084 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:54:07,085 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:54:07,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:54:07,087 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:54:07,088 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:54:07,089 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:54:07,091 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:54:07,091 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:54:07,091 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:54:07,092 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:54:07,093 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:54:07,093 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:54:07,094 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:54:07,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:54:07,095 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:54:07,096 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:54:07,096 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:54:07,096 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:54:07,097 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:54:07,097 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:54:07,097 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 02:54:07,109 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:54:07,109 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:54:07,110 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:54:07,110 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:54:07,110 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:54:07,110 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:54:07,111 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:54:07,111 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:54:07,111 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:54:07,111 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:54:07,111 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:54:07,111 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:54:07,112 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:54:07,112 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:54:07,112 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:54:07,112 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:54:07,112 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:54:07,112 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:54:07,112 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:54:07,113 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:54:07,113 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:54:07,113 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:54:07,113 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:54:07,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:54:07,113 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:54:07,113 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:54:07,114 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:54:07,114 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:54:07,114 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:54:07,114 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:54:07,114 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_75aed675-8dad-4c06-bf4e-5f116003778f/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 -> b9e27277237c869a286fcb7699394ad2f7d80117 [2018-11-23 02:54:07,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:54:07,152 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:54:07,154 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:54:07,156 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:54:07,156 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:54:07,157 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1031_true-unreach-call.c [2018-11-23 02:54:07,212 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/data/26fa3a0ef/d56bf30577f54073a0cdf55d9e77205b/FLAG6523fc650 [2018-11-23 02:54:07,539 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:54:07,540 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/sv-benchmarks/c/float-newlib/double_req_bl_1031_true-unreach-call.c [2018-11-23 02:54:07,545 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/data/26fa3a0ef/d56bf30577f54073a0cdf55d9e77205b/FLAG6523fc650 [2018-11-23 02:54:07,559 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/data/26fa3a0ef/d56bf30577f54073a0cdf55d9e77205b [2018-11-23 02:54:07,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:54:07,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:54:07,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:54:07,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:54:07,569 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:54:07,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:54:07" (1/1) ... [2018-11-23 02:54:07,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7baf2d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:07, skipping insertion in model container [2018-11-23 02:54:07,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:54:07" (1/1) ... [2018-11-23 02:54:07,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:54:07,604 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:54:07,767 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:54:07,770 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:54:07,792 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:54:07,808 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:54:07,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:07 WrapperNode [2018-11-23 02:54:07,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:54:07,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:54:07,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:54:07,809 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:54:07,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:07" (1/1) ... [2018-11-23 02:54:07,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:07" (1/1) ... [2018-11-23 02:54:07,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:54:07,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:54:07,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:54:07,874 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:54:07,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:07" (1/1) ... [2018-11-23 02:54:07,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:07" (1/1) ... [2018-11-23 02:54:07,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:07" (1/1) ... [2018-11-23 02:54:07,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:07" (1/1) ... [2018-11-23 02:54:07,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:07" (1/1) ... [2018-11-23 02:54:07,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:07" (1/1) ... [2018-11-23 02:54:07,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:07" (1/1) ... [2018-11-23 02:54:07,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:54:07,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:54:07,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:54:07,902 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:54:07,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/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 02:54:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 02:54:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:54:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 02:54:07,941 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 02:54:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:54:07,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:54:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 02:54:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:54:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure round_double [2018-11-23 02:54:07,942 INFO L138 BoogieDeclarations]: Found implementation of procedure round_double [2018-11-23 02:54:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:54:07,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:54:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:54:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:54:07,942 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:54:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:54:08,177 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:54:08,177 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 02:54:08,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:54:08 BoogieIcfgContainer [2018-11-23 02:54:08,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:54:08,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:54:08,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:54:08,181 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:54:08,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:54:07" (1/3) ... [2018-11-23 02:54:08,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6c5461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:54:08, skipping insertion in model container [2018-11-23 02:54:08,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:07" (2/3) ... [2018-11-23 02:54:08,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6c5461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:54:08, skipping insertion in model container [2018-11-23 02:54:08,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:54:08" (3/3) ... [2018-11-23 02:54:08,184 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1031_true-unreach-call.c [2018-11-23 02:54:08,193 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:54:08,200 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:54:08,211 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:54:08,234 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:54:08,235 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:54:08,235 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:54:08,235 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:54:08,235 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:54:08,235 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:54:08,235 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:54:08,235 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:54:08,236 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:54:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-23 02:54:08,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:54:08,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:54:08,255 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] [2018-11-23 02:54:08,256 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:54:08,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:54:08,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1071653874, now seen corresponding path program 1 times [2018-11-23 02:54:08,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:54:08,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:54:08,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:54:08,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:54:08,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:54:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:54:08,363 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 02:54:08,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:54:08,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:54:08,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:54:08,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:54:08,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:54:08,380 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-11-23 02:54:08,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:54:08,397 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2018-11-23 02:54:08,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:54:08,398 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 02:54:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:54:08,406 INFO L225 Difference]: With dead ends: 70 [2018-11-23 02:54:08,406 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 02:54:08,409 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 02:54:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 02:54:08,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 02:54:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 02:54:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-23 02:54:08,439 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 23 [2018-11-23 02:54:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:54:08,439 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-23 02:54:08,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:54:08,439 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 02:54:08,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 02:54:08,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:54:08,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] [2018-11-23 02:54:08,440 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:54:08,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:54:08,440 INFO L82 PathProgramCache]: Analyzing trace with hash -308920579, now seen corresponding path program 1 times [2018-11-23 02:54:08,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:54:08,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:54:08,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:54:08,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:54:08,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:54:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:54:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:54:08,521 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6442450950, |#NULL.offset|=6442450945, |old(#NULL.base)|=6442450950, |old(#NULL.offset)|=6442450945] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450950, |old(#NULL.offset)|=6442450945] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450950, |old(#NULL.offset)|=6442450945] [?] RET #89#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret8 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := round_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0] [?] ~x := #in~x;havoc ~msw~0;havoc ~exponent_less_1023~0;havoc ~lsw~0; VAL [round_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.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 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [round_double_~lsw~0=0, round_double_~msw~0=(- 2147483648), round_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0] [?] goto; VAL [round_double_~lsw~0=0, round_double_~msw~0=(- 2147483648), round_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0] [?] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [round_double_~exponent_less_1023~0=0, round_double_~lsw~0=0, round_double_~msw~0=(- 2147483648), round_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0] [?] assume ~exponent_less_1023~0 < 20; VAL [round_double_~exponent_less_1023~0=0, round_double_~lsw~0=0, round_double_~msw~0=(- 2147483648), round_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0] [?] assume !(~exponent_less_1023~0 < 0);~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [round_double_~exponent_less_1023~0=0, round_double_~lsw~0=0, round_double_~msw~0=(- 2147483648), round_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0] [?] assume 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296;#res := ~x; VAL [round_double_~exponent_less_1023~0=0, round_double_~lsw~0=0, round_double_~msw~0=(- 2147483648), round_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0, |round_double_#res|=6442450946.0] [?] assume true; VAL [round_double_~exponent_less_1023~0=0, round_double_~lsw~0=0, round_double_~msw~0=(- 2147483648), round_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |round_double_#in~x|=6442450946.0, |round_double_#res|=6442450946.0] [?] RET #93#return; VAL [main_~x~0=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=6442450946.0] [?] ~res~0 := #t~ret6;havoc #t~ret6; VAL [main_~res~0=6442450946.0, main_~x~0=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret7 := isnan_double(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=6442450946.0] [?] ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=6442450946.0, |isnan_double_#res|=0] [?] assume true; VAL [isnan_double_~x=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=6442450946.0, |isnan_double_#res|=0] [?] RET #95#return; VAL [main_~res~0=6442450946.0, main_~x~0=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0] [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [main_~res~0=6442450946.0, main_~x~0=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=0] [?] assume 0 == #t~ret7;havoc #t~ret7; VAL [main_~res~0=6442450946.0, main_~x~0=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=6442450946.0, main_~x~0=6442450946.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450950, #NULL.offset=6442450945, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L74] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L75] CALL call #t~ret6 := round_double(~x~0); VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0] [L17-L64] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~exponent_less_1023~0; [L19] havoc ~lsw~0; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~x=6.442450946E9] [L21] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L22] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L23] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L24] ~lsw~0 := #t~mem2; [L24] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] havoc #t~mem2; [L24] havoc #t~union3; [L21] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L21] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L26] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L27-L56] assume ~exponent_less_1023~0 < 20; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L28-L40] assume !(~exponent_less_1023~0 < 0); [L34] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L35-L36] assume 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296; [L36] #res := ~x; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, #res=6.442450946E9, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L17-L64] ensures true; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, #res=6.442450946E9, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L75] RET call #t~ret6 := round_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=6.442450946E9, ~x~0=6.442450946E9] [L75] ~res~0 := #t~ret6; [L75] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78] CALL call #t~ret7 := isnan_double(~res~0); VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0] [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=6.442450946E9] [L15] ensures true; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=6.442450946E9] [L78] RET call #t~ret7 := isnan_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78-L81] assume 0 == #t~ret7; [L78] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L79] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450950, #NULL.offset=6442450945, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L74] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L75] CALL call #t~ret6 := round_double(~x~0); VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0] [L17-L64] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~exponent_less_1023~0; [L19] havoc ~lsw~0; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~x=6.442450946E9] [L21] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L22] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L23] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L24] ~lsw~0 := #t~mem2; [L24] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] havoc #t~mem2; [L24] havoc #t~union3; [L21] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L21] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L26] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L27-L56] assume ~exponent_less_1023~0 < 20; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L28-L40] assume !(~exponent_less_1023~0 < 0); [L34] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L35-L36] assume 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296; [L36] #res := ~x; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, #res=6.442450946E9, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L17-L64] ensures true; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, #res=6.442450946E9, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L75] RET call #t~ret6 := round_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=6.442450946E9, ~x~0=6.442450946E9] [L75] ~res~0 := #t~ret6; [L75] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78] CALL call #t~ret7 := isnan_double(~res~0); VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0] [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=6.442450946E9] [L15] ensures true; VAL [#in~x=6.442450946E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=6.442450946E9] [L78] RET call #t~ret7 := isnan_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78-L81] assume 0 == #t~ret7; [L78] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L79] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450950, #NULL!offset=6442450945, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L74] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L75] CALL call #t~ret6 := round_double(~x~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0] [L17-L64] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~exponent_less_1023~0; [L19] havoc ~lsw~0; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450946E9] [L21] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L22] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L23] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L24] ~lsw~0 := #t~mem2; [L24] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~mem2; [L24] havoc #t~union3; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L26] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L27] COND TRUE ~exponent_less_1023~0 < 20 VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L28] COND FALSE !(~exponent_less_1023~0 < 0) [L34] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L35] COND TRUE 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296 [L36] #res := ~x; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, #res=6.442450946E9, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L75] RET call #t~ret6 := round_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450946E9, ~x~0=6.442450946E9] [L75] ~res~0 := #t~ret6; [L75] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78] CALL call #t~ret7 := isnan_double(~res~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0] [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=6.442450946E9] [L78] RET call #t~ret7 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78] COND TRUE 0 == #t~ret7 [L78] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L79] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450950, #NULL!offset=6442450945, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L74] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L75] CALL call #t~ret6 := round_double(~x~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0] [L17-L64] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~exponent_less_1023~0; [L19] havoc ~lsw~0; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450946E9] [L21] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L22] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L23] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L24] ~lsw~0 := #t~mem2; [L24] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~mem2; [L24] havoc #t~union3; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L26] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L27] COND TRUE ~exponent_less_1023~0 < 20 VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L28] COND FALSE !(~exponent_less_1023~0 < 0) [L34] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L35] COND TRUE 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296 [L36] #res := ~x; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, #res=6.442450946E9, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L75] RET call #t~ret6 := round_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450946E9, ~x~0=6.442450946E9] [L75] ~res~0 := #t~ret6; [L75] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78] CALL call #t~ret7 := isnan_double(~res~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0] [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=6.442450946E9] [L78] RET call #t~ret7 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78] COND TRUE 0 == #t~ret7 [L78] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L79] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450950, #NULL!offset=6442450945, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L74] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L75] CALL call #t~ret6 := round_double(~x~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0] [L17-L64] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~exponent_less_1023~0; [L19] havoc ~lsw~0; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450946E9] [L21] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L22] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L23] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L24] ~lsw~0 := #t~mem2; [L24] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~mem2; [L24] havoc #t~union3; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L26] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L27] COND TRUE ~exponent_less_1023~0 < 20 VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L28] COND FALSE !(~exponent_less_1023~0 < 0) [L34] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L35] COND TRUE 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296 [L36] #res := ~x; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, #res=6.442450946E9, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L75] RET call #t~ret6 := round_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450946E9, ~x~0=6.442450946E9] [L75] ~res~0 := #t~ret6; [L75] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78] CALL call #t~ret7 := isnan_double(~res~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0] [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=6.442450946E9] [L78] RET call #t~ret7 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78] COND TRUE 0 == #t~ret7 [L78] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L79] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450950, #NULL!offset=6442450945, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L74] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L75] CALL call #t~ret6 := round_double(~x~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0] [L17-L64] ~x := #in~x; [L18] havoc ~msw~0; [L18] havoc ~exponent_less_1023~0; [L19] havoc ~lsw~0; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450946E9] [L21] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L22] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L23] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem0; [L23] havoc #t~union1; [L24] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L24] ~lsw~0 := #t~mem2; [L24] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~mem2; [L24] havoc #t~union3; [L21] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L21] havoc ~#ew_u~0; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L26] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L27] COND TRUE ~exponent_less_1023~0 < 20 VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L28] COND FALSE !(~exponent_less_1023~0 < 0) [L34] ~exponent_mask~0 := ~shiftRight(1048575, ~exponent_less_1023~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L35] COND TRUE 0 == ~bitwiseAnd(~msw~0, ~exponent_mask~0) % 4294967296 && 0 == ~lsw~0 % 4294967296 [L36] #res := ~x; VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, #res=6.442450946E9, ~exponent_less_1023~0=0, ~lsw~0=0, ~msw~0=-2147483648, ~x=6.442450946E9] [L75] RET call #t~ret6 := round_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450946E9, ~x~0=6.442450946E9] [L75] ~res~0 := #t~ret6; [L75] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78] CALL call #t~ret7 := isnan_double(~res~0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0] [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=6.442450946E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=6.442450946E9] [L78] RET call #t~ret7 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L78] COND TRUE 0 == #t~ret7 [L78] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L79] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.442450946E9, ~x~0=6.442450946E9] [L74] double x = 0.0 / 0.0; [L75] CALL, EXPR round_double(x) VAL [\old(x)=6442450946] [L18] __int32_t msw, exponent_less_1023; [L19] __uint32_t lsw; VAL [\old(x)=6442450946, x=6442450946] [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L26] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=6442450946, exponent_less_1023=0, lsw=0, msw=-2147483648, x=6442450946] [L27] COND TRUE exponent_less_1023 < 20 VAL [\old(x)=6442450946, exponent_less_1023=0, lsw=0, msw=-2147483648, x=6442450946] [L28] COND FALSE !(exponent_less_1023 < 0) [L34] __uint32_t exponent_mask = 0x000fffff >> exponent_less_1023; VAL [\old(x)=6442450946, exponent_less_1023=0, lsw=0, msw=-2147483648, x=6442450946] [L35] COND TRUE (msw & exponent_mask) == 0 && lsw == 0 [L36] return x; VAL [\old(x)=6442450946, \result=6442450946, exponent_less_1023=0, lsw=0, msw=-2147483648, x=6442450946] [L75] RET, EXPR round_double(x) VAL [round_double(x)=6442450946, x=6442450946] [L75] double res = round_double(x); [L78] CALL, EXPR isnan_double(res) VAL [\old(x)=6442450946] [L15] return x != x; VAL [\old(x)=6442450946, \result=0, x=6442450946] [L78] RET, EXPR isnan_double(res) VAL [isnan_double(res)=0, res=6442450946, x=6442450946] [L78] COND TRUE !isnan_double(res) [L79] __VERIFIER_error() VAL [res=6442450946, x=6442450946] ----- [2018-11-23 02:54:08,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:54:08 BoogieIcfgContainer [2018-11-23 02:54:08,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:54:08,559 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:54:08,559 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:54:08,559 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:54:08,560 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:54:08" (3/4) ... [2018-11-23 02:54:08,562 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:54:08,562 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:54:08,563 INFO L168 Benchmark]: Toolchain (without parser) took 1000.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 963.4 MB in the beginning and 1.1 GB in the end (delta: -122.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:54:08,564 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:54:08,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.46 ms. Allocated memory is still 1.0 GB. Free memory was 963.4 MB in the beginning and 946.2 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:54:08,565 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -192.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:54:08,566 INFO L168 Benchmark]: Boogie Preprocessor took 28.10 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:54:08,567 INFO L168 Benchmark]: RCFGBuilder took 275.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:54:08,567 INFO L168 Benchmark]: TraceAbstraction took 380.43 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: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:54:08,568 INFO L168 Benchmark]: Witness Printer took 3.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:54:08,570 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.46 ms. Allocated memory is still 1.0 GB. Free memory was 963.4 MB in the beginning and 946.2 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -192.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.10 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 275.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 380.43 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: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 79]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftRight at line 34, overapproximation of someBinaryArithmeticDOUBLEoperation at line 74, overapproximation of bitwiseAnd at line 35, overapproximation of someBinaryDOUBLEComparisonOperation at line 15. Possible FailurePath: [L74] double x = 0.0 / 0.0; [L75] CALL, EXPR round_double(x) VAL [\old(x)=6442450946] [L18] __int32_t msw, exponent_less_1023; [L19] __uint32_t lsw; VAL [\old(x)=6442450946, x=6442450946] [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L26] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=6442450946, exponent_less_1023=0, lsw=0, msw=-2147483648, x=6442450946] [L27] COND TRUE exponent_less_1023 < 20 VAL [\old(x)=6442450946, exponent_less_1023=0, lsw=0, msw=-2147483648, x=6442450946] [L28] COND FALSE !(exponent_less_1023 < 0) [L34] __uint32_t exponent_mask = 0x000fffff >> exponent_less_1023; VAL [\old(x)=6442450946, exponent_less_1023=0, lsw=0, msw=-2147483648, x=6442450946] [L35] COND TRUE (msw & exponent_mask) == 0 && lsw == 0 [L36] return x; VAL [\old(x)=6442450946, \result=6442450946, exponent_less_1023=0, lsw=0, msw=-2147483648, x=6442450946] [L75] RET, EXPR round_double(x) VAL [round_double(x)=6442450946, x=6442450946] [L75] double res = round_double(x); [L78] CALL, EXPR isnan_double(res) VAL [\old(x)=6442450946] [L15] return x != x; VAL [\old(x)=6442450946, \result=0, x=6442450946] [L78] RET, EXPR isnan_double(res) VAL [isnan_double(res)=0, res=6442450946, x=6442450946] [L78] COND TRUE !isnan_double(res) [L79] __VERIFIER_error() VAL [res=6442450946, x=6442450946] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 46 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 02:54:10,288 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:54:10,289 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:54:10,300 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:54:10,300 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:54:10,301 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:54:10,302 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:54:10,304 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:54:10,305 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:54:10,306 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:54:10,307 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:54:10,307 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:54:10,308 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:54:10,308 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:54:10,310 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:54:10,310 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:54:10,311 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:54:10,312 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:54:10,314 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:54:10,315 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:54:10,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:54:10,317 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:54:10,320 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:54:10,320 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:54:10,320 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:54:10,321 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:54:10,322 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:54:10,322 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:54:10,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:54:10,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:54:10,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:54:10,326 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:54:10,326 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:54:10,326 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:54:10,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:54:10,327 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:54:10,328 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 02:54:10,341 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:54:10,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:54:10,342 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:54:10,342 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:54:10,343 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:54:10,343 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:54:10,343 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:54:10,343 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:54:10,343 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:54:10,344 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:54:10,344 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:54:10,344 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:54:10,344 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:54:10,344 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:54:10,344 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 02:54:10,345 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 02:54:10,345 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:54:10,345 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:54:10,345 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:54:10,345 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:54:10,345 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:54:10,346 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:54:10,346 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:54:10,346 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:54:10,346 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:54:10,346 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:54:10,347 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:54:10,347 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:54:10,347 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 02:54:10,347 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:54:10,347 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 02:54:10,347 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 02:54:10,347 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_75aed675-8dad-4c06-bf4e-5f116003778f/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 -> b9e27277237c869a286fcb7699394ad2f7d80117 [2018-11-23 02:54:10,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:54:10,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:54:10,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:54:10,400 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:54:10,401 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:54:10,401 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1031_true-unreach-call.c [2018-11-23 02:54:10,456 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/data/34f0437ac/20603a1e71444f84a44a77aeffdb54f5/FLAGecfbb3424 [2018-11-23 02:54:10,827 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:54:10,827 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/sv-benchmarks/c/float-newlib/double_req_bl_1031_true-unreach-call.c [2018-11-23 02:54:10,833 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/data/34f0437ac/20603a1e71444f84a44a77aeffdb54f5/FLAGecfbb3424 [2018-11-23 02:54:10,848 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/data/34f0437ac/20603a1e71444f84a44a77aeffdb54f5 [2018-11-23 02:54:10,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:54:10,853 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:54:10,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:54:10,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:54:10,858 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:54:10,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:54:10" (1/1) ... [2018-11-23 02:54:10,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f089c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:10, skipping insertion in model container [2018-11-23 02:54:10,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:54:10" (1/1) ... [2018-11-23 02:54:10,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:54:10,889 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:54:11,055 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:54:11,061 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:54:11,088 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:54:11,113 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:54:11,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:11 WrapperNode [2018-11-23 02:54:11,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:54:11,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:54:11,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:54:11,114 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:54:11,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:11" (1/1) ... [2018-11-23 02:54:11,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:11" (1/1) ... [2018-11-23 02:54:11,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:54:11,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:54:11,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:54:11,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:54:11,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:11" (1/1) ... [2018-11-23 02:54:11,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:11" (1/1) ... [2018-11-23 02:54:11,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:11" (1/1) ... [2018-11-23 02:54:11,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:11" (1/1) ... [2018-11-23 02:54:11,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:11" (1/1) ... [2018-11-23 02:54:11,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:11" (1/1) ... [2018-11-23 02:54:11,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:11" (1/1) ... [2018-11-23 02:54:11,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:54:11,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:54:11,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:54:11,241 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:54:11,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/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 02:54:11,285 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 02:54:11,285 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 02:54:11,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 02:54:11,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:54:11,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:54:11,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:54:11,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 02:54:11,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 02:54:11,286 INFO L130 BoogieDeclarations]: Found specification of procedure round_double [2018-11-23 02:54:11,286 INFO L138 BoogieDeclarations]: Found implementation of procedure round_double [2018-11-23 02:54:11,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:54:11,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:54:11,286 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:54:11,287 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:54:11,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 02:54:11,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:54:11,444 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 02:54:11,689 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:54:11,690 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 02:54:11,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:54:11 BoogieIcfgContainer [2018-11-23 02:54:11,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:54:11,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:54:11,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:54:11,694 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:54:11,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:54:10" (1/3) ... [2018-11-23 02:54:11,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51bddcd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:54:11, skipping insertion in model container [2018-11-23 02:54:11,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:54:11" (2/3) ... [2018-11-23 02:54:11,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51bddcd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:54:11, skipping insertion in model container [2018-11-23 02:54:11,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:54:11" (3/3) ... [2018-11-23 02:54:11,698 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1031_true-unreach-call.c [2018-11-23 02:54:11,705 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:54:11,711 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:54:11,723 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:54:11,744 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:54:11,745 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:54:11,745 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:54:11,745 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:54:11,745 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:54:11,745 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:54:11,746 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:54:11,746 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:54:11,746 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:54:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-23 02:54:11,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 02:54:11,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:54:11,764 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] [2018-11-23 02:54:11,766 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:54:11,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:54:11,771 INFO L82 PathProgramCache]: Analyzing trace with hash -671872189, now seen corresponding path program 1 times [2018-11-23 02:54:11,774 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:54:11,774 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/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 02:54:11,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:54:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:54:11,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:54:11,856 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 02:54:11,856 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:54:11,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:54:11,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:54:11,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:54:11,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:54:11,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:54:11,888 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-23 02:54:11,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:54:11,909 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2018-11-23 02:54:11,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:54:11,910 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 02:54:11,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:54:11,921 INFO L225 Difference]: With dead ends: 68 [2018-11-23 02:54:11,921 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 02:54:11,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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 02:54:11,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 02:54:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 02:54:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 02:54:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-11-23 02:54:11,954 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 22 [2018-11-23 02:54:11,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:54:11,955 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-23 02:54:11,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:54:11,955 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-23 02:54:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:54:11,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:54:11,956 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] [2018-11-23 02:54:11,956 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:54:11,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:54:11,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1325068332, now seen corresponding path program 1 times [2018-11-23 02:54:11,958 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:54:11,958 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/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 02:54:11,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:54:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:54:12,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:54:12,222 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 02:54:12,223 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:54:12,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:54:12,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:54:12,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:54:12,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:54:12,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:54:12,239 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 9 states. [2018-11-23 02:54:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:54:13,020 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-23 02:54:13,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:54:13,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 02:54:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:54:13,023 INFO L225 Difference]: With dead ends: 43 [2018-11-23 02:54:13,023 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 02:54:13,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:54:13,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 02:54:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-23 02:54:13,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 02:54:13,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-23 02:54:13,034 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2018-11-23 02:54:13,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:54:13,034 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-23 02:54:13,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:54:13,035 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 02:54:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:54:13,035 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:54:13,036 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] [2018-11-23 02:54:13,036 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:54:13,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:54:13,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1627276127, now seen corresponding path program 1 times [2018-11-23 02:54:13,037 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:54:13,037 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/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 02:54:13,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:54:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:54:13,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:54:13,763 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-11-23 02:54:14,418 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 02:54:14,418 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:54:14,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:54:14,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:54:14,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:54:14,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:54:14,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:54:14,429 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 9 states. [2018-11-23 02:54:15,799 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-23 02:54:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:54:16,988 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 02:54:16,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:54:16,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 02:54:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:54:16,989 INFO L225 Difference]: With dead ends: 41 [2018-11-23 02:54:16,990 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 02:54:16,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:54:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 02:54:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 02:54:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 02:54:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-23 02:54:16,994 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 23 [2018-11-23 02:54:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:54:16,994 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-23 02:54:16,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:54:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 02:54:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 02:54:16,995 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:54:16,995 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 02:54:16,995 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:54:16,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:54:16,996 INFO L82 PathProgramCache]: Analyzing trace with hash -560603808, now seen corresponding path program 1 times [2018-11-23 02:54:16,996 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:54:16,996 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/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 02:54:16,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:54:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:54:17,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:54:17,104 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:54:17,105 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:54:17,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 02:54:17,157 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:54:17,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-11-23 02:54:17,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:54:17,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 02:54:17,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 02:54:17,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:54:17,190 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:54:17,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:54:17,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:54:17,201 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 02:54:17,312 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 02:54:17,312 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:54:17,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:54:17,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 02:54:17,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:54:17,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:54:17,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:54:17,328 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 7 states. [2018-11-23 02:54:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:54:18,130 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-23 02:54:18,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:54:18,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 02:54:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:54:18,133 INFO L225 Difference]: With dead ends: 52 [2018-11-23 02:54:18,133 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 02:54:18,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:54:18,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 02:54:18,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-11-23 02:54:18,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 02:54:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-23 02:54:18,137 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-11-23 02:54:18,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:54:18,137 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-23 02:54:18,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:54:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 02:54:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 02:54:18,138 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:54:18,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, 1, 1] [2018-11-23 02:54:18,139 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:54:18,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:54:18,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1924804585, now seen corresponding path program 1 times [2018-11-23 02:54:18,139 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:54:18,139 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/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 02:54:18,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:54:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:54:18,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:54:18,237 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:54:18,237 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:54:18,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 02:54:18,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 02:54:18,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:54:18,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 02:54:18,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-11-23 02:54:18,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:54:18,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:54:18,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:54:18,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:54:18,328 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 02:54:18,486 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 02:54:18,486 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:54:18,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:54:18,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 02:54:18,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:54:18,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:54:18,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:54:18,496 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 8 states. [2018-11-23 02:54:18,950 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-11-23 02:54:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:54:19,251 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 02:54:19,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:54:19,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 02:54:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:54:19,252 INFO L225 Difference]: With dead ends: 35 [2018-11-23 02:54:19,253 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 02:54:19,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-11-23 02:54:19,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 02:54:19,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 02:54:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 02:54:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 02:54:19,254 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-11-23 02:54:19,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:54:19,254 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:54:19,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:54:19,254 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:54:19,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 02:54:19,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 02:54:19,336 INFO L451 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 15) the Hoare annotation is: true [2018-11-23 02:54:19,337 INFO L448 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 15) no Hoare annotation was computed. [2018-11-23 02:54:19,337 INFO L448 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 15) no Hoare annotation was computed. [2018-11-23 02:54:19,337 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:54:19,337 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:54:19,337 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:54:19,337 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 56) no Hoare annotation was computed. [2018-11-23 02:54:19,337 INFO L448 ceAbstractionStarter]: For program point round_doubleFINAL(lines 17 64) no Hoare annotation was computed. [2018-11-23 02:54:19,337 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 53) no Hoare annotation was computed. [2018-11-23 02:54:19,338 INFO L448 ceAbstractionStarter]: For program point L52-2(lines 52 53) no Hoare annotation was computed. [2018-11-23 02:54:19,338 INFO L451 ceAbstractionStarter]: At program point round_doubleENTRY(lines 17 64) the Hoare annotation is: true [2018-11-23 02:54:19,338 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 40) no Hoare annotation was computed. [2018-11-23 02:54:19,338 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 62) no Hoare annotation was computed. [2018-11-23 02:54:19,338 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 17 64) no Hoare annotation was computed. [2018-11-23 02:54:19,338 INFO L448 ceAbstractionStarter]: For program point L57-2(lines 57 62) no Hoare annotation was computed. [2018-11-23 02:54:19,338 INFO L448 ceAbstractionStarter]: For program point round_doubleEXIT(lines 17 64) no Hoare annotation was computed. [2018-11-23 02:54:19,339 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2018-11-23 02:54:19,339 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 20 25) the Hoare annotation is: (= |round_double_#in~x| round_double_~x) [2018-11-23 02:54:19,339 INFO L448 ceAbstractionStarter]: For program point L20-3(lines 20 25) no Hoare annotation was computed. [2018-11-23 02:54:19,339 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 50) no Hoare annotation was computed. [2018-11-23 02:54:19,339 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 56) no Hoare annotation was computed. [2018-11-23 02:54:19,339 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 45) no Hoare annotation was computed. [2018-11-23 02:54:19,339 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-11-23 02:54:19,339 INFO L448 ceAbstractionStarter]: For program point L30-2(lines 30 31) no Hoare annotation was computed. [2018-11-23 02:54:19,340 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 36) no Hoare annotation was computed. [2018-11-23 02:54:19,340 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:54:19,340 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 02:54:19,340 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:54:19,340 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:54:19,340 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-23 02:54:19,340 INFO L444 ceAbstractionStarter]: At program point L78(line 78) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= main_~x~0 .cse0) (= main_~res~0 .cse0))) [2018-11-23 02:54:19,341 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2018-11-23 02:54:19,341 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 66 84) the Hoare annotation is: true [2018-11-23 02:54:19,341 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 78 81) no Hoare annotation was computed. [2018-11-23 02:54:19,341 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 66 84) no Hoare annotation was computed. [2018-11-23 02:54:19,341 INFO L444 ceAbstractionStarter]: At program point L75(line 75) the Hoare annotation is: (= main_~x~0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) [2018-11-23 02:54:19,341 INFO L448 ceAbstractionStarter]: For program point L75-1(line 75) no Hoare annotation was computed. [2018-11-23 02:54:19,341 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 66 84) no Hoare annotation was computed. [2018-11-23 02:54:19,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:54:19 BoogieIcfgContainer [2018-11-23 02:54:19,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:54:19,354 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:54:19,354 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:54:19,354 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:54:19,354 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:54:11" (3/4) ... [2018-11-23 02:54:19,358 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 02:54:19,365 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_double [2018-11-23 02:54:19,365 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 02:54:19,365 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure round_double [2018-11-23 02:54:19,365 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 02:54:19,370 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-11-23 02:54:19,370 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 02:54:19,370 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 02:54:19,397 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 02:54:19,418 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_75aed675-8dad-4c06-bf4e-5f116003778f/bin-2019/uautomizer/witness.graphml [2018-11-23 02:54:19,418 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:54:19,419 INFO L168 Benchmark]: Toolchain (without parser) took 8566.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 949.7 MB in the beginning and 884.9 MB in the end (delta: 64.9 MB). Peak memory consumption was 213.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:54:19,419 INFO L168 Benchmark]: CDTParser took 0.21 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 02:54:19,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.47 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 02:54:19,420 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.43 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 02:54:19,420 INFO L168 Benchmark]: Boogie Preprocessor took 101.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -209.0 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:54:19,420 INFO L168 Benchmark]: RCFGBuilder took 449.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:54:19,421 INFO L168 Benchmark]: TraceAbstraction took 7662.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 891.7 MB in the end (delta: 224.5 MB). Peak memory consumption was 224.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:54:19,421 INFO L168 Benchmark]: Witness Printer took 64.28 ms. Allocated memory is still 1.2 GB. Free memory was 891.7 MB in the beginning and 884.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:54:19,424 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.21 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 259.47 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 24.43 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 101.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -209.0 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 449.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7662.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 891.7 MB in the end (delta: 224.5 MB). Peak memory consumption was 224.5 MB. Max. memory is 11.5 GB. * Witness Printer took 64.28 ms. Allocated memory is still 1.2 GB. Free memory was 891.7 MB in the beginning and 884.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 38 locations, 1 error locations. SAFE Result, 7.6s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 157 SDtfs, 121 SDslu, 550 SDs, 0 SdLazy, 205 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 13 PreInvPairs, 16 NumberOfFragments, 28 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 20 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 117 ConstructedInterpolants, 22 QuantifiedInterpolants, 20054 SizeOfPredicates, 16 NumberOfNonLiveVariables, 318 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...