./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1230_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_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1230_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/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 31da98a788dd1938c78053bade42bc512d4e8954 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1230_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/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 31da98a788dd1938c78053bade42bc512d4e8954 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:40:36,950 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:40:36,951 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:40:36,959 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:40:36,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:40:36,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:40:36,960 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:40:36,962 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:40:36,963 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:40:36,963 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:40:36,964 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:40:36,964 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:40:36,965 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:40:36,965 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:40:36,966 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:40:36,967 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:40:36,967 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:40:36,968 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:40:36,970 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:40:36,971 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:40:36,972 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:40:36,973 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:40:36,974 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:40:36,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:40:36,975 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:40:36,975 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:40:36,976 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:40:36,976 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:40:36,977 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:40:36,978 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:40:36,978 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:40:36,978 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:40:36,979 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:40:36,979 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:40:36,979 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:40:36,980 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:40:36,980 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 14:40:36,990 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:40:36,990 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:40:36,990 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:40:36,991 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:40:36,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:40:36,991 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:40:36,991 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:40:36,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:40:36,992 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:40:36,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:40:36,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:40:36,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:40:36,992 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:40:36,992 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:40:36,992 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:40:36,993 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:40:36,993 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:40:36,993 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:40:36,993 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:40:36,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:40:36,993 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:40:36,993 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:40:36,994 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:40:36,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:40:36,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:40:36,994 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:40:36,994 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:40:36,994 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:40:36,994 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:40:36,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:40:36,995 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_24a0df28-bdab-49ec-8c17-1befa4c5054b/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 -> 31da98a788dd1938c78053bade42bc512d4e8954 [2018-11-23 14:40:37,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:40:37,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:40:37,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:40:37,026 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:40:37,027 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:40:37,027 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1230_true-unreach-call.c [2018-11-23 14:40:37,063 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/data/0516300cb/9f6fd5a4218945faa7b1015e96a1cd72/FLAG84f51beb1 [2018-11-23 14:40:37,462 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:40:37,463 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/sv-benchmarks/c/float-newlib/float_req_bl_1230_true-unreach-call.c [2018-11-23 14:40:37,467 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/data/0516300cb/9f6fd5a4218945faa7b1015e96a1cd72/FLAG84f51beb1 [2018-11-23 14:40:37,475 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/data/0516300cb/9f6fd5a4218945faa7b1015e96a1cd72 [2018-11-23 14:40:37,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:40:37,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:40:37,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:40:37,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:40:37,482 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:40:37,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:40:37" (1/1) ... [2018-11-23 14:40:37,485 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 23.11 02:40:37, skipping insertion in model container [2018-11-23 14:40:37,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:40:37" (1/1) ... [2018-11-23 14:40:37,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:40:37,504 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:40:37,618 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:40:37,620 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:40:37,633 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:40:37,645 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:40:37,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:37 WrapperNode [2018-11-23 14:40:37,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:40:37,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:40:37,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:40:37,646 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:40:37,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:37" (1/1) ... [2018-11-23 14:40:37,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:37" (1/1) ... [2018-11-23 14:40:37,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:40:37,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:40:37,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:40:37,662 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:40:37,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:37" (1/1) ... [2018-11-23 14:40:37,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:37" (1/1) ... [2018-11-23 14:40:37,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:37" (1/1) ... [2018-11-23 14:40:37,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:37" (1/1) ... [2018-11-23 14:40:37,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:37" (1/1) ... [2018-11-23 14:40:37,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:37" (1/1) ... [2018-11-23 14:40:37,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:37" (1/1) ... [2018-11-23 14:40:37,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:40:37,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:40:37,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:40:37,714 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:40:37,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:40:37,754 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-11-23 14:40:37,754 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-11-23 14:40:37,754 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2018-11-23 14:40:37,754 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2018-11-23 14:40:37,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:40:37,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:40:37,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 14:40:37,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:40:37,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:40:37,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:40:37,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:40:37,755 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:40:37,755 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:40:37,755 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-11-23 14:40:37,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-11-23 14:40:37,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:40:37,932 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:40:37,932 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 14:40:37,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:37 BoogieIcfgContainer [2018-11-23 14:40:37,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:40:37,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:40:37,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:40:37,936 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:40:37,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:40:37" (1/3) ... [2018-11-23 14:40:37,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6559bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:40:37, skipping insertion in model container [2018-11-23 14:40:37,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:37" (2/3) ... [2018-11-23 14:40:37,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6559bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:40:37, skipping insertion in model container [2018-11-23 14:40:37,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:37" (3/3) ... [2018-11-23 14:40:37,939 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230_true-unreach-call.c [2018-11-23 14:40:37,948 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:40:37,954 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 14:40:37,970 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 14:40:37,996 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:40:37,997 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:40:37,997 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:40:37,997 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:40:37,997 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:40:37,997 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:40:37,997 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:40:37,997 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:40:37,997 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:40:38,010 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-23 14:40:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:40:38,016 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:38,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:38,018 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:38,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:38,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1023937428, now seen corresponding path program 1 times [2018-11-23 14:40:38,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:40:38,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:40:38,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:38,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:38,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:40:38,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:38,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:40:38,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 14:40:38,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 14:40:38,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:40:38,144 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-23 14:40:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:38,160 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2018-11-23 14:40:38,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 14:40:38,161 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-11-23 14:40:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:40:38,169 INFO L225 Difference]: With dead ends: 71 [2018-11-23 14:40:38,170 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 14:40:38,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:40:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 14:40:38,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 14:40:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:40:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 14:40:38,196 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 26 [2018-11-23 14:40:38,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:40:38,197 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 14:40:38,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 14:40:38,197 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 14:40:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 14:40:38,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:38,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:38,198 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:38,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:38,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1596536717, now seen corresponding path program 1 times [2018-11-23 14:40:38,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:40:38,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:40:38,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:38,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:38,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:40:38,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:38,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:40:38,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:40:38,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:40:38,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:38,264 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-23 14:40:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:38,308 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 14:40:38,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:40:38,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 14:40:38,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:40:38,310 INFO L225 Difference]: With dead ends: 51 [2018-11-23 14:40:38,310 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 14:40:38,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 14:40:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 14:40:38,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 14:40:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 14:40:38,318 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2018-11-23 14:40:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:40:38,318 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 14:40:38,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:40:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 14:40:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 14:40:38,319 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:38,319 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] [2018-11-23 14:40:38,320 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:38,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:38,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1459057619, now seen corresponding path program 1 times [2018-11-23 14:40:38,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:40:38,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:40:38,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:38,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:38,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:40:38,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:38,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:40:38,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:40:38,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:40:38,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:38,366 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2018-11-23 14:40:38,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:38,391 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 14:40:38,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:40:38,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 14:40:38,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:40:38,392 INFO L225 Difference]: With dead ends: 55 [2018-11-23 14:40:38,393 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 14:40:38,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 14:40:38,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-11-23 14:40:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 14:40:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 14:40:38,397 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 30 [2018-11-23 14:40:38,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:40:38,397 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 14:40:38,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:40:38,397 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 14:40:38,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 14:40:38,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:38,398 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] [2018-11-23 14:40:38,398 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:38,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:38,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1328357868, now seen corresponding path program 1 times [2018-11-23 14:40:38,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:40:38,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:40:38,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:38,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:38,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:40:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:40:38,445 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=2139095048, |#NULL.offset|=2139095042, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095042] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095042] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095042] [?] RET #75#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret7 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095043.0, |fmin_float_#in~y|=2139095045.0] [?] ~x := #in~x;~y := #in~y; VAL [fmin_float_~x=2139095043.0, fmin_float_~y=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095043.0, |fmin_float_#in~y|=2139095045.0] [?] CALL call #t~ret2 := __fpclassify_float(~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.0] [?] ~x := #in~x;havoc ~w~0; VAL [__fpclassify_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.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);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.0] [?] goto; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.0] [?] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.0] [?] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.0] [?] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.0] [?] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296);#res := 0; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.0, |__fpclassify_float_#res|=0] [?] assume true; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.0, |__fpclassify_float_#res|=0] [?] RET #71#return; VAL [fmin_float_~x=2139095043.0, fmin_float_~y=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095043.0, |fmin_float_#in~y|=2139095045.0, |fmin_float_#t~ret2|=0] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fmin_float_~x=2139095043.0, fmin_float_~y=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095043.0, |fmin_float_#in~y|=2139095045.0, |fmin_float_#t~ret2|=0] [?] assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; VAL [fmin_float_~x=2139095043.0, fmin_float_~y=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095043.0, |fmin_float_#in~y|=2139095045.0, |fmin_float_#res|=2139095045.0] [?] assume true; VAL [fmin_float_~x=2139095043.0, fmin_float_~y=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095043.0, |fmin_float_#in~y|=2139095045.0, |fmin_float_#res|=2139095045.0] [?] RET #79#return; VAL [main_~x~0=2139095043.0, main_~y~0=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret5|=2139095045.0] [?] ~res~0 := #t~ret5;havoc #t~ret5; VAL [main_~res~0=2139095045.0, main_~x~0=2139095043.0, main_~y~0=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := isnan_float(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095045.0] [?] ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_float_~x=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095045.0, |isnan_float_#res|=0] [?] assume true; VAL [isnan_float_~x=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095045.0, |isnan_float_#res|=0] [?] RET #81#return; VAL [main_~res~0=2139095045.0, main_~x~0=2139095043.0, main_~y~0=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=0] [?] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [main_~res~0=2139095045.0, main_~x~0=2139095043.0, main_~y~0=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=0] [?] assume 0 == #t~ret6;havoc #t~ret6; VAL [main_~res~0=2139095045.0, main_~x~0=2139095043.0, main_~y~0=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=2139095045.0, main_~x~0=2139095043.0, main_~y~0=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2139095048, #NULL.offset=2139095042, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L54] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L55] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L56] CALL call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0] [L34-L41] ~x := #in~x; [L34-L41] ~y := #in~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L11-L32] ~x := #in~x; [L12] havoc ~w~0; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095043E9] [L15] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L16] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] ~w~0 := #t~mem0; [L17] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] havoc #t~union1; [L17] havoc #t~mem0; [L15] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L15] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L20-L31] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L22-L31] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L25-L31] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L28-L31] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296); [L31] #res := 0; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095043E9] [L11-L32] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095043E9] [L35] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35-L36] assume 0 == #t~ret2; [L35] havoc #t~ret2; [L36] #res := ~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=2.139095045E9, ~x=2.139095043E9, ~y=2.139095045E9] [L34-L41] ensures true; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=2.139095045E9, ~x=2.139095043E9, ~y=2.139095045E9] [L56] RET call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L56] ~res~0 := #t~ret5; [L56] havoc #t~ret5; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0] [L44] ~x := #in~x; [L44] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095045E9] [L44] ensures true; VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095045E9] [L58] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58-L61] assume 0 == #t~ret6; [L58] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L59] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2139095048, #NULL.offset=2139095042, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L54] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L55] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L56] CALL call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0] [L34-L41] ~x := #in~x; [L34-L41] ~y := #in~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L11-L32] ~x := #in~x; [L12] havoc ~w~0; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095043E9] [L15] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L16] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] ~w~0 := #t~mem0; [L17] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] havoc #t~union1; [L17] havoc #t~mem0; [L15] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L15] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L20-L31] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L22-L31] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L25-L31] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L28-L31] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296); [L31] #res := 0; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095043E9] [L11-L32] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095043E9] [L35] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35-L36] assume 0 == #t~ret2; [L35] havoc #t~ret2; [L36] #res := ~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=2.139095045E9, ~x=2.139095043E9, ~y=2.139095045E9] [L34-L41] ensures true; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=2.139095045E9, ~x=2.139095043E9, ~y=2.139095045E9] [L56] RET call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L56] ~res~0 := #t~ret5; [L56] havoc #t~ret5; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0] [L44] ~x := #in~x; [L44] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095045E9] [L44] ensures true; VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095045E9] [L58] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58-L61] assume 0 == #t~ret6; [L58] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L59] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L54] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L55] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L56] CALL call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L34-L41] ~x := #in~x; [L34-L41] ~y := #in~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L11-L32] ~x := #in~x; [L12] havoc ~w~0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095043E9] [L15] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L16] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] ~w~0 := #t~mem0; [L17] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] havoc #t~union1; [L17] havoc #t~mem0; [L15] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L15] havoc ~#gf_u~0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L20] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L22-L23] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L25-L26] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L28] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L31] #res := 0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095043E9] [L35] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] COND TRUE 0 == #t~ret2 [L35] havoc #t~ret2; [L36] #res := ~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=2.139095045E9, ~x=2.139095043E9, ~y=2.139095045E9] [L56] RET call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L56] ~res~0 := #t~ret5; [L56] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L44] ~x := #in~x; [L44] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095045E9] [L58] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] COND TRUE 0 == #t~ret6 [L58] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L59] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L54] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L55] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L56] CALL call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L34-L41] ~x := #in~x; [L34-L41] ~y := #in~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L11-L32] ~x := #in~x; [L12] havoc ~w~0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095043E9] [L15] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L16] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] ~w~0 := #t~mem0; [L17] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] havoc #t~union1; [L17] havoc #t~mem0; [L15] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L15] havoc ~#gf_u~0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L20] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L22-L23] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L25-L26] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L28] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L31] #res := 0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095043E9] [L35] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] COND TRUE 0 == #t~ret2 [L35] havoc #t~ret2; [L36] #res := ~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=2.139095045E9, ~x=2.139095043E9, ~y=2.139095045E9] [L56] RET call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L56] ~res~0 := #t~ret5; [L56] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L44] ~x := #in~x; [L44] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095045E9] [L58] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] COND TRUE 0 == #t~ret6 [L58] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L59] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L54] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L55] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L56] CALL call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L34-L41] ~x := #in~x; [L34-L41] ~y := #in~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L11-L32] ~x := #in~x; [L12] havoc ~w~0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095043E9] [L15] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L16] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] ~w~0 := #t~mem0; [L17] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] havoc #t~union1; [L17] havoc #t~mem0; [L15] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L15] havoc ~#gf_u~0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L20] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L22-L23] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L25-L26] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L28] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L31] #res := 0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095043E9] [L35] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] COND TRUE 0 == #t~ret2 [L35] havoc #t~ret2; [L36] #res := ~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=2.139095045E9, ~x=2.139095043E9, ~y=2.139095045E9] [L56] RET call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L56] ~res~0 := #t~ret5; [L56] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L44] ~x := #in~x; [L44] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095045E9] [L58] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] COND TRUE 0 == #t~ret6 [L58] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L59] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L54] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L55] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L56] CALL call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L34-L41] ~x := #in~x; [L34-L41] ~y := #in~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L11-L32] ~x := #in~x; [L12] havoc ~w~0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095043E9] [L15] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L16] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] ~w~0 := #t~mem0; [L17] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] havoc #t~union1; [L17] havoc #t~mem0; [L15] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L15] havoc ~#gf_u~0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L20] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L22-L23] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L25-L26] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L28] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L31] #res := 0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095043E9] [L35] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] COND TRUE 0 == #t~ret2 [L35] havoc #t~ret2; [L36] #res := ~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=2.139095045E9, ~x=2.139095043E9, ~y=2.139095045E9] [L56] RET call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L56] ~res~0 := #t~ret5; [L56] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L44] ~x := #in~x; [L44] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095045E9] [L58] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] COND TRUE 0 == #t~ret6 [L58] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L59] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L54] float x = 0.0f / 0.0f; [L55] float y = 0.0f / 0.0f; [L56] CALL, EXPR fmin_float(x, y) VAL [\old(x)=2139095043, \old(y)=2139095045] [L35] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095043] [L12] __uint32_t w; VAL [\old(x)=2139095043, x=2139095043] [L15] ieee_float_shape_type gf_u; [L16] gf_u.value = (x) [L17] EXPR gf_u.word [L17] (w) = gf_u.word [L20] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095043, w=2139095041, x=2139095043] [L22-L23] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095043, w=2139095041, x=2139095043] [L25-L26] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095043, w=2139095041, x=2139095043] [L28] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L31] return 0; VAL [\old(x)=2139095043, \result=0, w=2139095041, x=2139095043] [L35] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2139095043, \old(y)=2139095045, __fpclassify_float(x)=0, x=2139095043, y=2139095045] [L35] COND TRUE __fpclassify_float(x) == 0 [L36] return y; VAL [\old(x)=2139095043, \old(y)=2139095045, \result=2139095045, x=2139095043, y=2139095045] [L56] RET, EXPR fmin_float(x, y) VAL [fmin_float(x, y)=2139095045, x=2139095043, y=2139095045] [L56] float res = fmin_float(x, y); [L58] CALL, EXPR isnan_float(res) VAL [\old(x)=2139095045] [L44] return x != x; VAL [\old(x)=2139095045, \result=0, x=2139095045] [L58] RET, EXPR isnan_float(res) VAL [isnan_float(res)=0, res=2139095045, x=2139095043, y=2139095045] [L58] COND TRUE !isnan_float(res) [L59] __VERIFIER_error() VAL [res=2139095045, x=2139095043, y=2139095045] ----- [2018-11-23 14:40:38,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:40:38 BoogieIcfgContainer [2018-11-23 14:40:38,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:40:38,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:40:38,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:40:38,477 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:40:38,478 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:37" (3/4) ... [2018-11-23 14:40:38,480 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 14:40:38,480 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:40:38,481 INFO L168 Benchmark]: Toolchain (without parser) took 1002.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -113.5 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:38,482 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:40:38,482 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.91 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:38,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.24 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:40:38,483 INFO L168 Benchmark]: Boogie Preprocessor took 51.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:38,484 INFO L168 Benchmark]: RCFGBuilder took 219.27 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:38,484 INFO L168 Benchmark]: TraceAbstraction took 543.74 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: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:38,485 INFO L168 Benchmark]: Witness Printer took 2.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:40:38,487 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.91 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.24 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -193.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 219.27 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 543.74 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: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.88 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: 59]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 44, overapproximation of someBinaryArithmeticFLOAToperation at line 54. Possible FailurePath: [L54] float x = 0.0f / 0.0f; [L55] float y = 0.0f / 0.0f; [L56] CALL, EXPR fmin_float(x, y) VAL [\old(x)=2139095043, \old(y)=2139095045] [L35] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095043] [L12] __uint32_t w; VAL [\old(x)=2139095043, x=2139095043] [L15] ieee_float_shape_type gf_u; [L16] gf_u.value = (x) [L17] EXPR gf_u.word [L17] (w) = gf_u.word [L20] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095043, w=2139095041, x=2139095043] [L22-L23] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095043, w=2139095041, x=2139095043] [L25-L26] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095043, w=2139095041, x=2139095043] [L28] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L31] return 0; VAL [\old(x)=2139095043, \result=0, w=2139095041, x=2139095043] [L35] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2139095043, \old(y)=2139095045, __fpclassify_float(x)=0, x=2139095043, y=2139095045] [L35] COND TRUE __fpclassify_float(x) == 0 [L36] return y; VAL [\old(x)=2139095043, \old(y)=2139095045, \result=2139095045, x=2139095043, y=2139095045] [L56] RET, EXPR fmin_float(x, y) VAL [fmin_float(x, y)=2139095045, x=2139095043, y=2139095045] [L56] float res = fmin_float(x, y); [L58] CALL, EXPR isnan_float(res) VAL [\old(x)=2139095045] [L44] return x != x; VAL [\old(x)=2139095045, \result=0, x=2139095045] [L58] RET, EXPR isnan_float(res) VAL [isnan_float(res)=0, res=2139095045, x=2139095043, y=2139095045] [L58] COND TRUE !isnan_float(res) [L59] __VERIFIER_error() VAL [res=2139095045, x=2139095043, y=2139095045] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 129 SDtfs, 0 SDslu, 152 SDs, 0 SdLazy, 17 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 2582 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 14:40:39,920 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:40:39,922 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:40:39,930 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:40:39,930 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:40:39,931 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:40:39,932 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:40:39,933 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:40:39,934 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:40:39,934 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:40:39,935 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:40:39,935 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:40:39,936 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:40:39,936 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:40:39,937 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:40:39,938 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:40:39,938 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:40:39,939 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:40:39,940 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:40:39,941 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:40:39,942 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:40:39,943 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:40:39,945 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:40:39,945 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:40:39,945 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:40:39,946 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:40:39,947 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:40:39,947 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:40:39,948 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:40:39,948 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:40:39,948 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:40:39,949 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:40:39,949 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:40:39,949 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:40:39,950 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:40:39,950 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:40:39,950 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 14:40:39,960 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:40:39,960 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:40:39,961 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:40:39,961 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:40:39,961 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:40:39,962 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:40:39,962 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:40:39,962 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:40:39,962 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:40:39,962 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:40:39,962 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:40:39,962 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:40:39,963 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:40:39,963 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:40:39,963 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 14:40:39,963 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 14:40:39,963 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:40:39,963 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:40:39,963 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:40:39,963 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:40:39,964 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:40:39,964 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:40:39,964 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:40:39,964 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:40:39,964 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:40:39,964 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:40:39,964 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:40:39,965 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:40:39,965 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 14:40:39,965 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:40:39,965 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 14:40:39,965 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 14:40:39,965 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_24a0df28-bdab-49ec-8c17-1befa4c5054b/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 -> 31da98a788dd1938c78053bade42bc512d4e8954 [2018-11-23 14:40:39,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:40:40,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:40:40,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:40:40,007 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:40:40,007 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:40:40,007 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1230_true-unreach-call.c [2018-11-23 14:40:40,049 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/data/467ed33c0/b7e42e0e7cde4002acbdf2d9946fc66b/FLAG38885c2a7 [2018-11-23 14:40:40,375 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:40:40,376 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/sv-benchmarks/c/float-newlib/float_req_bl_1230_true-unreach-call.c [2018-11-23 14:40:40,380 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/data/467ed33c0/b7e42e0e7cde4002acbdf2d9946fc66b/FLAG38885c2a7 [2018-11-23 14:40:40,809 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/data/467ed33c0/b7e42e0e7cde4002acbdf2d9946fc66b [2018-11-23 14:40:40,812 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:40:40,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:40:40,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:40:40,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:40:40,816 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:40:40,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:40:40" (1/1) ... [2018-11-23 14:40:40,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284314a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:40, skipping insertion in model container [2018-11-23 14:40:40,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:40:40" (1/1) ... [2018-11-23 14:40:40,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:40:40,838 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:40:40,958 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:40:40,961 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:40:40,977 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:40:40,993 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:40:40,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:40 WrapperNode [2018-11-23 14:40:40,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:40:40,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:40:40,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:40:40,994 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:40:40,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:40" (1/1) ... [2018-11-23 14:40:41,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:40" (1/1) ... [2018-11-23 14:40:41,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:40:41,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:40:41,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:40:41,012 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:40:41,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:40" (1/1) ... [2018-11-23 14:40:41,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:40" (1/1) ... [2018-11-23 14:40:41,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:40" (1/1) ... [2018-11-23 14:40:41,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:40" (1/1) ... [2018-11-23 14:40:41,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:40" (1/1) ... [2018-11-23 14:40:41,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:40" (1/1) ... [2018-11-23 14:40:41,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:40" (1/1) ... [2018-11-23 14:40:41,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:40:41,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:40:41,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:40:41,037 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:40:41,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:40:41,121 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-11-23 14:40:41,121 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-11-23 14:40:41,121 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2018-11-23 14:40:41,121 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2018-11-23 14:40:41,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:40:41,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:40:41,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:40:41,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 14:40:41,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:40:41,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:40:41,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 14:40:41,123 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:40:41,123 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:40:41,123 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-11-23 14:40:41,123 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-11-23 14:40:41,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:40:41,258 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 14:40:41,290 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:40:41,290 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 14:40:41,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:41 BoogieIcfgContainer [2018-11-23 14:40:41,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:40:41,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:40:41,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:40:41,294 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:40:41,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:40:40" (1/3) ... [2018-11-23 14:40:41,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fa4cd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:40:41, skipping insertion in model container [2018-11-23 14:40:41,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:40:40" (2/3) ... [2018-11-23 14:40:41,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fa4cd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:40:41, skipping insertion in model container [2018-11-23 14:40:41,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:41" (3/3) ... [2018-11-23 14:40:41,296 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230_true-unreach-call.c [2018-11-23 14:40:41,302 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:40:41,306 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 14:40:41,316 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 14:40:41,336 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:40:41,337 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:40:41,337 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:40:41,337 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:40:41,337 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:40:41,337 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:40:41,337 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:40:41,337 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:40:41,337 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:40:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 14:40:41,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 14:40:41,351 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:41,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:41,353 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:41,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:41,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1898238320, now seen corresponding path program 1 times [2018-11-23 14:40:41,358 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:40:41,359 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 14:40:41,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:41,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:40:41,423 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:40:41,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:41,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:40:41,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 14:40:41,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 14:40:41,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:40:41,449 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 14:40:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:41,465 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2018-11-23 14:40:41,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 14:40:41,466 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 14:40:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:40:41,474 INFO L225 Difference]: With dead ends: 65 [2018-11-23 14:40:41,474 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 14:40:41,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:40:41,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 14:40:41,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 14:40:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 14:40:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-23 14:40:41,503 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 24 [2018-11-23 14:40:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:40:41,503 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-23 14:40:41,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 14:40:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 14:40:41,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 14:40:41,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:41,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:41,506 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:41,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:41,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1313917914, now seen corresponding path program 1 times [2018-11-23 14:40:41,507 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:40:41,507 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 14:40:41,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:41,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:40:41,580 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:40:41,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:41,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:40:41,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:40:41,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:40:41,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:41,593 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 4 states. [2018-11-23 14:40:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:41,624 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 14:40:41,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:40:41,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 14:40:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:40:41,626 INFO L225 Difference]: With dead ends: 46 [2018-11-23 14:40:41,626 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 14:40:41,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 14:40:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 14:40:41,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:40:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 14:40:41,633 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 25 [2018-11-23 14:40:41,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:40:41,633 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 14:40:41,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:40:41,633 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 14:40:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:40:41,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:41,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:41,634 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:41,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:41,635 INFO L82 PathProgramCache]: Analyzing trace with hash 659959827, now seen corresponding path program 1 times [2018-11-23 14:40:41,635 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:40:41,635 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 14:40:41,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:41,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:40:41,699 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:40:41,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:41,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:40:41,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:40:41,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:40:41,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:41,707 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-23 14:40:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:41,731 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 14:40:41,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:40:41,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 14:40:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:40:41,733 INFO L225 Difference]: With dead ends: 49 [2018-11-23 14:40:41,733 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 14:40:41,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 14:40:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 14:40:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:40:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 14:40:41,739 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 26 [2018-11-23 14:40:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:40:41,739 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 14:40:41,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:40:41,740 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 14:40:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 14:40:41,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:41,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:41,741 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:41,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:41,741 INFO L82 PathProgramCache]: Analyzing trace with hash 547015626, now seen corresponding path program 1 times [2018-11-23 14:40:41,741 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:40:41,741 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 14:40:41,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:41,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:40:41,788 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:40:41,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:41,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:40:41,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:40:41,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:40:41,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:41,795 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-23 14:40:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:41,812 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 14:40:41,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:40:41,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 14:40:41,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:40:41,814 INFO L225 Difference]: With dead ends: 49 [2018-11-23 14:40:41,814 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 14:40:41,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:41,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 14:40:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 14:40:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:40:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 14:40:41,818 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 27 [2018-11-23 14:40:41,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:40:41,818 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 14:40:41,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:40:41,818 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 14:40:41,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 14:40:41,819 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:41,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:41,819 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:41,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:41,819 INFO L82 PathProgramCache]: Analyzing trace with hash 167100663, now seen corresponding path program 1 times [2018-11-23 14:40:41,820 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:40:41,820 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 14:40:41,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:41,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:40:41,870 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:40:41,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:41,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:40:41,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:40:41,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:40:41,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:41,878 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-23 14:40:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:41,901 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 14:40:41,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:40:41,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 14:40:41,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:40:41,903 INFO L225 Difference]: With dead ends: 49 [2018-11-23 14:40:41,903 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 14:40:41,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:41,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 14:40:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 14:40:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:40:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 14:40:41,908 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2018-11-23 14:40:41,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:40:41,908 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 14:40:41,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:40:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 14:40:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 14:40:41,909 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:41,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:41,910 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:41,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash -126302344, now seen corresponding path program 1 times [2018-11-23 14:40:41,910 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:40:41,910 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 14:40:41,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:41,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:40:42,075 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:40:42,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:42,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 14:40:42,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 14:40:42,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 14:40:42,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 14:40:42,084 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 9 states. [2018-11-23 14:40:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:42,318 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 14:40:42,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 14:40:42,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 14:40:42,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:40:42,320 INFO L225 Difference]: With dead ends: 43 [2018-11-23 14:40:42,320 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 14:40:42,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 14:40:42,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 14:40:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-23 14:40:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 14:40:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 14:40:42,329 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2018-11-23 14:40:42,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:40:42,329 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 14:40:42,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 14:40:42,329 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 14:40:42,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 14:40:42,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:42,330 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:42,330 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:42,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:42,331 INFO L82 PathProgramCache]: Analyzing trace with hash -114502674, now seen corresponding path program 1 times [2018-11-23 14:40:42,331 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:40:42,331 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/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-23 14:40:42,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:42,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 14:40:42,400 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:40:42,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:42,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:40:42,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:40:42,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:40:42,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:42,408 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 4 states. [2018-11-23 14:40:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:42,420 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-23 14:40:42,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:40:42,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-23 14:40:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:40:42,422 INFO L225 Difference]: With dead ends: 46 [2018-11-23 14:40:42,422 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 14:40:42,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 14:40:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 14:40:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:40:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 14:40:42,427 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 33 [2018-11-23 14:40:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:40:42,428 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 14:40:42,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:40:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 14:40:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 14:40:42,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:42,429 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:42,429 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:42,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:42,429 INFO L82 PathProgramCache]: Analyzing trace with hash -957719579, now seen corresponding path program 1 times [2018-11-23 14:40:42,429 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:40:42,430 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-23 14:40:42,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:42,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 14:40:42,488 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:40:42,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:42,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:40:42,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:40:42,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:40:42,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:42,501 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-23 14:40:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:42,528 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 14:40:42,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:40:42,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 14:40:42,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:40:42,529 INFO L225 Difference]: With dead ends: 49 [2018-11-23 14:40:42,529 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 14:40:42,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 14:40:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 14:40:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:40:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 14:40:42,535 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 34 [2018-11-23 14:40:42,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:40:42,535 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 14:40:42,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:40:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 14:40:42,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 14:40:42,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:42,536 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:42,538 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:42,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:42,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2106425557, now seen corresponding path program 1 times [2018-11-23 14:40:42,538 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:40:42,538 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-23 14:40:42,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:42,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 14:40:42,686 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:40:42,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:42,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 14:40:42,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 14:40:42,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 14:40:42,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 14:40:42,694 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 10 states. [2018-11-23 14:40:42,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:42,910 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-23 14:40:42,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 14:40:42,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 14:40:42,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:40:42,911 INFO L225 Difference]: With dead ends: 44 [2018-11-23 14:40:42,912 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 14:40:42,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 14:40:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 14:40:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 14:40:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 14:40:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-23 14:40:42,915 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 35 [2018-11-23 14:40:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:40:42,915 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-23 14:40:42,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 14:40:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 14:40:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 14:40:42,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:42,916 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:42,916 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:42,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:42,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1487477161, now seen corresponding path program 1 times [2018-11-23 14:40:42,917 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:40:42,917 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-23 14:40:42,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:42,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 14:40:43,025 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:40:43,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:43,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 14:40:43,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 14:40:43,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 14:40:43,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:40:43,033 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 5 states. [2018-11-23 14:40:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:43,131 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 14:40:43,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:40:43,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 14:40:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:40:43,133 INFO L225 Difference]: With dead ends: 46 [2018-11-23 14:40:43,133 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 14:40:43,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 14:40:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 14:40:43,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 14:40:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 14:40:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 14:40:43,137 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2018-11-23 14:40:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:40:43,137 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 14:40:43,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 14:40:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 14:40:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 14:40:43,138 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:43,138 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:43,138 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:43,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:43,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1793715410, now seen corresponding path program 1 times [2018-11-23 14:40:43,139 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:40:43,139 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-11-23 14:40:43,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:43,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 14:40:43,179 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:40:43,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:43,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:40:43,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:40:43,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:40:43,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:43,187 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-23 14:40:43,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:43,193 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 14:40:43,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:40:43,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-23 14:40:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:40:43,194 INFO L225 Difference]: With dead ends: 46 [2018-11-23 14:40:43,195 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 14:40:43,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:43,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 14:40:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 14:40:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 14:40:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 14:40:43,198 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2018-11-23 14:40:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:40:43,199 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 14:40:43,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:40:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 14:40:43,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 14:40:43,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:43,199 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:43,200 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:43,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:43,200 INFO L82 PathProgramCache]: Analyzing trace with hash 15242121, now seen corresponding path program 1 times [2018-11-23 14:40:43,200 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:40:43,200 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-11-23 14:40:43,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:43,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 14:40:43,261 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:40:43,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:43,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:40:43,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:40:43,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:40:43,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:43,269 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-23 14:40:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:43,285 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 14:40:43,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:40:43,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-23 14:40:43,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:40:43,286 INFO L225 Difference]: With dead ends: 46 [2018-11-23 14:40:43,286 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 14:40:43,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:40:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 14:40:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 14:40:43,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 14:40:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 14:40:43,290 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 36 [2018-11-23 14:40:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:40:43,290 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 14:40:43,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:40:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 14:40:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 14:40:43,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:40:43,291 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:40:43,292 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:40:43,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:40:43,292 INFO L82 PathProgramCache]: Analyzing trace with hash -278160886, now seen corresponding path program 1 times [2018-11-23 14:40:43,292 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:40:43,292 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-11-23 14:40:43,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:40:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:40:43,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:40:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 14:40:43,440 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:40:43,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:40:43,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 14:40:43,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 14:40:43,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 14:40:43,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 14:40:43,448 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 9 states. [2018-11-23 14:40:43,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:40:43,555 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 14:40:43,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 14:40:43,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-23 14:40:43,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:40:43,556 INFO L225 Difference]: With dead ends: 33 [2018-11-23 14:40:43,556 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 14:40:43,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 14:40:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 14:40:43,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 14:40:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 14:40:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 14:40:43,557 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-11-23 14:40:43,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:40:43,557 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:40:43,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 14:40:43,558 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 14:40:43,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 14:40:43,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 14:40:43,678 INFO L448 ceAbstractionStarter]: For program point isnan_floatFINAL(line 44) no Hoare annotation was computed. [2018-11-23 14:40:43,678 INFO L451 ceAbstractionStarter]: At program point isnan_floatENTRY(line 44) the Hoare annotation is: true [2018-11-23 14:40:43,678 INFO L448 ceAbstractionStarter]: For program point isnan_floatEXIT(line 44) no Hoare annotation was computed. [2018-11-23 14:40:43,678 INFO L451 ceAbstractionStarter]: At program point fmin_floatENTRY(lines 34 41) the Hoare annotation is: true [2018-11-23 14:40:43,678 INFO L448 ceAbstractionStarter]: For program point fmin_floatEXIT(lines 34 41) no Hoare annotation was computed. [2018-11-23 14:40:43,678 INFO L448 ceAbstractionStarter]: For program point fmin_floatFINAL(lines 34 41) no Hoare annotation was computed. [2018-11-23 14:40:43,678 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-23 14:40:43,678 INFO L448 ceAbstractionStarter]: For program point L40-2(line 40) no Hoare annotation was computed. [2018-11-23 14:40:43,678 INFO L444 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (and (= fmin_float_~x |fmin_float_#in~x|) (= fmin_float_~y |fmin_float_#in~y|)) [2018-11-23 14:40:43,678 INFO L448 ceAbstractionStarter]: For program point L37-1(lines 37 38) no Hoare annotation was computed. [2018-11-23 14:40:43,680 INFO L444 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (and (= fmin_float_~x |fmin_float_#in~x|) (= fmin_float_~y |fmin_float_#in~y|)) [2018-11-23 14:40:43,680 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 35 36) no Hoare annotation was computed. [2018-11-23 14:40:43,680 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 14:40:43,680 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 14:40:43,680 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 14:40:43,680 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 14:40:43,680 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 14:40:43,681 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 14:40:43,681 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 14:40:43,681 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 46 64) the Hoare annotation is: true [2018-11-23 14:40:43,681 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 46 64) no Hoare annotation was computed. [2018-11-23 14:40:43,682 INFO L448 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2018-11-23 14:40:43,682 INFO L444 ceAbstractionStarter]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= main_~res~0 .cse0) (= main_~y~0 .cse0))) [2018-11-23 14:40:43,682 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 58 61) no Hoare annotation was computed. [2018-11-23 14:40:43,682 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 46 64) no Hoare annotation was computed. [2018-11-23 14:40:43,682 INFO L444 ceAbstractionStarter]: At program point L56(line 56) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= main_~y~0 .cse0) (= main_~x~0 .cse0))) [2018-11-23 14:40:43,682 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2018-11-23 14:40:43,682 INFO L448 ceAbstractionStarter]: For program point L56-1(line 56) no Hoare annotation was computed. [2018-11-23 14:40:43,682 INFO L448 ceAbstractionStarter]: For program point __fpclassify_floatFINAL(lines 11 32) no Hoare annotation was computed. [2018-11-23 14:40:43,682 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 31) no Hoare annotation was computed. [2018-11-23 14:40:43,682 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 31) no Hoare annotation was computed. [2018-11-23 14:40:43,682 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 31) no Hoare annotation was computed. [2018-11-23 14:40:43,682 INFO L448 ceAbstractionStarter]: For program point L14-1(lines 14 18) no Hoare annotation was computed. [2018-11-23 14:40:43,682 INFO L451 ceAbstractionStarter]: At program point __fpclassify_floatENTRY(lines 11 32) the Hoare annotation is: true [2018-11-23 14:40:43,682 INFO L451 ceAbstractionStarter]: At program point L14-2(lines 14 18) the Hoare annotation is: true [2018-11-23 14:40:43,683 INFO L448 ceAbstractionStarter]: For program point L14-3(lines 11 32) no Hoare annotation was computed. [2018-11-23 14:40:43,683 INFO L448 ceAbstractionStarter]: For program point __fpclassify_floatEXIT(lines 11 32) no Hoare annotation was computed. [2018-11-23 14:40:43,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:40:43 BoogieIcfgContainer [2018-11-23 14:40:43,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:40:43,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:40:43,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:40:43,690 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:40:43,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:40:41" (3/4) ... [2018-11-23 14:40:43,693 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 14:40:43,697 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_float [2018-11-23 14:40:43,698 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fmin_float [2018-11-23 14:40:43,698 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 14:40:43,698 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 14:40:43,698 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2018-11-23 14:40:43,701 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-11-23 14:40:43,701 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 14:40:43,701 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 14:40:43,731 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_24a0df28-bdab-49ec-8c17-1befa4c5054b/bin-2019/uautomizer/witness.graphml [2018-11-23 14:40:43,732 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:40:43,732 INFO L168 Benchmark]: Toolchain (without parser) took 2919.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 949.7 MB in the beginning and 1.2 GB in the end (delta: -243.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:40:43,733 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-23 14:40:43,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.12 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:43,734 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.94 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:40:43,734 INFO L168 Benchmark]: Boogie Preprocessor took 24.62 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:40:43,734 INFO L168 Benchmark]: RCFGBuilder took 253.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:43,735 INFO L168 Benchmark]: TraceAbstraction took 2399.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -93.2 MB). Peak memory consumption was 297.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:43,735 INFO L168 Benchmark]: Witness Printer took 41.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-11-23 14:40:43,737 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 180.12 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.94 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.62 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 253.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2399.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -93.2 MB). Peak memory consumption was 297.7 MB. Max. memory is 11.5 GB. * Witness Printer took 41.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 59]: 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: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. SAFE Result, 2.3s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 497 SDtfs, 31 SDslu, 1313 SDs, 0 SdLazy, 224 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 13 MinimizatonAttempts, 19 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 28 PreInvPairs, 33 NumberOfFragments, 48 HoareAnnotationTreeSize, 28 FomulaSimplifications, 20 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 389 ConstructedInterpolants, 3 QuantifiedInterpolants, 21389 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1053 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 42/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...