./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1270c.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270c.c -s /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/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 fce8eaffc8fbce8eaab4a2e551ea29a4fcef0871 ................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270c.c -s /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/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 fce8eaffc8fbce8eaab4a2e551ea29a4fcef0871 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:34:28,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:34:28,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:34:28,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:34:28,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:34:28,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:34:28,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:34:28,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:34:28,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:34:28,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:34:28,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:34:28,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:34:28,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:34:28,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:34:28,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:34:28,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:34:28,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:34:28,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:34:28,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:34:28,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:34:28,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:34:28,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:34:28,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:34:28,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:34:28,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:34:28,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:34:28,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:34:28,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:34:28,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:34:28,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:34:28,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:34:28,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:34:28,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:34:28,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:34:28,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:34:28,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:34:28,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:34:28,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:34:28,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:34:28,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:34:28,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:34:28,960 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:34:28,973 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:34:28,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:34:28,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:34:28,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:34:28,979 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:34:28,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:34:28,980 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:34:28,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:34:28,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:34:28,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:34:28,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:34:28,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:34:28,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:34:28,983 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:34:28,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:34:28,983 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:34:28,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:34:28,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:34:28,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:34:28,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:34:28,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:34:28,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:34:28,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:34:28,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:34:28,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:34:28,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:34:28,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:34:28,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:34:28,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/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 -> fce8eaffc8fbce8eaab4a2e551ea29a4fcef0871 [2019-11-16 00:34:29,029 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:34:29,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:34:29,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:34:29,048 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:34:29,049 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:34:29,049 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1270c.c [2019-11-16 00:34:29,114 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/data/fdb8312ae/30a8efd3fe5741dbbb5291d3b2704716/FLAGd38de27b5 [2019-11-16 00:34:29,497 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:34:29,497 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/sv-benchmarks/c/float-newlib/float_req_bl_1270c.c [2019-11-16 00:34:29,505 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/data/fdb8312ae/30a8efd3fe5741dbbb5291d3b2704716/FLAGd38de27b5 [2019-11-16 00:34:29,829 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/data/fdb8312ae/30a8efd3fe5741dbbb5291d3b2704716 [2019-11-16 00:34:29,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:34:29,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:34:29,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:34:29,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:34:29,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:34:29,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:34:29" (1/1) ... [2019-11-16 00:34:29,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df9745b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:29, skipping insertion in model container [2019-11-16 00:34:29,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:34:29" (1/1) ... [2019-11-16 00:34:29,846 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:34:29,867 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:34:30,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:34:30,139 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:34:30,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:34:30,216 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:34:30,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:30 WrapperNode [2019-11-16 00:34:30,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:34:30,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:34:30,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:34:30,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:34:30,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:30" (1/1) ... [2019-11-16 00:34:30,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:30" (1/1) ... [2019-11-16 00:34:30,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:34:30,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:34:30,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:34:30,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:34:30,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:30" (1/1) ... [2019-11-16 00:34:30,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:30" (1/1) ... [2019-11-16 00:34:30,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:30" (1/1) ... [2019-11-16 00:34:30,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:30" (1/1) ... [2019-11-16 00:34:30,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:30" (1/1) ... [2019-11-16 00:34:30,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:30" (1/1) ... [2019-11-16 00:34:30,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:30" (1/1) ... [2019-11-16 00:34:30,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:34:30,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:34:30,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:34:30,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:34:30,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/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 [2019-11-16 00:34:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:34:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-16 00:34:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:34:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-16 00:34:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:34:30,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:34:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:34:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:34:31,069 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:34:31,069 INFO L284 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-16 00:34:31,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:34:31 BoogieIcfgContainer [2019-11-16 00:34:31,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:34:31,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:34:31,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:34:31,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:34:31,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:34:29" (1/3) ... [2019-11-16 00:34:31,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1068deb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:34:31, skipping insertion in model container [2019-11-16 00:34:31,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:30" (2/3) ... [2019-11-16 00:34:31,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1068deb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:34:31, skipping insertion in model container [2019-11-16 00:34:31,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:34:31" (3/3) ... [2019-11-16 00:34:31,079 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270c.c [2019-11-16 00:34:31,087 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:34:31,094 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:34:31,104 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:34:31,128 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:34:31,128 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:34:31,128 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:34:31,128 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:34:31,128 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:34:31,129 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:34:31,129 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:34:31,129 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:34:31,146 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-16 00:34:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:34:31,153 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:31,154 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:31,156 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:34:31,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:31,161 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-11-16 00:34:31,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:31,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092040827] [2019-11-16 00:34:31,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:31,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:31,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:31,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:34:31,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092040827] [2019-11-16 00:34:31,269 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:34:31,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:34:31,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853958535] [2019-11-16 00:34:31,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:34:31,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:34:31,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:34:31,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:34:31,289 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-11-16 00:34:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:31,316 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-11-16 00:34:31,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:34:31,318 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-16 00:34:31,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:31,329 INFO L225 Difference]: With dead ends: 212 [2019-11-16 00:34:31,329 INFO L226 Difference]: Without dead ends: 104 [2019-11-16 00:34:31,333 INFO L600 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 [2019-11-16 00:34:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-16 00:34:31,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-16 00:34:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-16 00:34:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-11-16 00:34:31,375 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-11-16 00:34:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:31,375 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-11-16 00:34:31,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:34:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-11-16 00:34:31,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:34:31,376 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:31,376 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:31,377 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:34:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-11-16 00:34:31,377 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:34:31,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184561946] [2019-11-16 00:34:31,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:31,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:34:31,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:34:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:34:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:34:31,599 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:34:31,600 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:34:31,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:34:31 BoogieIcfgContainer [2019-11-16 00:34:31,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:34:31,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:34:31,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:34:31,634 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:34:31,635 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:34:31" (3/4) ... [2019-11-16 00:34:31,638 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:34:31,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:34:31,640 INFO L168 Benchmark]: Toolchain (without parser) took 1807.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -77.0 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:34:31,641 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:34:31,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:34:31,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.47 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. [2019-11-16 00:34:31,643 INFO L168 Benchmark]: Boogie Preprocessor took 52.79 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:34:31,643 INFO L168 Benchmark]: RCFGBuilder took 734.05 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:34:31,644 INFO L168 Benchmark]: TraceAbstraction took 561.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:34:31,644 INFO L168 Benchmark]: Witness Printer took 4.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:34:31,649 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.47 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. * Boogie Preprocessor took 52.79 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 734.05 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 561.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 235]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 118, overapproximation of bitwiseAnd at line 218. Possible FailurePath: [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L229] float x = __VERIFIER_nondet_float(); [L230] float y = 1.0f / 0.0f; [L82] float a = x, b = y, t1, t2, y1, y2, w; [L83] __int32_t j, k, ha, hb; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L86] ieee_float_shape_type gf_u; [L87] gf_u.value = (x) [L88] EXPR gf_u.word [L88] (ha) = gf_u.word [L90] ha &= 0x7fffffffL VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L92] ieee_float_shape_type gf_u; [L93] gf_u.value = (y) [L94] EXPR gf_u.word [L94] (hb) = gf_u.word [L96] hb &= 0x7fffffffL VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L97] COND FALSE !(hb > ha) [L104] a = x [L105] b = y VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L108] ieee_float_shape_type sf_u; [L109] sf_u.word = (ha) [L110] EXPR sf_u.value [L110] (a) = sf_u.value [L113] ieee_float_shape_type sf_u; [L114] sf_u.word = (hb) [L115] EXPR sf_u.value [L115] (b) = sf_u.value [L117] COND TRUE (ha - hb) > 0xf000000L [L118] return a + b; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L232] float res = __ieee754_hypotf(x, y); [L212] __int32_t ix; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L214] ieee_float_shape_type gf_u; [L215] gf_u.value = (x) [L216] EXPR gf_u.word [L216] (ix) = gf_u.word [L218] ix &= 0x7fffffff [L219] return ((ix) == 0x7f800000L); VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L234] COND TRUE !isinf_float(res) [L235] __VERIFIER_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 107 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 139 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: 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.24-cad4683 [2019-11-16 00:34:33,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:34:33,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:34:33,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:34:33,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:34:33,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:34:33,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:34:33,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:34:33,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:34:33,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:34:33,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:34:33,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:34:33,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:34:33,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:34:33,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:34:33,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:34:33,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:34:33,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:34:33,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:34:33,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:34:33,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:34:33,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:34:33,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:34:33,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:34:33,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:34:33,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:34:33,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:34:33,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:34:33,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:34:33,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:34:33,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:34:33,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:34:33,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:34:33,869 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:34:33,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:34:33,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:34:33,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:34:33,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:34:33,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:34:33,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:34:33,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:34:33,874 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-16 00:34:33,889 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:34:33,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:34:33,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:34:33,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:34:33,891 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:34:33,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:34:33,892 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:34:33,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:34:33,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:34:33,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:34:33,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:34:33,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:34:33,893 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:34:33,893 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:34:33,894 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:34:33,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:34:33,894 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:34:33,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:34:33,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:34:33,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:34:33,895 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:34:33,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:34:33,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:34:33,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:34:33,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:34:33,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:34:33,896 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:34:33,896 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:34:33,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:34:33,897 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:34:33,897 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/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 -> fce8eaffc8fbce8eaab4a2e551ea29a4fcef0871 [2019-11-16 00:34:33,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:34:33,937 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:34:33,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:34:33,941 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:34:33,942 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:34:33,942 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1270c.c [2019-11-16 00:34:33,997 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/data/6a5e322f3/d146830659f04001bb5e40fb08e1116f/FLAGe9d88562c [2019-11-16 00:34:34,356 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:34:34,357 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/sv-benchmarks/c/float-newlib/float_req_bl_1270c.c [2019-11-16 00:34:34,364 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/data/6a5e322f3/d146830659f04001bb5e40fb08e1116f/FLAGe9d88562c [2019-11-16 00:34:34,724 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/uautomizer/data/6a5e322f3/d146830659f04001bb5e40fb08e1116f [2019-11-16 00:34:34,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:34:34,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:34:34,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:34:34,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:34:34,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:34:34,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:34:34" (1/1) ... [2019-11-16 00:34:34,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c084e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:34, skipping insertion in model container [2019-11-16 00:34:34,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:34:34" (1/1) ... [2019-11-16 00:34:34,742 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:34:34,780 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:34:35,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:34:35,034 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:34:35,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:34:35,206 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:34:35,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:35 WrapperNode [2019-11-16 00:34:35,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:34:35,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:34:35,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:34:35,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:34:35,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:35" (1/1) ... [2019-11-16 00:34:35,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:35" (1/1) ... [2019-11-16 00:34:35,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:34:35,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:34:35,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:34:35,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:34:35,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:35" (1/1) ... [2019-11-16 00:34:35,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:35" (1/1) ... [2019-11-16 00:34:35,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:35" (1/1) ... [2019-11-16 00:34:35,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:35" (1/1) ... [2019-11-16 00:34:35,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:35" (1/1) ... [2019-11-16 00:34:35,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:35" (1/1) ... [2019-11-16 00:34:35,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:35" (1/1) ... [2019-11-16 00:34:35,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:34:35,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:34:35,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:34:35,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:34:35,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/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 [2019-11-16 00:34:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:34:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2019-11-16 00:34:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:34:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:34:35,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:34:35,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-16 00:34:35,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:34:35,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:34:42,439 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:34:42,439 INFO L284 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-16 00:34:42,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:34:42 BoogieIcfgContainer [2019-11-16 00:34:42,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:34:42,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:34:42,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:34:42,444 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:34:42,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:34:34" (1/3) ... [2019-11-16 00:34:42,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca32c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:34:42, skipping insertion in model container [2019-11-16 00:34:42,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:34:35" (2/3) ... [2019-11-16 00:34:42,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca32c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:34:42, skipping insertion in model container [2019-11-16 00:34:42,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:34:42" (3/3) ... [2019-11-16 00:34:42,448 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270c.c [2019-11-16 00:34:42,456 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:34:42,463 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:34:42,475 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:34:42,508 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:34:42,508 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:34:42,508 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:34:42,509 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:34:42,509 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:34:42,509 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:34:42,509 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:34:42,509 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:34:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-16 00:34:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:34:42,528 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:42,529 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:42,531 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:34:42,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:42,536 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-11-16 00:34:42,544 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:34:42,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559363307] [2019-11-16 00:34:42,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/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 [2019-11-16 00:34:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:42,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-16 00:34:42,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:34:42,700 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:34:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:34:42,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559363307] [2019-11-16 00:34:42,707 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:34:42,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-16 00:34:42,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132862820] [2019-11-16 00:34:42,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:34:42,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:34:42,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:34:42,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:34:42,729 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-11-16 00:34:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:42,764 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-11-16 00:34:42,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:34:42,765 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-16 00:34:42,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:42,782 INFO L225 Difference]: With dead ends: 212 [2019-11-16 00:34:42,782 INFO L226 Difference]: Without dead ends: 104 [2019-11-16 00:34:42,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:34:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-16 00:34:42,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-16 00:34:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-16 00:34:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-11-16 00:34:42,840 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-11-16 00:34:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:42,840 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-11-16 00:34:42,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:34:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-11-16 00:34:42,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:34:42,846 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:42,846 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:43,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-16 00:34:43,060 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:34:43,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:43,060 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-11-16 00:34:43,061 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:34:43,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47397413] [2019-11-16 00:34:43,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/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 [2019-11-16 00:34:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:43,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:34:43,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:43,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:34:43,424 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:34:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:34:43,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47397413] [2019-11-16 00:34:43,876 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:34:43,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 11 [2019-11-16 00:34:43,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159022970] [2019-11-16 00:34:43,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:34:43,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:34:43,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:34:43,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:34:43,879 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand 11 states. [2019-11-16 00:34:46,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:34:46,496 INFO L93 Difference]: Finished difference Result 444 states and 576 transitions. [2019-11-16 00:34:46,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:34:46,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-11-16 00:34:46,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:34:46,507 INFO L225 Difference]: With dead ends: 444 [2019-11-16 00:34:46,507 INFO L226 Difference]: Without dead ends: 358 [2019-11-16 00:34:46,509 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:34:46,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-16 00:34:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 113. [2019-11-16 00:34:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-16 00:34:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2019-11-16 00:34:46,548 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 21 [2019-11-16 00:34:46,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:34:46,549 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2019-11-16 00:34:46,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:34:46,549 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2019-11-16 00:34:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:34:46,552 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:34:46,555 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:34:46,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-16 00:34:46,768 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:34:46,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:34:46,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1653009985, now seen corresponding path program 1 times [2019-11-16 00:34:46,769 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:34:46,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024735541] [2019-11-16 00:34:46,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/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 [2019-11-16 00:34:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:34:46,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:34:46,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:34:47,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:34:48,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:34:48,039 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:34:49,181 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-11-16 00:34:50,402 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-11-16 00:34:52,378 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-16 00:34:53,905 WARN L191 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-16 00:34:56,222 WARN L191 SmtUtils]: Spent 522.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-16 00:34:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:34:59,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024735541] [2019-11-16 00:34:59,274 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:34:59,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13, 14] imperfect sequences [] total 25 [2019-11-16 00:34:59,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633656097] [2019-11-16 00:34:59,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-16 00:34:59,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:34:59,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-16 00:34:59,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:34:59,277 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand 25 states. [2019-11-16 00:35:01,650 WARN L191 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-11-16 00:35:03,637 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-11-16 00:35:07,123 WARN L191 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-16 00:35:11,391 WARN L191 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-16 00:35:14,732 WARN L191 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-16 00:35:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:14,820 INFO L93 Difference]: Finished difference Result 157 states and 187 transitions. [2019-11-16 00:35:14,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:35:14,821 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-11-16 00:35:14,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:14,821 INFO L225 Difference]: With dead ends: 157 [2019-11-16 00:35:14,822 INFO L226 Difference]: Without dead ends: 64 [2019-11-16 00:35:14,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=271, Invalid=919, Unknown=0, NotChecked=0, Total=1190 [2019-11-16 00:35:14,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-16 00:35:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2019-11-16 00:35:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-16 00:35:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-16 00:35:14,827 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2019-11-16 00:35:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:14,827 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-16 00:35:14,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-16 00:35:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-11-16 00:35:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:35:14,829 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:14,829 INFO L380 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] [2019-11-16 00:35:15,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-16 00:35:15,039 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:15,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:15,040 INFO L82 PathProgramCache]: Analyzing trace with hash -558668800, now seen corresponding path program 1 times [2019-11-16 00:35:15,040 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:35:15,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340647823] [2019-11-16 00:35:15,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/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 [2019-11-16 00:35:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:15,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-16 00:35:15,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:15,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:35:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:15,438 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:35:48,981 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-16 00:35:50,996 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_2_5 (_ BitVec 32)) (v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= c_ULTIMATE.start___ieee754_hypotf_~y (fp ((_ extract 31 31) v_skolemized_v_prenex_2_5) ((_ extract 30 23) v_skolemized_v_prenex_2_5) ((_ extract 22 0) v_skolemized_v_prenex_2_5)))) (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)) (let ((.cse0 (bvand (_ bv2147483647 32) v_skolemized_v_prenex_2_5))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))))) is different from false [2019-11-16 00:35:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:51,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340647823] [2019-11-16 00:35:51,020 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:51,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11, 12] imperfect sequences [] total 21 [2019-11-16 00:35:51,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792378010] [2019-11-16 00:35:51,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-16 00:35:51,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:35:51,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-16 00:35:51,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=321, Unknown=14, NotChecked=36, Total=420 [2019-11-16 00:35:51,023 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 21 states. [2019-11-16 00:35:55,265 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 45 DAG size of output: 18 [2019-11-16 00:35:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:58,139 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-11-16 00:35:58,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:35:58,140 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2019-11-16 00:35:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:58,140 INFO L225 Difference]: With dead ends: 54 [2019-11-16 00:35:58,140 INFO L226 Difference]: Without dead ends: 36 [2019-11-16 00:35:58,141 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 42.4s TimeCoverageRelationStatistics Valid=193, Invalid=607, Unknown=16, NotChecked=54, Total=870 [2019-11-16 00:35:58,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-16 00:35:58,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-11-16 00:35:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-16 00:35:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-11-16 00:35:58,146 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 26 [2019-11-16 00:35:58,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:58,146 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-11-16 00:35:58,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-16 00:35:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-11-16 00:35:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:35:58,148 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:58,148 INFO L380 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] [2019-11-16 00:35:58,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-16 00:35:58,358 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:58,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:58,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1435475906, now seen corresponding path program 1 times [2019-11-16 00:35:58,359 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:35:58,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563303636] [2019-11-16 00:35:58,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/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 [2019-11-16 00:35:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:58,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:35:58,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:58,596 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:35:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:58,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563303636] [2019-11-16 00:35:58,738 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:35:58,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 11 [2019-11-16 00:35:58,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534255861] [2019-11-16 00:35:58,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:35:58,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:35:58,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:35:58,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:35:58,740 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2019-11-16 00:35:58,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:35:58,959 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2019-11-16 00:35:58,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:35:58,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-11-16 00:35:58,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:35:58,962 INFO L225 Difference]: With dead ends: 36 [2019-11-16 00:35:58,962 INFO L226 Difference]: Without dead ends: 27 [2019-11-16 00:35:58,962 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:35:58,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-16 00:35:58,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-16 00:35:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-16 00:35:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2019-11-16 00:35:58,966 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 26 [2019-11-16 00:35:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:35:58,966 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2019-11-16 00:35:58,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:35:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2019-11-16 00:35:58,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:35:58,968 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:35:58,968 INFO L380 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] [2019-11-16 00:35:59,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-16 00:35:59,176 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:35:59,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:35:59,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2115534276, now seen corresponding path program 1 times [2019-11-16 00:35:59,180 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:35:59,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557025928] [2019-11-16 00:35:59,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_05f76af4-a744-498d-b6b3-889d97729424/bin/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 [2019-11-16 00:35:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:35:59,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-16 00:35:59,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:35:59,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:35:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:35:59,550 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:36:02,011 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_5_5 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_5) ((_ extract 30 23) v_skolemized_v_prenex_5_5) ((_ extract 22 0) v_skolemized_v_prenex_5_5)) (let ((.cse0 (bvand (_ bv2147483647 32) c_ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_5) (_ bv2155872256 32)) (_ bv0 32)))) is different from false [2019-11-16 00:36:04,037 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_2_7 (_ BitVec 32)) (v_skolemized_v_prenex_5_5 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_5) ((_ extract 30 23) v_skolemized_v_prenex_5_5) ((_ extract 22 0) v_skolemized_v_prenex_5_5)) (let ((.cse0 (bvand (_ bv2147483647 32) v_skolemized_v_prenex_2_7))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_5) (_ bv2155872256 32)) (_ bv0 32)) (not (= c_ULTIMATE.start___ieee754_hypotf_~y (fp ((_ extract 31 31) v_skolemized_v_prenex_2_7) ((_ extract 30 23) v_skolemized_v_prenex_2_7) ((_ extract 22 0) v_skolemized_v_prenex_2_7)))))) is different from false [2019-11-16 00:36:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:36:04,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557025928] [2019-11-16 00:36:04,053 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:04,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12, 13] imperfect sequences [] total 23 [2019-11-16 00:36:04,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008352453] [2019-11-16 00:36:04,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-16 00:36:04,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:36:04,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-16 00:36:04,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=374, Unknown=2, NotChecked=78, Total=506 [2019-11-16 00:36:04,056 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 23 states. [2019-11-16 00:36:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:04,922 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-11-16 00:36:04,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:36:04,922 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-11-16 00:36:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:36:04,923 INFO L225 Difference]: With dead ends: 27 [2019-11-16 00:36:04,923 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:36:04,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=169, Invalid=649, Unknown=2, NotChecked=110, Total=930 [2019-11-16 00:36:04,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:36:04,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:36:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:36:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:36:04,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-11-16 00:36:04,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:36:04,924 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:36:04,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-16 00:36:04,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:36:04,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:36:05,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-16 00:36:05,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:36:05,303 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2019-11-16 00:36:07,110 WARN L191 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 97 DAG size of output: 67 [2019-11-16 00:36:12,902 WARN L191 SmtUtils]: Spent 5.79 s on a formula simplification. DAG size of input: 126 DAG size of output: 90 [2019-11-16 00:36:17,809 WARN L191 SmtUtils]: Spent 4.89 s on a formula simplification. DAG size of input: 107 DAG size of output: 74 [2019-11-16 00:36:17,860 INFO L443 ceAbstractionStarter]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2019-11-16 00:36:17,860 INFO L443 ceAbstractionStarter]: For program point L35-3(lines 35 39) no Hoare annotation was computed. [2019-11-16 00:36:17,860 INFO L443 ceAbstractionStarter]: For program point L35-5(lines 35 39) no Hoare annotation was computed. [2019-11-16 00:36:17,860 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 237) no Hoare annotation was computed. [2019-11-16 00:36:17,860 INFO L443 ceAbstractionStarter]: For program point L36-2(lines 36 37) no Hoare annotation was computed. [2019-11-16 00:36:17,860 INFO L439 ceAbstractionStarter]: At program point L36-3(lines 36 37) the Hoare annotation is: false [2019-11-16 00:36:17,861 INFO L443 ceAbstractionStarter]: For program point L36-4(lines 36 37) no Hoare annotation was computed. [2019-11-16 00:36:17,861 INFO L443 ceAbstractionStarter]: For program point L36-7(lines 36 37) no Hoare annotation was computed. [2019-11-16 00:36:17,861 INFO L439 ceAbstractionStarter]: At program point L36-8(lines 36 37) the Hoare annotation is: false [2019-11-16 00:36:17,861 INFO L443 ceAbstractionStarter]: For program point L36-9(lines 36 37) no Hoare annotation was computed. [2019-11-16 00:36:17,861 INFO L443 ceAbstractionStarter]: For program point L235(line 235) no Hoare annotation was computed. [2019-11-16 00:36:17,861 INFO L446 ceAbstractionStarter]: At program point L238(lines 222 239) the Hoare annotation is: true [2019-11-16 00:36:17,861 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 143) no Hoare annotation was computed. [2019-11-16 00:36:17,861 INFO L443 ceAbstractionStarter]: For program point L139-1(lines 121 144) no Hoare annotation was computed. [2019-11-16 00:36:17,861 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2019-11-16 00:36:17,861 INFO L439 ceAbstractionStarter]: At program point L73-2(lines 73 77) the Hoare annotation is: false [2019-11-16 00:36:17,862 INFO L443 ceAbstractionStarter]: For program point L73-3(lines 73 77) no Hoare annotation was computed. [2019-11-16 00:36:17,862 INFO L443 ceAbstractionStarter]: For program point L73-5(lines 73 77) no Hoare annotation was computed. [2019-11-16 00:36:17,862 INFO L439 ceAbstractionStarter]: At program point L73-6(lines 73 77) the Hoare annotation is: false [2019-11-16 00:36:17,862 INFO L443 ceAbstractionStarter]: For program point L73-7(lines 73 77) no Hoare annotation was computed. [2019-11-16 00:36:17,862 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2019-11-16 00:36:17,862 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 81 208) no Hoare annotation was computed. [2019-11-16 00:36:17,862 INFO L439 ceAbstractionStarter]: At program point L207(lines 81 208) the Hoare annotation is: (let ((.cse2 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (let ((.cse0 (let ((.cse9 (= ULTIMATE.start___ieee754_hypotf_~y .cse2))) (or (and .cse9 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)))) (and .cse9 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26) ULTIMATE.start___ieee754_hypotf_~ha~0)))))) (.cse1 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (or (and (and .cse0 (= .cse1 .cse2) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= |ULTIMATE.start___ieee754_hypotf_#res| .cse3) (= .cse3 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= ULTIMATE.start___ieee754_hypotf_~w~0 .cse4) (= .cse4 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse5 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~b~0 .cse5))))) (let ((.cse8 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and .cse0 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse6 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse7 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and (bvsgt (bvadd (bvneg .cse6) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= |ULTIMATE.start___ieee754_hypotf_#res| (fp.add roundNearestTiesToEven .cse7 (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (= .cse7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (= .cse8 .cse2) (= ULTIMATE.start___ieee754_hypotf_~b~0 .cse1) (= .cse8 ULTIMATE.start___ieee754_hypotf_~a~0) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0))))))) [2019-11-16 00:36:17,862 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2019-11-16 00:36:17,863 INFO L443 ceAbstractionStarter]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2019-11-16 00:36:17,863 INFO L443 ceAbstractionStarter]: For program point L42-3(lines 42 43) no Hoare annotation was computed. [2019-11-16 00:36:17,863 INFO L443 ceAbstractionStarter]: For program point L42-5(lines 42 43) no Hoare annotation was computed. [2019-11-16 00:36:17,863 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 198) no Hoare annotation was computed. [2019-11-16 00:36:17,863 INFO L443 ceAbstractionStarter]: For program point L175-2(lines 81 208) no Hoare annotation was computed. [2019-11-16 00:36:17,863 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 176 180) no Hoare annotation was computed. [2019-11-16 00:36:17,863 INFO L439 ceAbstractionStarter]: At program point L176-2(lines 176 180) the Hoare annotation is: false [2019-11-16 00:36:17,863 INFO L443 ceAbstractionStarter]: For program point L176-3(lines 176 180) no Hoare annotation was computed. [2019-11-16 00:36:17,863 INFO L439 ceAbstractionStarter]: At program point L78(lines 14 79) the Hoare annotation is: false [2019-11-16 00:36:17,863 INFO L439 ceAbstractionStarter]: At program point L78-1(lines 14 79) the Hoare annotation is: false [2019-11-16 00:36:17,863 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 172) no Hoare annotation was computed. [2019-11-16 00:36:17,864 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 116) no Hoare annotation was computed. [2019-11-16 00:36:17,864 INFO L443 ceAbstractionStarter]: For program point L112-1(lines 81 208) no Hoare annotation was computed. [2019-11-16 00:36:17,864 INFO L443 ceAbstractionStarter]: For program point L112-2(lines 81 208) no Hoare annotation was computed. [2019-11-16 00:36:17,864 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 171) no Hoare annotation was computed. [2019-11-16 00:36:17,864 INFO L443 ceAbstractionStarter]: For program point L213-1(lines 213 217) no Hoare annotation was computed. [2019-11-16 00:36:17,864 INFO L439 ceAbstractionStarter]: At program point L213-2(lines 213 217) the Hoare annotation is: (let ((.cse2 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (let ((.cse0 (let ((.cse12 (= ULTIMATE.start___ieee754_hypotf_~y .cse2))) (or (and .cse12 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)))) (and .cse12 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26) ULTIMATE.start___ieee754_hypotf_~ha~0)))))) (.cse1 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (or (and (and .cse0 (= .cse1 .cse2) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= |ULTIMATE.start___ieee754_hypotf_#res| .cse3) (= .cse3 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse4 ULTIMATE.start_isinf_float_~x) (= .cse4 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= ULTIMATE.start___ieee754_hypotf_~w~0 .cse5) (= .cse5 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse6 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~b~0 .cse6))))) (let ((.cse11 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and .cse0 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse7 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse8 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and (bvsgt (bvadd (bvneg .cse7) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= |ULTIMATE.start___ieee754_hypotf_#res| (fp.add roundNearestTiesToEven .cse8 (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (= .cse8 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse10 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse9 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and (= ULTIMATE.start_isinf_float_~x (fp.add roundNearestTiesToEven .cse9 (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (bvsgt (bvadd (bvneg .cse10) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= .cse9 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (= .cse11 .cse2) (= ULTIMATE.start___ieee754_hypotf_~b~0 .cse1) (= .cse11 ULTIMATE.start___ieee754_hypotf_~a~0) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0))))))) [2019-11-16 00:36:17,865 INFO L443 ceAbstractionStarter]: For program point L213-3(lines 213 217) no Hoare annotation was computed. [2019-11-16 00:36:17,865 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 171) no Hoare annotation was computed. [2019-11-16 00:36:17,865 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2019-11-16 00:36:17,865 INFO L439 ceAbstractionStarter]: At program point L149-2(lines 149 153) the Hoare annotation is: false [2019-11-16 00:36:17,865 INFO L443 ceAbstractionStarter]: For program point L149-3(lines 149 153) no Hoare annotation was computed. [2019-11-16 00:36:17,865 INFO L439 ceAbstractionStarter]: At program point L50-2(lines 50 59) the Hoare annotation is: false [2019-11-16 00:36:17,865 INFO L443 ceAbstractionStarter]: For program point L50-3(lines 14 79) no Hoare annotation was computed. [2019-11-16 00:36:17,865 INFO L439 ceAbstractionStarter]: At program point L50-6(lines 50 59) the Hoare annotation is: false [2019-11-16 00:36:17,865 INFO L443 ceAbstractionStarter]: For program point L50-7(lines 14 79) no Hoare annotation was computed. [2019-11-16 00:36:17,865 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2019-11-16 00:36:17,865 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-11-16 00:36:17,866 INFO L439 ceAbstractionStarter]: At program point L85-2(lines 85 89) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_hypotf_~y (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~b~0 .cse0))))) [2019-11-16 00:36:17,866 INFO L443 ceAbstractionStarter]: For program point L85-3(lines 85 89) no Hoare annotation was computed. [2019-11-16 00:36:17,866 INFO L443 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-16 00:36:17,866 INFO L443 ceAbstractionStarter]: For program point L52-2(lines 52 56) no Hoare annotation was computed. [2019-11-16 00:36:17,866 INFO L439 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-16 00:36:17,866 INFO L443 ceAbstractionStarter]: For program point L52-3(lines 52 56) no Hoare annotation was computed. [2019-11-16 00:36:17,866 INFO L443 ceAbstractionStarter]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2019-11-16 00:36:17,866 INFO L443 ceAbstractionStarter]: For program point L52-5(lines 52 56) no Hoare annotation was computed. [2019-11-16 00:36:17,866 INFO L443 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-16 00:36:17,866 INFO L439 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-11-16 00:36:17,866 INFO L443 ceAbstractionStarter]: For program point L19-7(lines 19 23) no Hoare annotation was computed. [2019-11-16 00:36:17,867 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:36:17,867 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 185 189) no Hoare annotation was computed. [2019-11-16 00:36:17,867 INFO L439 ceAbstractionStarter]: At program point L185-2(lines 185 189) the Hoare annotation is: false [2019-11-16 00:36:17,867 INFO L443 ceAbstractionStarter]: For program point L185-3(lines 185 189) no Hoare annotation was computed. [2019-11-16 00:36:17,867 INFO L439 ceAbstractionStarter]: At program point L219(lines 211 220) the Hoare annotation is: (let ((.cse7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (let ((.cse0 (let ((.cse16 (= ULTIMATE.start___ieee754_hypotf_~y .cse7))) (or (and .cse16 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)))) (and .cse16 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26) ULTIMATE.start___ieee754_hypotf_~ha~0)))))) (.cse8 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))) (.cse5 (= (bvadd |ULTIMATE.start_isinf_float_#res| (_ bv4294967295 32)) (_ bv0 32)))) (or (let ((.cse6 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and .cse0 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse1 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse2 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and (bvsgt (bvadd (bvneg .cse1) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= |ULTIMATE.start___ieee754_hypotf_#res| (fp.add roundNearestTiesToEven .cse2 (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= .cse2 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse4 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse3 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and (= ULTIMATE.start_isinf_float_~x (fp.add roundNearestTiesToEven .cse3 (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (bvsgt (bvadd (bvneg .cse4) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= .cse3 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) .cse5 (= .cse6 .cse7) (= ULTIMATE.start___ieee754_hypotf_~b~0 .cse8) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse10 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse9 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) (fp.add roundNearestTiesToEven .cse9 (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (bvsgt (bvadd (bvneg .cse10) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= .cse9 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (= .cse6 ULTIMATE.start___ieee754_hypotf_~a~0) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (and .cse0 (= .cse8 .cse7) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse11 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= |ULTIMATE.start___ieee754_hypotf_#res| .cse11) (= .cse11 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse12 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse12 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) .cse12)))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse13 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse13 ULTIMATE.start_isinf_float_~x) (= .cse13 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse14 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= ULTIMATE.start___ieee754_hypotf_~w~0 .cse14) (= .cse14 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) .cse5 (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse15 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse15 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~b~0 .cse15)))))))) [2019-11-16 00:36:17,867 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 144) no Hoare annotation was computed. [2019-11-16 00:36:17,868 INFO L443 ceAbstractionStarter]: For program point L121-1(lines 81 208) no Hoare annotation was computed. [2019-11-16 00:36:17,868 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 129) no Hoare annotation was computed. [2019-11-16 00:36:17,868 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:36:17,868 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2019-11-16 00:36:17,868 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 91 95) no Hoare annotation was computed. [2019-11-16 00:36:17,868 INFO L443 ceAbstractionStarter]: For program point L124-2(lines 122 129) no Hoare annotation was computed. [2019-11-16 00:36:17,868 INFO L439 ceAbstractionStarter]: At program point L91-2(lines 91 95) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_hypotf_~y (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)))) (and (= .cse0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~b~0 .cse0)))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) [2019-11-16 00:36:17,868 INFO L443 ceAbstractionStarter]: For program point L91-3(lines 91 95) no Hoare annotation was computed. [2019-11-16 00:36:17,868 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 191 195) no Hoare annotation was computed. [2019-11-16 00:36:17,869 INFO L439 ceAbstractionStarter]: At program point L191-2(lines 191 195) the Hoare annotation is: false [2019-11-16 00:36:17,869 INFO L443 ceAbstractionStarter]: For program point L191-3(lines 191 195) no Hoare annotation was computed. [2019-11-16 00:36:17,869 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 27) no Hoare annotation was computed. [2019-11-16 00:36:17,869 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2019-11-16 00:36:17,869 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 126 127) no Hoare annotation was computed. [2019-11-16 00:36:17,869 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 70) no Hoare annotation was computed. [2019-11-16 00:36:17,869 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:36:17,869 INFO L443 ceAbstractionStarter]: For program point L61-1(lines 61 70) no Hoare annotation was computed. [2019-11-16 00:36:17,869 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 161 165) no Hoare annotation was computed. [2019-11-16 00:36:17,869 INFO L439 ceAbstractionStarter]: At program point L161-2(lines 161 165) the Hoare annotation is: false [2019-11-16 00:36:17,869 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 30) no Hoare annotation was computed. [2019-11-16 00:36:17,870 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 29 30) no Hoare annotation was computed. [2019-11-16 00:36:17,870 INFO L443 ceAbstractionStarter]: For program point L63(lines 63 69) no Hoare annotation was computed. [2019-11-16 00:36:17,870 INFO L443 ceAbstractionStarter]: For program point L63-2(lines 63 69) no Hoare annotation was computed. [2019-11-16 00:36:17,870 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 106) no Hoare annotation was computed. [2019-11-16 00:36:17,870 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 32) no Hoare annotation was computed. [2019-11-16 00:36:17,870 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 31 32) no Hoare annotation was computed. [2019-11-16 00:36:17,870 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 68) no Hoare annotation was computed. [2019-11-16 00:36:17,870 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:36:17,870 INFO L443 ceAbstractionStarter]: For program point L65-3(lines 65 68) no Hoare annotation was computed. [2019-11-16 00:36:17,870 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 235) no Hoare annotation was computed. [2019-11-16 00:36:17,870 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 170) no Hoare annotation was computed. [2019-11-16 00:36:17,871 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 157 171) no Hoare annotation was computed. [2019-11-16 00:36:17,871 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 200 204) no Hoare annotation was computed. [2019-11-16 00:36:17,871 INFO L439 ceAbstractionStarter]: At program point L200-2(lines 200 204) the Hoare annotation is: false [2019-11-16 00:36:17,871 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2019-11-16 00:36:17,871 INFO L443 ceAbstractionStarter]: For program point L200-3(lines 200 204) no Hoare annotation was computed. [2019-11-16 00:36:17,871 INFO L439 ceAbstractionStarter]: At program point L134-2(lines 134 138) the Hoare annotation is: false [2019-11-16 00:36:17,871 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2019-11-16 00:36:17,876 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:555) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:255) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:212) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:36:17,880 INFO L168 Benchmark]: Toolchain (without parser) took 103152.10 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 260.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -110.5 MB). Peak memory consumption was 150.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:17,881 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:36:17,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -193.1 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:17,882 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.19 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. [2019-11-16 00:36:17,883 INFO L168 Benchmark]: Boogie Preprocessor took 105.36 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:17,883 INFO L168 Benchmark]: RCFGBuilder took 7056.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:17,884 INFO L168 Benchmark]: TraceAbstraction took 95437.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.6 MB). Peak memory consumption was 129.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:17,888 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 478.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -193.1 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.19 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. * Boogie Preprocessor took 105.36 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 7056.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 95437.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.6 MB). Peak memory consumption was 129.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 235]: 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...