./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1052d_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_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1052d_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/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 8314f0a25d0cae1024b24eed74020923c3a8036e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1052d_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/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 8314f0a25d0cae1024b24eed74020923c3a8036e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:54:00,070 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:54:00,071 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:54:00,078 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:54:00,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:54:00,079 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:54:00,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:54:00,081 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:54:00,082 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:54:00,083 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:54:00,083 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:54:00,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:54:00,084 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:54:00,085 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:54:00,085 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:54:00,086 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:54:00,086 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:54:00,087 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:54:00,089 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:54:00,090 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:54:00,090 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:54:00,091 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:54:00,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:54:00,093 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:54:00,093 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:54:00,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:54:00,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:54:00,095 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:54:00,096 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:54:00,096 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:54:00,097 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:54:00,097 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:54:00,097 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:54:00,097 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:54:00,098 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:54:00,098 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:54:00,099 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-22 21:54:00,109 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:54:00,109 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:54:00,110 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:54:00,110 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:54:00,110 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:54:00,110 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:54:00,111 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:54:00,111 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:54:00,111 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:54:00,111 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:54:00,111 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:54:00,111 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:54:00,111 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:54:00,111 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:54:00,111 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:54:00,112 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:54:00,112 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:54:00,112 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:54:00,112 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:54:00,112 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:54:00,112 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:54:00,112 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:54:00,112 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:54:00,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:54:00,113 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:54:00,113 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:54:00,113 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:54:00,113 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:54:00,113 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:54:00,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:54:00,113 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_dd3d089e-d319-460f-9c15-ea65a0ee5456/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 -> 8314f0a25d0cae1024b24eed74020923c3a8036e [2018-11-22 21:54:00,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:54:00,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:54:00,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:54:00,145 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:54:00,145 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:54:00,146 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1052d_true-unreach-call.c [2018-11-22 21:54:00,182 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/data/084a08cf7/002b4b2c20584490b895c27e4b6030da/FLAG2ed99394b [2018-11-22 21:54:00,586 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:54:00,587 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/sv-benchmarks/c/float-newlib/float_req_bl_1052d_true-unreach-call.c [2018-11-22 21:54:00,593 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/data/084a08cf7/002b4b2c20584490b895c27e4b6030da/FLAG2ed99394b [2018-11-22 21:54:00,604 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/data/084a08cf7/002b4b2c20584490b895c27e4b6030da [2018-11-22 21:54:00,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:54:00,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:54:00,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:54:00,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:54:00,610 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:54:00,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:54:00" (1/1) ... [2018-11-22 21:54:00,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b02929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:00, skipping insertion in model container [2018-11-22 21:54:00,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:54:00" (1/1) ... [2018-11-22 21:54:00,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:54:00,633 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:54:00,752 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:54:00,755 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:54:00,773 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:54:00,786 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:54:00,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:00 WrapperNode [2018-11-22 21:54:00,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:54:00,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:54:00,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:54:00,787 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:54:00,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:00" (1/1) ... [2018-11-22 21:54:00,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:00" (1/1) ... [2018-11-22 21:54:00,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:54:00,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:54:00,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:54:00,802 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:54:00,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:00" (1/1) ... [2018-11-22 21:54:00,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:00" (1/1) ... [2018-11-22 21:54:00,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:00" (1/1) ... [2018-11-22 21:54:00,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:00" (1/1) ... [2018-11-22 21:54:00,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:00" (1/1) ... [2018-11-22 21:54:00,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:00" (1/1) ... [2018-11-22 21:54:00,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:00" (1/1) ... [2018-11-22 21:54:00,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:54:00,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:54:00,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:54:00,862 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:54:00,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/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-22 21:54:00,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-22 21:54:00,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 21:54:00,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:54:00,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:54:00,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-22 21:54:00,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:54:00,894 INFO L130 BoogieDeclarations]: Found specification of procedure floor_float [2018-11-22 21:54:00,894 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_float [2018-11-22 21:54:00,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:54:00,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:54:00,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 21:54:00,895 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:54:00,895 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:54:00,895 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-11-22 21:54:00,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-11-22 21:54:00,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:54:01,066 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:54:01,066 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-22 21:54:01,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:54:01 BoogieIcfgContainer [2018-11-22 21:54:01,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:54:01,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:54:01,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:54:01,069 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:54:01,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:54:00" (1/3) ... [2018-11-22 21:54:01,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47294e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:54:01, skipping insertion in model container [2018-11-22 21:54:01,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:00" (2/3) ... [2018-11-22 21:54:01,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47294e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:54:01, skipping insertion in model container [2018-11-22 21:54:01,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:54:01" (3/3) ... [2018-11-22 21:54:01,071 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1052d_true-unreach-call.c [2018-11-22 21:54:01,077 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:54:01,081 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:54:01,094 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:54:01,119 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:54:01,119 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:54:01,120 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:54:01,120 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:54:01,120 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:54:01,120 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:54:01,120 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:54:01,120 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:54:01,120 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:54:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-22 21:54:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:54:01,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:54:01,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:54:01,137 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:54:01,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:54:01,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2053199230, now seen corresponding path program 1 times [2018-11-22 21:54:01,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:54:01,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:54:01,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:54:01,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:54:01,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:54:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:54:01,234 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-22 21:54:01,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:54:01,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 21:54:01,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 21:54:01,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 21:54:01,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:54:01,248 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-11-22 21:54:01,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:54:01,261 INFO L93 Difference]: Finished difference Result 78 states and 111 transitions. [2018-11-22 21:54:01,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 21:54:01,262 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-22 21:54:01,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:54:01,267 INFO L225 Difference]: With dead ends: 78 [2018-11-22 21:54:01,267 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 21:54:01,269 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-22 21:54:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 21:54:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-22 21:54:01,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-22 21:54:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2018-11-22 21:54:01,296 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 18 [2018-11-22 21:54:01,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:54:01,296 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2018-11-22 21:54:01,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 21:54:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-22 21:54:01,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-22 21:54:01,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:54:01,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:54:01,298 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:54:01,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:54:01,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2027240245, now seen corresponding path program 1 times [2018-11-22 21:54:01,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:54:01,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:54:01,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:54:01,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:54:01,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:54:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:54:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:54:01,372 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6442450951, |#NULL.offset|=6442450945, |old(#NULL.base)|=6442450951, |old(#NULL.offset)|=6442450945, |old(~huge_floor~0)|=6442450947.0, ~huge_floor~0=6442450947.0] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~huge_floor~0 := 1.0E30; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450951, |old(#NULL.offset)|=6442450945, |old(~huge_floor~0)|=6442450947.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450951, |old(#NULL.offset)|=6442450945, |old(~huge_floor~0)|=6442450947.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] RET #114#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] CALL call #t~ret9 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] ~x~0 := 0.0; VAL [main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] CALL call #t~ret6 := floor_float(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] ~x := #in~x;havoc ~i0~0;havoc ~j0~0;havoc ~i~0;havoc ~ix~0; VAL [floor_float_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [floor_float_~i0~0=(- 2147483648), floor_float_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] goto; VAL [floor_float_~i0~0=(- 2147483648), floor_float_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647);~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [floor_float_~i0~0=(- 2147483648), floor_float_~ix~0=(- 36028794871480321), floor_float_~j0~0=128, floor_float_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume !(~j0~0 < 23); VAL [floor_float_~i0~0=(- 2147483648), floor_float_~ix~0=(- 36028794871480321), floor_float_~j0~0=128, floor_float_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume !(~ix~0 % 4294967296 < 2139095040);#res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [floor_float_~i0~0=(- 2147483648), floor_float_~ix~0=(- 36028794871480321), floor_float_~j0~0=128, floor_float_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume true; VAL [floor_float_~i0~0=(- 2147483648), floor_float_~ix~0=(- 36028794871480321), floor_float_~j0~0=128, floor_float_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] RET #118#return; VAL [main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=6442450946.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] ~res~0 := #t~ret6;havoc #t~ret6;#t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [main_~res~0=6442450946.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short8|=false, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume !#t~short8; VAL [main_~res~0=6442450946.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short8|=false, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume !#t~short8;havoc #t~short8;havoc #t~ret7; VAL [main_~res~0=6442450946.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume !false; VAL [main_~res~0=6442450946.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450951, #NULL.offset=6442450945, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=6.442450947E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=1.0E30] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := 0.0; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~x~0=0.0] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~x=0.0] [L17] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L18] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L17] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=0.0] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L23-L47] assume !(~j0~0 < 23); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L43-L46] assume !(~ix~0 % 4294967296 < 2139095040); [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L13-L54] ensures true; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=0.0] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L79] assume !#t~short8; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L79-L82] assume !#t~short8; [L79] havoc #t~short8; [L79] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L80] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450951, #NULL.offset=6442450945, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=6.442450947E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=1.0E30] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := 0.0; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~x~0=0.0] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~x=0.0] [L17] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L18] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L17] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=0.0] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L23-L47] assume !(~j0~0 < 23); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L43-L46] assume !(~ix~0 % 4294967296 < 2139095040); [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L13-L54] ensures true; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=0.0] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L79] assume !#t~short8; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L79-L82] assume !#t~short8; [L79] havoc #t~short8; [L79] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L80] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450951, #NULL!offset=6442450945, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=6.442450947E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x~0=0.0] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x=0.0] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=0.0] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=0.0] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L79] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L79] COND TRUE !#t~short8 [L79] havoc #t~short8; [L79] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450951, #NULL!offset=6442450945, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=6.442450947E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x~0=0.0] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x=0.0] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=0.0] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=0.0] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L79] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L79] COND TRUE !#t~short8 [L79] havoc #t~short8; [L79] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450951, #NULL!offset=6442450945, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=6.442450947E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x~0=0.0] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x=0.0] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=0.0] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=0.0] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L79] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L79] COND TRUE !#t~short8 [L79] havoc #t~short8; [L79] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450951, #NULL!offset=6442450945, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=6.442450947E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x~0=0.0] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x=0.0] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=0.0] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-36028794871480321, ~j0~0=128, ~x=0.0] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=0.0] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L79] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L79] COND TRUE !#t~short8 [L79] havoc #t~short8; [L79] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=0.0] [L11] static const float huge_floor = 1.0e30; VAL [\old(huge_floor)=6442450947, huge_floor=1000000000000000000000000000000] [L75] float x = 0.0f; VAL [huge_floor=1000000000000000000000000000000, x=0] [L76] CALL, EXPR floor_float(x) VAL [\old(x)=0, huge_floor=1000000000000000000000000000000] [L14] __int32_t i0, j0; [L15] __uint32_t i, ix; VAL [\old(x)=0, huge_floor=1000000000000000000000000000000, x=0] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (i0) = gf_u.word [L21] ix = (i0 & 0x7fffffff) [L22] j0 = (ix >> 23) - 0x7f VAL [\old(x)=0, huge_floor=1000000000000000000000000000000, i=-36028794871480321, i0=-2147483648, j0=128, x=0] [L23] COND FALSE !(j0 < 23) VAL [\old(x)=0, huge_floor=1000000000000000000000000000000, i=-36028794871480321, i0=-2147483648, j0=128, x=0] [L43] COND TRUE !((ix) < 0x7f800000L) [L44] return x + x; VAL [\old(x)=0, huge_floor=1000000000000000000000000000000, i=-36028794871480321, i0=-2147483648, j0=128, x=0] [L76] RET, EXPR floor_float(x) VAL [floor_float(x)=6442450946, huge_floor=1000000000000000000000000000000, x=0] [L76] float res = floor_float(x); [L79] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [huge_floor=1000000000000000000000000000000, res=6442450946, res == 0.0f && __signbit_float(res) == 0=0, x=0] [L79] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L80] __VERIFIER_error() VAL [huge_floor=1000000000000000000000000000000, res=6442450946, x=0] ----- [2018-11-22 21:54:01,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:54:01 BoogieIcfgContainer [2018-11-22 21:54:01,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:54:01,408 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:54:01,408 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:54:01,408 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:54:01,409 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:54:01" (3/4) ... [2018-11-22 21:54:01,411 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 21:54:01,412 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:54:01,412 INFO L168 Benchmark]: Toolchain (without parser) took 805.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 959.3 MB in the beginning and 1.1 GB in the end (delta: -130.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-11-22 21:54:01,413 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:54:01,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.65 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:54:01,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.91 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:54:01,415 INFO L168 Benchmark]: Boogie Preprocessor took 59.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:54:01,415 INFO L168 Benchmark]: RCFGBuilder took 204.57 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.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-22 21:54:01,416 INFO L168 Benchmark]: TraceAbstraction took 341.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-22 21:54:01,416 INFO L168 Benchmark]: Witness Printer took 3.32 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-22 21:54:01,419 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 179.65 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.91 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -203.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 204.57 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.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 341.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.32 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: 80]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of bitwiseAnd at line 21, overapproximation of someBinaryArithmeticFLOAToperation at line 44. Possible FailurePath: [L11] static const float huge_floor = 1.0e30; VAL [\old(huge_floor)=6442450947, huge_floor=1000000000000000000000000000000] [L75] float x = 0.0f; VAL [huge_floor=1000000000000000000000000000000, x=0] [L76] CALL, EXPR floor_float(x) VAL [\old(x)=0, huge_floor=1000000000000000000000000000000] [L14] __int32_t i0, j0; [L15] __uint32_t i, ix; VAL [\old(x)=0, huge_floor=1000000000000000000000000000000, x=0] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (i0) = gf_u.word [L21] ix = (i0 & 0x7fffffff) [L22] j0 = (ix >> 23) - 0x7f VAL [\old(x)=0, huge_floor=1000000000000000000000000000000, i=-36028794871480321, i0=-2147483648, j0=128, x=0] [L23] COND FALSE !(j0 < 23) VAL [\old(x)=0, huge_floor=1000000000000000000000000000000, i=-36028794871480321, i0=-2147483648, j0=128, x=0] [L43] COND TRUE !((ix) < 0x7f800000L) [L44] return x + x; VAL [\old(x)=0, huge_floor=1000000000000000000000000000000, i=-36028794871480321, i0=-2147483648, j0=128, x=0] [L76] RET, EXPR floor_float(x) VAL [floor_float(x)=6442450946, huge_floor=1000000000000000000000000000000, x=0] [L76] float res = floor_float(x); [L79] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [huge_floor=1000000000000000000000000000000, res=6442450946, res == 0.0f && __signbit_float(res) == 0=0, x=0] [L79] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L80] __VERIFIER_error() VAL [huge_floor=1000000000000000000000000000000, res=6442450946, x=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 52 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=43occurred 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, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 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-22 21:54:02,854 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:54:02,855 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:54:02,862 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:54:02,862 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:54:02,863 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:54:02,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:54:02,865 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:54:02,866 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:54:02,867 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:54:02,867 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:54:02,867 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:54:02,868 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:54:02,869 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:54:02,869 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:54:02,870 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:54:02,871 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:54:02,872 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:54:02,874 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:54:02,875 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:54:02,876 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:54:02,877 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:54:02,879 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:54:02,879 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:54:02,879 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:54:02,880 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:54:02,880 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:54:02,881 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:54:02,881 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:54:02,883 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:54:02,883 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:54:02,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:54:02,883 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:54:02,884 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:54:02,884 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:54:02,885 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:54:02,885 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-22 21:54:02,896 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:54:02,896 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:54:02,896 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:54:02,896 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:54:02,897 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:54:02,897 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:54:02,897 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:54:02,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:54:02,897 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:54:02,898 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:54:02,898 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:54:02,898 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:54:02,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:54:02,898 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:54:02,899 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-22 21:54:02,899 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-22 21:54:02,899 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:54:02,899 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:54:02,899 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:54:02,900 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:54:02,900 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:54:02,900 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:54:02,900 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:54:02,900 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:54:02,900 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:54:02,900 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:54:02,900 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:54:02,900 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:54:02,900 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-22 21:54:02,901 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:54:02,901 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-22 21:54:02,901 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-22 21:54:02,901 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_dd3d089e-d319-460f-9c15-ea65a0ee5456/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 -> 8314f0a25d0cae1024b24eed74020923c3a8036e [2018-11-22 21:54:02,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:54:02,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:54:02,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:54:02,946 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:54:02,946 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:54:02,947 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1052d_true-unreach-call.c [2018-11-22 21:54:02,987 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/data/45f002a10/76c5341345dd4bb1a0c504008167dc60/FLAG4be8592cc [2018-11-22 21:54:03,381 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:54:03,381 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/sv-benchmarks/c/float-newlib/float_req_bl_1052d_true-unreach-call.c [2018-11-22 21:54:03,385 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/data/45f002a10/76c5341345dd4bb1a0c504008167dc60/FLAG4be8592cc [2018-11-22 21:54:03,395 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/data/45f002a10/76c5341345dd4bb1a0c504008167dc60 [2018-11-22 21:54:03,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:54:03,399 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:54:03,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:54:03,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:54:03,403 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:54:03,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:54:03" (1/1) ... [2018-11-22 21:54:03,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db03a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:03, skipping insertion in model container [2018-11-22 21:54:03,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:54:03" (1/1) ... [2018-11-22 21:54:03,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:54:03,431 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:54:03,562 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:54:03,566 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:54:03,585 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:54:03,601 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:54:03,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:03 WrapperNode [2018-11-22 21:54:03,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:54:03,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:54:03,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:54:03,602 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:54:03,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:03" (1/1) ... [2018-11-22 21:54:03,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:03" (1/1) ... [2018-11-22 21:54:03,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:54:03,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:54:03,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:54:03,620 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:54:03,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:03" (1/1) ... [2018-11-22 21:54:03,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:03" (1/1) ... [2018-11-22 21:54:03,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:03" (1/1) ... [2018-11-22 21:54:03,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:03" (1/1) ... [2018-11-22 21:54:03,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:03" (1/1) ... [2018-11-22 21:54:03,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:03" (1/1) ... [2018-11-22 21:54:03,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:03" (1/1) ... [2018-11-22 21:54:03,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:54:03,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:54:03,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:54:03,642 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:54:03,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/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-22 21:54:03,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:54:03,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:54:03,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:54:03,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-22 21:54:03,713 INFO L130 BoogieDeclarations]: Found specification of procedure floor_float [2018-11-22 21:54:03,713 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_float [2018-11-22 21:54:03,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:54:03,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:54:03,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-22 21:54:03,714 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:54:03,714 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:54:03,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-22 21:54:03,714 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-11-22 21:54:03,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-11-22 21:54:03,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-22 21:54:03,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:54:04,150 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:54:04,150 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-22 21:54:04,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:54:04 BoogieIcfgContainer [2018-11-22 21:54:04,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:54:04,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:54:04,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:54:04,154 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:54:04,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:54:03" (1/3) ... [2018-11-22 21:54:04,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f77e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:54:04, skipping insertion in model container [2018-11-22 21:54:04,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:03" (2/3) ... [2018-11-22 21:54:04,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f77e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:54:04, skipping insertion in model container [2018-11-22 21:54:04,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:54:04" (3/3) ... [2018-11-22 21:54:04,157 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1052d_true-unreach-call.c [2018-11-22 21:54:04,165 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:54:04,171 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:54:04,180 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:54:04,198 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:54:04,198 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:54:04,198 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:54:04,198 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:54:04,198 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:54:04,198 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:54:04,198 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:54:04,198 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:54:04,198 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:54:04,209 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-22 21:54:04,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:54:04,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:54:04,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:54:04,214 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:54:04,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:54:04,218 INFO L82 PathProgramCache]: Analyzing trace with hash -2053199230, now seen corresponding path program 1 times [2018-11-22 21:54:04,220 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:54:04,220 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/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-22 21:54:04,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:54:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:54:04,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:54:04,293 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-22 21:54:04,294 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:54:04,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:54:04,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 21:54:04,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 21:54:04,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 21:54:04,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:54:04,313 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-11-22 21:54:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:54:04,328 INFO L93 Difference]: Finished difference Result 78 states and 111 transitions. [2018-11-22 21:54:04,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 21:54:04,329 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-22 21:54:04,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:54:04,335 INFO L225 Difference]: With dead ends: 78 [2018-11-22 21:54:04,335 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 21:54:04,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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-22 21:54:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 21:54:04,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-22 21:54:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-22 21:54:04,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2018-11-22 21:54:04,363 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 18 [2018-11-22 21:54:04,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:54:04,363 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2018-11-22 21:54:04,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 21:54:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-22 21:54:04,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-22 21:54:04,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:54:04,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:54:04,365 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:54:04,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:54:04,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2027240245, now seen corresponding path program 1 times [2018-11-22 21:54:04,366 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:54:04,366 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/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-22 21:54:04,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:54:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:54:04,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:54:04,539 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-22 21:54:04,540 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:54:04,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:54:04,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 21:54:04,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 21:54:04,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 21:54:04,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:54:04,550 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 7 states. [2018-11-22 21:54:05,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:54:05,429 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-22 21:54:05,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 21:54:05,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-22 21:54:05,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:54:05,431 INFO L225 Difference]: With dead ends: 60 [2018-11-22 21:54:05,431 INFO L226 Difference]: Without dead ends: 44 [2018-11-22 21:54:05,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-22 21:54:05,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-22 21:54:05,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-11-22 21:54:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-22 21:54:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-22 21:54:05,436 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2018-11-22 21:54:05,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:54:05,436 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-22 21:54:05,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 21:54:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-22 21:54:05,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 21:54:05,437 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:54:05,437 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] [2018-11-22 21:54:05,437 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:54:05,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:54:05,437 INFO L82 PathProgramCache]: Analyzing trace with hash -568234905, now seen corresponding path program 1 times [2018-11-22 21:54:05,438 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:54:05,438 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/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-22 21:54:05,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:54:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:54:05,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:54:05,530 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-22 21:54:05,530 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:54:05,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:54:05,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 21:54:05,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 21:54:05,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 21:54:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:54:05,538 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2018-11-22 21:54:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:54:06,470 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-11-22 21:54:06,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 21:54:06,471 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-22 21:54:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:54:06,472 INFO L225 Difference]: With dead ends: 67 [2018-11-22 21:54:06,472 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 21:54:06,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-22 21:54:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 21:54:06,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-11-22 21:54:06,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-22 21:54:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-22 21:54:06,476 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 20 [2018-11-22 21:54:06,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:54:06,477 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-22 21:54:06,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 21:54:06,477 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-22 21:54:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-22 21:54:06,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:54:06,477 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-22 21:54:06,478 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:54:06,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:54:06,478 INFO L82 PathProgramCache]: Analyzing trace with hash 13684055, now seen corresponding path program 1 times [2018-11-22 21:54:06,478 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:54:06,478 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/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-22 21:54:06,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:54:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:54:06,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:54:07,488 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-22 21:54:07,492 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-22 21:54:07,493 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:54:07,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:54:07,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 21:54:07,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 21:54:07,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:54:07,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:54:07,505 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 6 states. [2018-11-22 21:54:08,384 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-22 21:54:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:54:08,719 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-22 21:54:08,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 21:54:08,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-22 21:54:08,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:54:08,723 INFO L225 Difference]: With dead ends: 52 [2018-11-22 21:54:08,723 INFO L226 Difference]: Without dead ends: 34 [2018-11-22 21:54:08,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:54:08,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-22 21:54:08,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-22 21:54:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-22 21:54:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-22 21:54:08,727 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 23 [2018-11-22 21:54:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:54:08,728 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-22 21:54:08,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 21:54:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-22 21:54:08,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 21:54:08,728 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:54:08,728 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-22 21:54:08,728 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:54:08,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:54:08,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2137668883, now seen corresponding path program 1 times [2018-11-22 21:54:08,729 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:54:08,729 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/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-22 21:54:08,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:54:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:54:08,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:54:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:54:08,808 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:54:08,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:54:08,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 21:54:08,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 21:54:08,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 21:54:08,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-22 21:54:08,816 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 7 states. [2018-11-22 21:54:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:54:08,913 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-22 21:54:08,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 21:54:08,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-22 21:54:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:54:08,914 INFO L225 Difference]: With dead ends: 44 [2018-11-22 21:54:08,914 INFO L226 Difference]: Without dead ends: 41 [2018-11-22 21:54:08,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-22 21:54:08,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-22 21:54:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-22 21:54:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-22 21:54:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-22 21:54:08,918 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 24 [2018-11-22 21:54:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:54:08,918 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-22 21:54:08,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 21:54:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-22 21:54:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 21:54:08,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:54:08,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:54:08,919 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:54:08,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:54:08,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1389654977, now seen corresponding path program 1 times [2018-11-22 21:54:08,919 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:54:08,920 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-22 21:54:08,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:54:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:54:08,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:54:09,012 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-22 21:54:09,012 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:54:09,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:54:09,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 21:54:09,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 21:54:09,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:54:09,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:54:09,021 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 6 states. [2018-11-22 21:54:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:54:09,217 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-22 21:54:09,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 21:54:09,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-22 21:54:09,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:54:09,218 INFO L225 Difference]: With dead ends: 57 [2018-11-22 21:54:09,218 INFO L226 Difference]: Without dead ends: 33 [2018-11-22 21:54:09,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-22 21:54:09,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-22 21:54:09,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-22 21:54:09,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 21:54:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2018-11-22 21:54:09,221 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 25 [2018-11-22 21:54:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:54:09,222 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2018-11-22 21:54:09,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 21:54:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2018-11-22 21:54:09,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-22 21:54:09,222 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:54:09,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:54:09,223 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:54:09,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:54:09,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1598134754, now seen corresponding path program 1 times [2018-11-22 21:54:09,223 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:54:09,223 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-22 21:54:09,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:54:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:54:09,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:54:09,424 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-22 21:54:09,425 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:54:09,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:54:09,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-22 21:54:09,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 21:54:09,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 21:54:09,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-22 21:54:09,433 INFO L87 Difference]: Start difference. First operand 33 states and 32 transitions. Second operand 12 states. [2018-11-22 21:54:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:54:09,685 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2018-11-22 21:54:09,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 21:54:09,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-22 21:54:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:54:09,686 INFO L225 Difference]: With dead ends: 33 [2018-11-22 21:54:09,686 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 21:54:09,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-11-22 21:54:09,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 21:54:09,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 21:54:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 21:54:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 21:54:09,686 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-11-22 21:54:09,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:54:09,687 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:54:09,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 21:54:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 21:54:09,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 21:54:09,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 21:54:09,815 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-22 21:54:09,815 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-22 21:54:09,815 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:54:09,815 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 47) no Hoare annotation was computed. [2018-11-22 21:54:09,815 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 52) no Hoare annotation was computed. [2018-11-22 21:54:09,815 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 13 54) no Hoare annotation was computed. [2018-11-22 21:54:09,815 INFO L448 ceAbstractionStarter]: For program point L48-2(lines 48 52) no Hoare annotation was computed. [2018-11-22 21:54:09,816 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 40) no Hoare annotation was computed. [2018-11-22 21:54:09,816 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 30) no Hoare annotation was computed. [2018-11-22 21:54:09,816 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 41) no Hoare annotation was computed. [2018-11-22 21:54:09,816 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2018-11-22 21:54:09,816 INFO L444 ceAbstractionStarter]: At program point L16-2(lines 16 20) the Hoare annotation is: (or (not (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000.0)) ~huge_floor~0)) (= |floor_float_#in~x| floor_float_~x)) [2018-11-22 21:54:09,816 INFO L448 ceAbstractionStarter]: For program point L16-3(lines 16 20) no Hoare annotation was computed. [2018-11-22 21:54:09,816 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 38) no Hoare annotation was computed. [2018-11-22 21:54:09,816 INFO L448 ceAbstractionStarter]: For program point L37-2(lines 37 38) no Hoare annotation was computed. [2018-11-22 21:54:09,816 INFO L448 ceAbstractionStarter]: For program point floor_floatEXIT(lines 13 54) no Hoare annotation was computed. [2018-11-22 21:54:09,816 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 31) no Hoare annotation was computed. [2018-11-22 21:54:09,816 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 35) no Hoare annotation was computed. [2018-11-22 21:54:09,816 INFO L448 ceAbstractionStarter]: For program point floor_floatFINAL(lines 13 54) no Hoare annotation was computed. [2018-11-22 21:54:09,816 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2018-11-22 21:54:09,817 INFO L451 ceAbstractionStarter]: At program point floor_floatENTRY(lines 13 54) the Hoare annotation is: true [2018-11-22 21:54:09,817 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 46) no Hoare annotation was computed. [2018-11-22 21:54:09,817 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:54:09,817 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000.0)) ~huge_floor~0) [2018-11-22 21:54:09,817 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 21:54:09,817 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 21:54:09,817 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-22 21:54:09,817 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 68 85) the Hoare annotation is: true [2018-11-22 21:54:09,817 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 68 85) no Hoare annotation was computed. [2018-11-22 21:54:09,818 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-22 21:54:09,818 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-22 21:54:09,818 INFO L444 ceAbstractionStarter]: At program point L79-1(line 79) the Hoare annotation is: (or (not (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000.0)) ~huge_floor~0)) (and |main_#t~short8| (= (_ +zero 8 24) main_~x~0) (= (fp (_ bv0 1) (_ bv0 8) (_ bv0 23)) main_~res~0))) [2018-11-22 21:54:09,818 INFO L448 ceAbstractionStarter]: For program point L79-2(line 79) no Hoare annotation was computed. [2018-11-22 21:54:09,818 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 68 85) no Hoare annotation was computed. [2018-11-22 21:54:09,818 INFO L444 ceAbstractionStarter]: At program point L76(line 76) the Hoare annotation is: (or (not (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000.0)) ~huge_floor~0)) (= (_ +zero 8 24) main_~x~0)) [2018-11-22 21:54:09,818 INFO L448 ceAbstractionStarter]: For program point L76-1(line 76) no Hoare annotation was computed. [2018-11-22 21:54:09,818 INFO L448 ceAbstractionStarter]: For program point L79-4(lines 79 82) no Hoare annotation was computed. [2018-11-22 21:54:09,818 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 59 63) no Hoare annotation was computed. [2018-11-22 21:54:09,818 INFO L444 ceAbstractionStarter]: At program point L59-2(lines 59 63) the Hoare annotation is: (or (= |__signbit_float_#in~x| __signbit_float_~x) (not (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000.0)) ~huge_floor~0))) [2018-11-22 21:54:09,819 INFO L448 ceAbstractionStarter]: For program point L59-3(lines 59 63) no Hoare annotation was computed. [2018-11-22 21:54:09,819 INFO L448 ceAbstractionStarter]: For program point __signbit_floatFINAL(lines 56 66) no Hoare annotation was computed. [2018-11-22 21:54:09,819 INFO L451 ceAbstractionStarter]: At program point __signbit_floatENTRY(lines 56 66) the Hoare annotation is: true [2018-11-22 21:54:09,819 INFO L448 ceAbstractionStarter]: For program point __signbit_floatEXIT(lines 56 66) no Hoare annotation was computed. [2018-11-22 21:54:09,824 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 21:54:09,824 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 21:54:09,827 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 21:54:09,827 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 21:54:09,827 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 21:54:09,828 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 21:54:09,828 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 21:54:09,828 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 21:54:09,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:54:09 BoogieIcfgContainer [2018-11-22 21:54:09,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:54:09,830 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:54:09,830 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:54:09,830 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:54:09,830 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:54:04" (3/4) ... [2018-11-22 21:54:09,832 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 21:54:09,836 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 21:54:09,836 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure floor_float [2018-11-22 21:54:09,837 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 21:54:09,837 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_float [2018-11-22 21:54:09,839 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-11-22 21:54:09,840 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-22 21:54:09,840 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 21:54:09,857 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E30)) == huge_floor) || \old(x) == x [2018-11-22 21:54:09,857 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x || !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E30)) == huge_floor) [2018-11-22 21:54:09,879 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_dd3d089e-d319-460f-9c15-ea65a0ee5456/bin-2019/uautomizer/witness.graphml [2018-11-22 21:54:09,879 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:54:09,880 INFO L168 Benchmark]: Toolchain (without parser) took 6480.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 953.2 MB in the beginning and 859.6 MB in the end (delta: 93.6 MB). Peak memory consumption was 243.0 MB. Max. memory is 11.5 GB. [2018-11-22 21:54:09,880 INFO L168 Benchmark]: CDTParser took 0.16 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-22 21:54:09,880 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.35 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 935.8 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:54:09,881 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.63 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:54:09,881 INFO L168 Benchmark]: Boogie Preprocessor took 22.02 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:54:09,881 INFO L168 Benchmark]: RCFGBuilder took 509.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-22 21:54:09,881 INFO L168 Benchmark]: TraceAbstraction took 5677.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 866.4 MB in the end (delta: 250.9 MB). Peak memory consumption was 250.9 MB. Max. memory is 11.5 GB. [2018-11-22 21:54:09,881 INFO L168 Benchmark]: Witness Printer took 49.52 ms. Allocated memory is still 1.2 GB. Free memory was 866.4 MB in the beginning and 859.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:54:09,883 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.16 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 201.35 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 935.8 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.63 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.02 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 509.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5677.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 866.4 MB in the end (delta: 250.9 MB). Peak memory consumption was 250.9 MB. Max. memory is 11.5 GB. * Witness Printer took 49.52 ms. Allocated memory is still 1.2 GB. Free memory was 866.4 MB in the beginning and 859.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: 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: 59]: Loop Invariant [2018-11-22 21:54:09,887 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 21:54:09,887 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 21:54:09,887 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 21:54:09,887 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: \old(x) == x || !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E30)) == huge_floor) - InvariantResult [Line: 16]: Loop Invariant [2018-11-22 21:54:09,888 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 21:54:09,888 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 21:54:09,888 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-22 21:54:09,888 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E30)) == huge_floor) || \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. SAFE Result, 5.6s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 226 SDslu, 728 SDs, 0 SdLazy, 330 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 20 PreInvPairs, 23 NumberOfFragments, 68 HoareAnnotationTreeSize, 20 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 76 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 154 ConstructedInterpolants, 17 QuantifiedInterpolants, 19826 SizeOfPredicates, 25 NumberOfNonLiveVariables, 425 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...