./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1270a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/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 fa333650cb1e4cf3e280683e8b2ad72d19029b0d ............................................................................................................................................................................................................................................................................................................ 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_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/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 fa333650cb1e4cf3e280683e8b2ad72d19029b0d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-678e011 [2019-11-20 03:18:42,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:18:42,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:18:42,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:18:42,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:18:42,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:18:42,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:18:42,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:18:42,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:18:42,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:18:42,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:18:42,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:18:42,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:18:42,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:18:42,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:18:42,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:18:42,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:18:42,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:18:42,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:18:42,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:18:42,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:18:42,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:18:42,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:18:42,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:18:42,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:18:42,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:18:42,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:18:42,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:18:42,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:18:42,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:18:42,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:18:42,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:18:42,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:18:42,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:18:42,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:18:42,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:18:42,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:18:42,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:18:42,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:18:42,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:18:42,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:18:42,944 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:18:42,956 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:18:42,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:18:42,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:18:42,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:18:42,957 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:18:42,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:18:42,957 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:18:42,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:18:42,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:18:42,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:18:42,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:18:42,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:18:42,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:18:42,959 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:18:42,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:18:42,959 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:18:42,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:18:42,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:18:42,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:18:42,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:18:42,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:18:42,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:18:42,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:18:42,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:18:42,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:18:42,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:18:42,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:18:42,961 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:18:42,961 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_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/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 -> fa333650cb1e4cf3e280683e8b2ad72d19029b0d [2019-11-20 03:18:43,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:18:43,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:18:43,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:18:43,108 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:18:43,108 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:18:43,109 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1270a.c [2019-11-20 03:18:43,158 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/data/480431dfb/65b6aa61528348728896c815158fd08c/FLAG4fe008c65 [2019-11-20 03:18:43,581 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:18:43,592 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/sv-benchmarks/c/float-newlib/float_req_bl_1270a.c [2019-11-20 03:18:43,599 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/data/480431dfb/65b6aa61528348728896c815158fd08c/FLAG4fe008c65 [2019-11-20 03:18:43,610 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/data/480431dfb/65b6aa61528348728896c815158fd08c [2019-11-20 03:18:43,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:18:43,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:18:43,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:18:43,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:18:43,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:18:43,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:18:43" (1/1) ... [2019-11-20 03:18:43,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382195c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:43, skipping insertion in model container [2019-11-20 03:18:43,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:18:43" (1/1) ... [2019-11-20 03:18:43,627 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:18:43,661 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:18:44,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:18:44,009 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:18:44,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:18:44,119 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:18:44,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:44 WrapperNode [2019-11-20 03:18:44,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:18:44,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:18:44,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:18:44,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:18:44,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:44" (1/1) ... [2019-11-20 03:18:44,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:44" (1/1) ... [2019-11-20 03:18:44,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:18:44,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:18:44,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:18:44,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:18:44,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:44" (1/1) ... [2019-11-20 03:18:44,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:44" (1/1) ... [2019-11-20 03:18:44,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:44" (1/1) ... [2019-11-20 03:18:44,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:44" (1/1) ... [2019-11-20 03:18:44,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:44" (1/1) ... [2019-11-20 03:18:44,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:44" (1/1) ... [2019-11-20 03:18:44,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:44" (1/1) ... [2019-11-20 03:18:44,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:18:44,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:18:44,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:18:44,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:18:44,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/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-20 03:18:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 03:18:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-20 03:18:44,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 03:18:44,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-20 03:18:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:18:44,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:18:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 03:18:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 03:18:45,160 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:18:45,160 INFO L285 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-20 03:18:45,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:18:45 BoogieIcfgContainer [2019-11-20 03:18:45,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:18:45,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:18:45,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:18:45,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:18:45,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:18:43" (1/3) ... [2019-11-20 03:18:45,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726e0724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:18:45, skipping insertion in model container [2019-11-20 03:18:45,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:44" (2/3) ... [2019-11-20 03:18:45,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726e0724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:18:45, skipping insertion in model container [2019-11-20 03:18:45,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:18:45" (3/3) ... [2019-11-20 03:18:45,169 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270a.c [2019-11-20 03:18:45,178 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:18:45,184 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:18:45,194 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:18:45,217 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:18:45,217 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:18:45,217 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:18:45,217 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:18:45,218 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:18:45,218 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:18:45,218 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:18:45,218 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:18:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-20 03:18:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 03:18:45,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:18:45,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:18:45,243 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:18:45,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:18:45,248 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-11-20 03:18:45,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:18:45,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930488342] [2019-11-20 03:18:45,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:18:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:18:45,366 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-20 03:18:45,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930488342] [2019-11-20 03:18:45,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:18:45,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:18:45,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924163835] [2019-11-20 03:18:45,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 03:18:45,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:18:45,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 03:18:45,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 03:18:45,387 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-11-20 03:18:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:18:45,414 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-11-20 03:18:45,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 03:18:45,416 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-20 03:18:45,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:18:45,426 INFO L225 Difference]: With dead ends: 212 [2019-11-20 03:18:45,426 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 03:18:45,429 INFO L630 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-20 03:18:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 03:18:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 03:18:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 03:18:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-11-20 03:18:45,468 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-11-20 03:18:45,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:18:45,468 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-11-20 03:18:45,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 03:18:45,469 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-11-20 03:18:45,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 03:18:45,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:18:45,470 INFO L410 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-20 03:18:45,470 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:18:45,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:18:45,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-11-20 03:18:45,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:18:45,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196676483] [2019-11-20 03:18:45,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:18:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:18:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 03:18:45,608 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 03:18:45,608 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 03:18:45,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:18:45 BoogieIcfgContainer [2019-11-20 03:18:45,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:18:45,652 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:18:45,652 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:18:45,652 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:18:45,653 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:18:45" (3/4) ... [2019-11-20 03:18:45,656 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 03:18:45,656 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:18:45,658 INFO L168 Benchmark]: Toolchain (without parser) took 2043.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.2 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:18:45,658 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:18:45,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 505.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.2 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -260.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-11-20 03:18:45,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-20 03:18:45,659 INFO L168 Benchmark]: Boogie Preprocessor took 83.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:18:45,660 INFO L168 Benchmark]: RCFGBuilder took 866.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:18:45,660 INFO L168 Benchmark]: TraceAbstraction took 488.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:18:45,661 INFO L168 Benchmark]: Witness Printer took 4.29 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-20 03:18:45,663 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 505.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.2 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -260.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 866.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 488.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 234]: 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 = 1.0f / 0.0f; [L230] float y = __VERIFIER_nondet_float(); [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] [L231] 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] [L233] COND TRUE !isinf_float(res) [L234] __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.4s, 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.0s 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-678e011 [2019-11-20 03:18:47,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:18:47,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:18:47,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:18:47,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:18:47,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:18:47,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:18:47,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:18:47,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:18:47,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:18:47,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:18:47,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:18:47,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:18:47,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:18:47,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:18:47,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:18:47,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:18:47,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:18:47,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:18:47,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:18:47,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:18:47,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:18:47,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:18:47,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:18:47,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:18:47,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:18:47,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:18:47,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:18:47,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:18:47,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:18:47,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:18:47,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:18:47,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:18:47,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:18:47,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:18:47,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:18:47,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:18:47,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:18:47,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:18:47,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:18:47,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:18:47,573 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 03:18:47,587 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:18:47,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:18:47,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:18:47,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:18:47,589 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:18:47,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:18:47,590 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:18:47,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:18:47,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:18:47,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:18:47,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:18:47,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:18:47,591 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 03:18:47,591 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 03:18:47,591 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:18:47,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:18:47,595 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:18:47,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:18:47,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:18:47,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:18:47,596 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:18:47,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:18:47,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:18:47,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:18:47,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:18:47,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:18:47,597 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 03:18:47,598 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 03:18:47,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:18:47,598 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 03:18:47,598 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_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/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 -> fa333650cb1e4cf3e280683e8b2ad72d19029b0d [2019-11-20 03:18:47,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:18:47,861 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:18:47,866 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:18:47,868 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:18:47,868 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:18:47,869 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1270a.c [2019-11-20 03:18:47,930 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/data/4f24bc32b/6205aec69f5246f181980969fe80cc64/FLAGf36fc1868 [2019-11-20 03:18:48,341 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:18:48,351 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/sv-benchmarks/c/float-newlib/float_req_bl_1270a.c [2019-11-20 03:18:48,358 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/data/4f24bc32b/6205aec69f5246f181980969fe80cc64/FLAGf36fc1868 [2019-11-20 03:18:48,739 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/data/4f24bc32b/6205aec69f5246f181980969fe80cc64 [2019-11-20 03:18:48,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:18:48,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:18:48,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:18:48,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:18:48,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:18:48,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:18:48" (1/1) ... [2019-11-20 03:18:48,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e76791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:48, skipping insertion in model container [2019-11-20 03:18:48,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:18:48" (1/1) ... [2019-11-20 03:18:48,758 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:18:48,799 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:18:49,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:18:49,007 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:18:49,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:18:49,146 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:18:49,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:49 WrapperNode [2019-11-20 03:18:49,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:18:49,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:18:49,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:18:49,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:18:49,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:49" (1/1) ... [2019-11-20 03:18:49,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:49" (1/1) ... [2019-11-20 03:18:49,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:18:49,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:18:49,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:18:49,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:18:49,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:49" (1/1) ... [2019-11-20 03:18:49,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:49" (1/1) ... [2019-11-20 03:18:49,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:49" (1/1) ... [2019-11-20 03:18:49,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:49" (1/1) ... [2019-11-20 03:18:49,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:49" (1/1) ... [2019-11-20 03:18:49,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:49" (1/1) ... [2019-11-20 03:18:49,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:49" (1/1) ... [2019-11-20 03:18:49,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:18:49,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:18:49,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:18:49,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:18:49,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/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-20 03:18:49,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 03:18:49,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2019-11-20 03:18:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 03:18:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:18:49,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:18:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-20 03:18:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 03:18:49,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 03:18:55,307 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:18:55,307 INFO L285 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-20 03:18:55,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:18:55 BoogieIcfgContainer [2019-11-20 03:18:55,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:18:55,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:18:55,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:18:55,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:18:55,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:18:48" (1/3) ... [2019-11-20 03:18:55,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdbb8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:18:55, skipping insertion in model container [2019-11-20 03:18:55,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:18:49" (2/3) ... [2019-11-20 03:18:55,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdbb8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:18:55, skipping insertion in model container [2019-11-20 03:18:55,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:18:55" (3/3) ... [2019-11-20 03:18:55,316 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270a.c [2019-11-20 03:18:55,324 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:18:55,331 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:18:55,341 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:18:55,364 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:18:55,365 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:18:55,365 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:18:55,365 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:18:55,365 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:18:55,366 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:18:55,366 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:18:55,366 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:18:55,387 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-20 03:18:55,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 03:18:55,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:18:55,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:18:55,394 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:18:55,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:18:55,398 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-11-20 03:18:55,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:18:55,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710859746] [2019-11-20 03:18:55,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/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-20 03:18:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:18:55,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 03:18:55,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:18:55,560 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-20 03:18:55,560 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:18:55,564 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-20 03:18:55,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710859746] [2019-11-20 03:18:55,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:18:55,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 03:18:55,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076004627] [2019-11-20 03:18:55,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 03:18:55,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:18:55,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 03:18:55,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 03:18:55,588 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-11-20 03:18:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:18:55,618 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-11-20 03:18:55,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 03:18:55,620 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-20 03:18:55,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:18:55,630 INFO L225 Difference]: With dead ends: 212 [2019-11-20 03:18:55,631 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 03:18:55,634 INFO L630 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-20 03:18:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 03:18:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 03:18:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 03:18:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-11-20 03:18:55,675 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-11-20 03:18:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:18:55,675 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-11-20 03:18:55,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 03:18:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-11-20 03:18:55,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 03:18:55,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:18:55,677 INFO L410 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-20 03:18:55,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 03:18:55,883 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:18:55,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:18:55,883 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-11-20 03:18:55,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:18:55,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952894740] [2019-11-20 03:18:55,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/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-20 03:18:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:18:56,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 03:18:56,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:18:56,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:18:57,244 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-20 03:18:57,245 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:18:58,377 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-20 03:18:59,246 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-20 03:19:01,048 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-20 03:19:15,266 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-20 03:19:15,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952894740] [2019-11-20 03:19:15,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:19:15,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 13] imperfect sequences [] total 23 [2019-11-20 03:19:15,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679981976] [2019-11-20 03:19:15,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 03:19:15,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:19:15,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 03:19:15,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=435, Unknown=2, NotChecked=0, Total=506 [2019-11-20 03:19:15,271 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand 23 states. [2019-11-20 03:19:20,072 WARN L191 SmtUtils]: Spent 3.72 s on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 03:19:22,573 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 03:19:23,470 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-20 03:19:31,594 WARN L191 SmtUtils]: Spent 4.83 s on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 03:19:32,806 WARN L191 SmtUtils]: Spent 475.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 03:19:38,138 WARN L191 SmtUtils]: Spent 4.45 s on a formula simplification that was a NOOP. DAG size: 62 [2019-11-20 03:19:39,967 WARN L191 SmtUtils]: Spent 897.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 03:19:48,661 WARN L191 SmtUtils]: Spent 8.15 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 03:19:53,533 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 03:19:59,322 WARN L191 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-20 03:20:01,998 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 03:20:07,788 WARN L191 SmtUtils]: Spent 4.94 s on a formula simplification that was a NOOP. DAG size: 86 [2019-11-20 03:20:10,313 WARN L191 SmtUtils]: Spent 2.39 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 03:20:20,600 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-20 03:20:22,185 WARN L191 SmtUtils]: Spent 1000.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-20 03:20:30,482 WARN L191 SmtUtils]: Spent 7.33 s on a formula simplification that was a NOOP. DAG size: 89 [2019-11-20 03:20:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:20:53,644 INFO L93 Difference]: Finished difference Result 359 states and 459 transitions. [2019-11-20 03:20:53,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 03:20:53,655 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-11-20 03:20:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:20:53,659 INFO L225 Difference]: With dead ends: 359 [2019-11-20 03:20:53,659 INFO L226 Difference]: Without dead ends: 260 [2019-11-20 03:20:53,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 70.3s TimeCoverageRelationStatistics Valid=439, Invalid=1365, Unknown=2, NotChecked=0, Total=1806 [2019-11-20 03:20:53,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-20 03:20:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 112. [2019-11-20 03:20:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-20 03:20:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 143 transitions. [2019-11-20 03:20:53,678 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 143 transitions. Word has length 21 [2019-11-20 03:20:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:20:53,679 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 143 transitions. [2019-11-20 03:20:53,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 03:20:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2019-11-20 03:20:53,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 03:20:53,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:20:53,680 INFO L410 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] [2019-11-20 03:20:53,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 03:20:53,894 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:20:53,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:20:53,894 INFO L82 PathProgramCache]: Analyzing trace with hash -927908549, now seen corresponding path program 1 times [2019-11-20 03:20:53,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:20:53,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201684565] [2019-11-20 03:20:53,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/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-20 03:20:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:20:53,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 03:20:54,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:20:54,035 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-20 03:20:54,035 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:20:54,096 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-20 03:20:54,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201684565] [2019-11-20 03:20:54,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:20:54,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [] total 9 [2019-11-20 03:20:54,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773476441] [2019-11-20 03:20:54,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 03:20:54,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:20:54,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 03:20:54,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-20 03:20:54,098 INFO L87 Difference]: Start difference. First operand 112 states and 143 transitions. Second operand 9 states. [2019-11-20 03:20:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:20:54,481 INFO L93 Difference]: Finished difference Result 276 states and 354 transitions. [2019-11-20 03:20:54,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 03:20:54,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-11-20 03:20:54,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:20:54,484 INFO L225 Difference]: With dead ends: 276 [2019-11-20 03:20:54,484 INFO L226 Difference]: Without dead ends: 195 [2019-11-20 03:20:54,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-20 03:20:54,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-20 03:20:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 104. [2019-11-20 03:20:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 03:20:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions. [2019-11-20 03:20:54,498 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 24 [2019-11-20 03:20:54,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:20:54,499 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions. [2019-11-20 03:20:54,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 03:20:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions. [2019-11-20 03:20:54,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 03:20:54,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:20:54,500 INFO L410 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-20 03:20:54,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 03:20:54,716 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:20:54,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:20:54,716 INFO L82 PathProgramCache]: Analyzing trace with hash -558668800, now seen corresponding path program 1 times [2019-11-20 03:20:54,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:20:54,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583554725] [2019-11-20 03:20:54,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/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-20 03:20:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:20:54,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 03:20:54,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:20:54,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:20:55,022 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-20 03:20:55,022 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:20:55,296 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-20 03:20:55,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583554725] [2019-11-20 03:20:55,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:20:55,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 17 [2019-11-20 03:20:55,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116826068] [2019-11-20 03:20:55,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 03:20:55,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:20:55,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 03:20:55,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-20 03:20:55,298 INFO L87 Difference]: Start difference. First operand 104 states and 132 transitions. Second operand 17 states. [2019-11-20 03:21:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:21:05,358 INFO L93 Difference]: Finished difference Result 128 states and 154 transitions. [2019-11-20 03:21:05,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 03:21:05,370 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-11-20 03:21:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:21:05,371 INFO L225 Difference]: With dead ends: 128 [2019-11-20 03:21:05,371 INFO L226 Difference]: Without dead ends: 110 [2019-11-20 03:21:05,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 [2019-11-20 03:21:05,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-20 03:21:05,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2019-11-20 03:21:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-20 03:21:05,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2019-11-20 03:21:05,389 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 26 [2019-11-20 03:21:05,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:21:05,389 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2019-11-20 03:21:05,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 03:21:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2019-11-20 03:21:05,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 03:21:05,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:21:05,391 INFO L410 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-20 03:21:05,604 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 03:21:05,604 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:21:05,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:21:05,605 INFO L82 PathProgramCache]: Analyzing trace with hash 121389570, now seen corresponding path program 1 times [2019-11-20 03:21:05,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:21:05,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360486523] [2019-11-20 03:21:05,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/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-20 03:21:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:21:05,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 03:21:05,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:21:05,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:21:05,897 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-20 03:21:05,897 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:21:08,311 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_5_5 (_ BitVec 32))) (or (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_5)) (not (= (let ((.cse0 (bvand (_ bv2147483647 32) c_ULTIMATE.start___ieee754_hypotf_~ha~0))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (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)))))) is different from false [2019-11-20 03:21:10,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32)) (v_skolemized_v_prenex_5_5 (_ BitVec 32))) (or (not (= c_ULTIMATE.start___ieee754_hypotf_~x (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_5)) (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_q#valueAsBitvector_13|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))))) is different from false [2019-11-20 03:21:10,355 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-20 03:21:10,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360486523] [2019-11-20 03:21:10,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:21:10,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 12] imperfect sequences [] total 21 [2019-11-20 03:21:10,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928987972] [2019-11-20 03:21:10,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 03:21:10,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:21:10,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 03:21:10,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=301, Unknown=2, NotChecked=70, Total=420 [2019-11-20 03:21:10,357 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand 21 states. [2019-11-20 03:21:12,486 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 43 DAG size of output: 18 [2019-11-20 03:21:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:21:19,843 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2019-11-20 03:21:19,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 03:21:19,843 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2019-11-20 03:21:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:21:19,844 INFO L225 Difference]: With dead ends: 110 [2019-11-20 03:21:19,844 INFO L226 Difference]: Without dead ends: 92 [2019-11-20 03:21:19,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=171, Invalid=537, Unknown=2, NotChecked=102, Total=812 [2019-11-20 03:21:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-20 03:21:19,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-20 03:21:19,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-20 03:21:19,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2019-11-20 03:21:19,852 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 26 [2019-11-20 03:21:19,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:21:19,853 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2019-11-20 03:21:19,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 03:21:19,853 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2019-11-20 03:21:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 03:21:19,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:21:19,854 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:21:20,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 03:21:20,068 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:21:20,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:21:20,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1951072080, now seen corresponding path program 1 times [2019-11-20 03:21:20,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:21:20,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956641863] [2019-11-20 03:21:20,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/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-20 03:21:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:21:20,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 03:21:20,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:21:20,727 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-20 03:21:20,727 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:21:27,056 WARN L191 SmtUtils]: Spent 712.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-11-20 03:21:29,192 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 03:21:33,169 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 03:21:34,710 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-20 03:21:49,727 WARN L191 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-20 03:21:49,742 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-20 03:21:49,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956641863] [2019-11-20 03:21:49,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:21:49,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 13 [2019-11-20 03:21:49,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309448312] [2019-11-20 03:21:49,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 03:21:49,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:21:49,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 03:21:49,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=119, Unknown=4, NotChecked=0, Total=156 [2019-11-20 03:21:49,744 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand 13 states. [2019-11-20 03:22:03,595 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 03:22:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:22:15,911 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2019-11-20 03:22:15,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 03:22:15,923 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-11-20 03:22:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:22:15,924 INFO L225 Difference]: With dead ends: 152 [2019-11-20 03:22:15,924 INFO L226 Difference]: Without dead ends: 113 [2019-11-20 03:22:15,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=81, Invalid=220, Unknown=5, NotChecked=0, Total=306 [2019-11-20 03:22:15,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-20 03:22:15,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2019-11-20 03:22:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-20 03:22:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 119 transitions. [2019-11-20 03:22:15,933 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 119 transitions. Word has length 34 [2019-11-20 03:22:15,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:22:15,933 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 119 transitions. [2019-11-20 03:22:15,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 03:22:15,933 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 119 transitions. [2019-11-20 03:22:15,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 03:22:15,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:22:15,935 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:22:16,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 03:22:16,150 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:22:16,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:22:16,150 INFO L82 PathProgramCache]: Analyzing trace with hash 13172387, now seen corresponding path program 1 times [2019-11-20 03:22:16,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 03:22:16,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437286432] [2019-11-20 03:22:16,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f2ff2ea3-84ef-4d7d-ad24-4629d997bbec/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-20 03:22:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:22:16,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 03:22:16,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:22:16,776 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-20 03:22:16,776 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 03:22:17,067 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-20 03:22:17,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437286432] [2019-11-20 03:22:17,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:22:17,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 11 [2019-11-20 03:22:17,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135047538] [2019-11-20 03:22:17,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 03:22:17,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 03:22:17,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 03:22:17,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-20 03:22:17,068 INFO L87 Difference]: Start difference. First operand 95 states and 119 transitions. Second operand 11 states. [2019-11-20 03:22:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:22:17,162 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2019-11-20 03:22:17,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:22:17,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-11-20 03:22:17,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:22:17,166 INFO L225 Difference]: With dead ends: 95 [2019-11-20 03:22:17,166 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:22:17,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-20 03:22:17,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:22:17,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:22:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:22:17,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:22:17,167 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-20 03:22:17,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:22:17,168 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:22:17,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 03:22:17,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:22:17,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:22:17,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-20 03:22:17,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:22:17,479 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 135 [2019-11-20 03:22:38,299 WARN L191 SmtUtils]: Spent 20.70 s on a formula simplification. DAG size of input: 135 DAG size of output: 107 [2019-11-20 03:23:13,306 WARN L191 SmtUtils]: Spent 35.00 s on a formula simplification. DAG size of input: 167 DAG size of output: 149 [2019-11-20 03:23:40,695 WARN L191 SmtUtils]: Spent 27.38 s on a formula simplification. DAG size of input: 151 DAG size of output: 119 [2019-11-20 03:23:40,716 INFO L444 ceAbstractionStarter]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2019-11-20 03:23:40,716 INFO L444 ceAbstractionStarter]: For program point L35-3(lines 35 39) no Hoare annotation was computed. [2019-11-20 03:23:40,716 INFO L444 ceAbstractionStarter]: For program point L35-5(lines 35 39) no Hoare annotation was computed. [2019-11-20 03:23:40,716 INFO L444 ceAbstractionStarter]: For program point L234(line 234) no Hoare annotation was computed. [2019-11-20 03:23:40,716 INFO L444 ceAbstractionStarter]: For program point L36-2(lines 36 37) no Hoare annotation was computed. [2019-11-20 03:23:40,717 INFO L440 ceAbstractionStarter]: At program point L36-3(lines 36 37) the Hoare annotation is: false [2019-11-20 03:23:40,717 INFO L444 ceAbstractionStarter]: For program point L36-4(lines 36 37) no Hoare annotation was computed. [2019-11-20 03:23:40,717 INFO L444 ceAbstractionStarter]: For program point L36-7(lines 36 37) no Hoare annotation was computed. [2019-11-20 03:23:40,717 INFO L440 ceAbstractionStarter]: At program point L36-8(lines 36 37) the Hoare annotation is: false [2019-11-20 03:23:40,717 INFO L444 ceAbstractionStarter]: For program point L36-9(lines 36 37) no Hoare annotation was computed. [2019-11-20 03:23:40,717 INFO L447 ceAbstractionStarter]: At program point L237(lines 222 238) the Hoare annotation is: true [2019-11-20 03:23:40,717 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 143) no Hoare annotation was computed. [2019-11-20 03:23:40,717 INFO L444 ceAbstractionStarter]: For program point L139-1(lines 121 144) no Hoare annotation was computed. [2019-11-20 03:23:40,717 INFO L444 ceAbstractionStarter]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2019-11-20 03:23:40,717 INFO L440 ceAbstractionStarter]: At program point L73-2(lines 73 77) the Hoare annotation is: false [2019-11-20 03:23:40,717 INFO L444 ceAbstractionStarter]: For program point L73-3(lines 73 77) no Hoare annotation was computed. [2019-11-20 03:23:40,718 INFO L444 ceAbstractionStarter]: For program point L73-5(lines 73 77) no Hoare annotation was computed. [2019-11-20 03:23:40,718 INFO L440 ceAbstractionStarter]: At program point L73-6(lines 73 77) the Hoare annotation is: false [2019-11-20 03:23:40,718 INFO L444 ceAbstractionStarter]: For program point L73-7(lines 73 77) no Hoare annotation was computed. [2019-11-20 03:23:40,718 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2019-11-20 03:23:40,718 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 81 208) no Hoare annotation was computed. [2019-11-20 03:23:40,718 INFO L440 ceAbstractionStarter]: At program point L207(lines 81 208) the Hoare annotation is: (let ((.cse6 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (let ((.cse0 (= ULTIMATE.start___ieee754_hypotf_~x .cse6)) (.cse1 (= (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)) .cse6))) (or (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_35 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_35) ULTIMATE.start___ieee754_hypotf_~hb~0)) (or (and (not (bvslt ULTIMATE.start___ieee754_hypotf_~hb~0 (_ bv645922816 32))) .cse0) (and .cse0 .cse1)) (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= |ULTIMATE.start___ieee754_hypotf_#res| (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)))))) (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= ULTIMATE.start___ieee754_hypotf_~w~0 (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)))))) (or (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= ULTIMATE.start___ieee754_hypotf_~b~0 (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)))))) (not (= (bvadd ULTIMATE.start___ieee754_hypotf_~hb~0 (_ bv2155872256 32)) (_ bv0 32))))) (let ((.cse2 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32))))) (and (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= |ULTIMATE.start___ieee754_hypotf_#res| (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) (or .cse2 (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven ULTIMATE.start___ieee754_hypotf_~a~0 (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))))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3))))) (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven ULTIMATE.start___ieee754_hypotf_~a~0 ULTIMATE.start___ieee754_hypotf_~b~0))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) .cse2) .cse0 (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven (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)) (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))))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) .cse2))) (and .cse0 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.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 (= .cse3 |ULTIMATE.start___ieee754_hypotf_#res|) (= .cse3 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse4 (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 (= .cse4 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse4 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse5 (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 (= .cse5 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= .cse5 ULTIMATE.start___ieee754_hypotf_~a~0)))) .cse1)))) [2019-11-20 03:23:40,719 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2019-11-20 03:23:40,719 INFO L444 ceAbstractionStarter]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2019-11-20 03:23:40,719 INFO L444 ceAbstractionStarter]: For program point L42-3(lines 42 43) no Hoare annotation was computed. [2019-11-20 03:23:40,719 INFO L444 ceAbstractionStarter]: For program point L42-5(lines 42 43) no Hoare annotation was computed. [2019-11-20 03:23:40,719 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 198) no Hoare annotation was computed. [2019-11-20 03:23:40,719 INFO L444 ceAbstractionStarter]: For program point L175-2(lines 81 208) no Hoare annotation was computed. [2019-11-20 03:23:40,719 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 176 180) no Hoare annotation was computed. [2019-11-20 03:23:40,719 INFO L440 ceAbstractionStarter]: At program point L176-2(lines 176 180) the Hoare annotation is: false [2019-11-20 03:23:40,719 INFO L444 ceAbstractionStarter]: For program point L176-3(lines 176 180) no Hoare annotation was computed. [2019-11-20 03:23:40,719 INFO L440 ceAbstractionStarter]: At program point L78(lines 14 79) the Hoare annotation is: false [2019-11-20 03:23:40,720 INFO L440 ceAbstractionStarter]: At program point L78-1(lines 14 79) the Hoare annotation is: false [2019-11-20 03:23:40,720 INFO L444 ceAbstractionStarter]: For program point L145(lines 145 172) no Hoare annotation was computed. [2019-11-20 03:23:40,720 INFO L444 ceAbstractionStarter]: For program point L112(lines 112 116) no Hoare annotation was computed. [2019-11-20 03:23:40,720 INFO L444 ceAbstractionStarter]: For program point L112-1(lines 81 208) no Hoare annotation was computed. [2019-11-20 03:23:40,720 INFO L444 ceAbstractionStarter]: For program point L112-2(lines 81 208) no Hoare annotation was computed. [2019-11-20 03:23:40,720 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 171) no Hoare annotation was computed. [2019-11-20 03:23:40,720 INFO L444 ceAbstractionStarter]: For program point L213-1(lines 213 217) no Hoare annotation was computed. [2019-11-20 03:23:40,721 INFO L440 ceAbstractionStarter]: At program point L213-2(lines 213 217) the Hoare annotation is: (let ((.cse7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (let ((.cse0 (= ULTIMATE.start___ieee754_hypotf_~x .cse7)) (.cse1 (= (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)) .cse7))) (or (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_35 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_35) ULTIMATE.start___ieee754_hypotf_~hb~0)) (or (and (not (bvslt ULTIMATE.start___ieee754_hypotf_~hb~0 (_ bv645922816 32))) .cse0) (and .cse0 .cse1)) (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= |ULTIMATE.start___ieee754_hypotf_#res| (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)))))) (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (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)) ULTIMATE.start_isinf_float_~x)))) (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= ULTIMATE.start___ieee754_hypotf_~w~0 (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)))))) (or (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= ULTIMATE.start___ieee754_hypotf_~b~0 (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)))))) (not (= (bvadd ULTIMATE.start___ieee754_hypotf_~hb~0 (_ bv2155872256 32)) (_ bv0 32))))) (let ((.cse2 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32))))) (and (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) ULTIMATE.start_isinf_float_~x)) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= |ULTIMATE.start___ieee754_hypotf_#res| (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) (or .cse2 (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven ULTIMATE.start___ieee754_hypotf_~a~0 (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))))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3))))) (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven ULTIMATE.start___ieee754_hypotf_~a~0 ULTIMATE.start___ieee754_hypotf_~b~0))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) .cse2) .cse0 (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven (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)) (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))))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) .cse2))) (and (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.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 (= .cse3 ULTIMATE.start_isinf_float_~x) (= .cse3 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) .cse0 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse4 (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 (= .cse4 |ULTIMATE.start___ieee754_hypotf_#res|) (= .cse4 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse5 (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 (= .cse5 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse5 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (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 (= .cse6 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= .cse6 ULTIMATE.start___ieee754_hypotf_~a~0)))) .cse1)))) [2019-11-20 03:23:40,721 INFO L444 ceAbstractionStarter]: For program point L213-3(lines 213 217) no Hoare annotation was computed. [2019-11-20 03:23:40,721 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 171) no Hoare annotation was computed. [2019-11-20 03:23:40,721 INFO L444 ceAbstractionStarter]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2019-11-20 03:23:40,721 INFO L440 ceAbstractionStarter]: At program point L149-2(lines 149 153) the Hoare annotation is: false [2019-11-20 03:23:40,721 INFO L444 ceAbstractionStarter]: For program point L149-3(lines 149 153) no Hoare annotation was computed. [2019-11-20 03:23:40,721 INFO L440 ceAbstractionStarter]: At program point L50-2(lines 50 59) the Hoare annotation is: false [2019-11-20 03:23:40,721 INFO L444 ceAbstractionStarter]: For program point L50-3(lines 14 79) no Hoare annotation was computed. [2019-11-20 03:23:40,722 INFO L440 ceAbstractionStarter]: At program point L50-6(lines 50 59) the Hoare annotation is: false [2019-11-20 03:23:40,722 INFO L444 ceAbstractionStarter]: For program point L50-7(lines 14 79) no Hoare annotation was computed. [2019-11-20 03:23:40,722 INFO L444 ceAbstractionStarter]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2019-11-20 03:23:40,722 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-11-20 03:23:40,722 INFO L440 ceAbstractionStarter]: At program point L85-2(lines 85 89) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_hypotf_~x (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse0 (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 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= .cse0 ULTIMATE.start___ieee754_hypotf_~a~0))))) [2019-11-20 03:23:40,722 INFO L444 ceAbstractionStarter]: For program point L85-3(lines 85 89) no Hoare annotation was computed. [2019-11-20 03:23:40,722 INFO L444 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-20 03:23:40,722 INFO L444 ceAbstractionStarter]: For program point L52-2(lines 52 56) no Hoare annotation was computed. [2019-11-20 03:23:40,722 INFO L440 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-20 03:23:40,722 INFO L444 ceAbstractionStarter]: For program point L52-3(lines 52 56) no Hoare annotation was computed. [2019-11-20 03:23:40,723 INFO L444 ceAbstractionStarter]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2019-11-20 03:23:40,723 INFO L444 ceAbstractionStarter]: For program point L52-5(lines 52 56) no Hoare annotation was computed. [2019-11-20 03:23:40,723 INFO L444 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-20 03:23:40,723 INFO L440 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-11-20 03:23:40,723 INFO L444 ceAbstractionStarter]: For program point L19-7(lines 19 23) no Hoare annotation was computed. [2019-11-20 03:23:40,723 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 03:23:40,723 INFO L444 ceAbstractionStarter]: For program point L185-1(lines 185 189) no Hoare annotation was computed. [2019-11-20 03:23:40,723 INFO L440 ceAbstractionStarter]: At program point L185-2(lines 185 189) the Hoare annotation is: false [2019-11-20 03:23:40,723 INFO L444 ceAbstractionStarter]: For program point L185-3(lines 185 189) no Hoare annotation was computed. [2019-11-20 03:23:40,724 INFO L440 ceAbstractionStarter]: At program point L219(lines 211 220) the Hoare annotation is: (let ((.cse11 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (let ((.cse1 (= ULTIMATE.start___ieee754_hypotf_~x .cse11)) (.cse4 (= (bvadd |ULTIMATE.start_isinf_float_#res| (_ bv4294967295 32)) (_ bv0 32))) (.cse5 (= (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)) .cse11))) (or (let ((.cse0 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32))))) (and (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) ULTIMATE.start_isinf_float_~x)) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= |ULTIMATE.start___ieee754_hypotf_#res| (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) (or .cse0 (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven ULTIMATE.start___ieee754_hypotf_~a~0 (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))))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3))))) (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven ULTIMATE.start___ieee754_hypotf_~a~0 ULTIMATE.start___ieee754_hypotf_~b~0))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) .cse0) .cse1 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~hb~0_27 (_ BitVec 32))) (let ((.cse3 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_27)) (.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 (= (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 .cse2 (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (bvsgt (bvadd ULTIMATE.start___ieee754_hypotf_~ha~0 (bvneg .cse3)) (_ bv251658240 32)) (= .cse2 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) .cse4 (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven (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)) (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))))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) .cse0))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_35 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_35) ULTIMATE.start___ieee754_hypotf_~hb~0)) (or (and (not (bvslt ULTIMATE.start___ieee754_hypotf_~hb~0 (_ bv645922816 32))) .cse1) (and .cse1 .cse5)) (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= |ULTIMATE.start___ieee754_hypotf_#res| (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)))))) (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (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)) ULTIMATE.start_isinf_float_~x)))) (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= ULTIMATE.start___ieee754_hypotf_~w~0 (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)))))) (or (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= ULTIMATE.start___ieee754_hypotf_~b~0 (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)))))) (not (= (bvadd ULTIMATE.start___ieee754_hypotf_~hb~0 (_ bv2155872256 32)) (_ bv0 32)))) (= (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 (_ bv0 1) (_ bv255 8) (_ bv0 23))) .cse4) (and (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (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 (= .cse6 ULTIMATE.start_isinf_float_~x) (= .cse6 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.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 (= .cse7 (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))) (= .cse7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) .cse1 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (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 (= .cse8 |ULTIMATE.start___ieee754_hypotf_#res|) (= .cse8 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.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 (= .cse9 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse9 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse10 (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 (= .cse10 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= .cse10 ULTIMATE.start___ieee754_hypotf_~a~0)))) .cse4 .cse5)))) [2019-11-20 03:23:40,724 INFO L444 ceAbstractionStarter]: For program point L121(lines 121 144) no Hoare annotation was computed. [2019-11-20 03:23:40,724 INFO L444 ceAbstractionStarter]: For program point L121-1(lines 81 208) no Hoare annotation was computed. [2019-11-20 03:23:40,724 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 129) no Hoare annotation was computed. [2019-11-20 03:23:40,724 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 03:23:40,724 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2019-11-20 03:23:40,725 INFO L444 ceAbstractionStarter]: For program point L91-1(lines 91 95) no Hoare annotation was computed. [2019-11-20 03:23:40,725 INFO L444 ceAbstractionStarter]: For program point L124-2(lines 122 129) no Hoare annotation was computed. [2019-11-20 03:23:40,725 INFO L440 ceAbstractionStarter]: At program point L91-2(lines 91 95) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) (and (= ULTIMATE.start___ieee754_hypotf_~x .cse0) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse1 (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 (= .cse1 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= .cse1 ULTIMATE.start___ieee754_hypotf_~a~0)))) (= (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)) .cse0))) [2019-11-20 03:23:40,725 INFO L444 ceAbstractionStarter]: For program point L91-3(lines 91 95) no Hoare annotation was computed. [2019-11-20 03:23:40,725 INFO L444 ceAbstractionStarter]: For program point L191-1(lines 191 195) no Hoare annotation was computed. [2019-11-20 03:23:40,725 INFO L440 ceAbstractionStarter]: At program point L191-2(lines 191 195) the Hoare annotation is: false [2019-11-20 03:23:40,725 INFO L444 ceAbstractionStarter]: For program point L191-3(lines 191 195) no Hoare annotation was computed. [2019-11-20 03:23:40,725 INFO L444 ceAbstractionStarter]: For program point L26(lines 26 27) no Hoare annotation was computed. [2019-11-20 03:23:40,725 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2019-11-20 03:23:40,726 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 126 127) no Hoare annotation was computed. [2019-11-20 03:23:40,726 INFO L444 ceAbstractionStarter]: For program point L61(lines 61 70) no Hoare annotation was computed. [2019-11-20 03:23:40,726 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 03:23:40,726 INFO L444 ceAbstractionStarter]: For program point L61-1(lines 61 70) no Hoare annotation was computed. [2019-11-20 03:23:40,726 INFO L444 ceAbstractionStarter]: For program point L161-1(lines 161 165) no Hoare annotation was computed. [2019-11-20 03:23:40,726 INFO L440 ceAbstractionStarter]: At program point L161-2(lines 161 165) the Hoare annotation is: false [2019-11-20 03:23:40,726 INFO L444 ceAbstractionStarter]: For program point L29(lines 29 30) no Hoare annotation was computed. [2019-11-20 03:23:40,726 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 29 30) no Hoare annotation was computed. [2019-11-20 03:23:40,726 INFO L444 ceAbstractionStarter]: For program point L63(lines 63 69) no Hoare annotation was computed. [2019-11-20 03:23:40,726 INFO L444 ceAbstractionStarter]: For program point L63-2(lines 63 69) no Hoare annotation was computed. [2019-11-20 03:23:40,726 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 106) no Hoare annotation was computed. [2019-11-20 03:23:40,727 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 32) no Hoare annotation was computed. [2019-11-20 03:23:40,727 INFO L444 ceAbstractionStarter]: For program point L31-1(lines 31 32) no Hoare annotation was computed. [2019-11-20 03:23:40,727 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 68) no Hoare annotation was computed. [2019-11-20 03:23:40,727 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 03:23:40,727 INFO L444 ceAbstractionStarter]: For program point L65-3(lines 65 68) no Hoare annotation was computed. [2019-11-20 03:23:40,727 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 234) no Hoare annotation was computed. [2019-11-20 03:23:40,727 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 170) no Hoare annotation was computed. [2019-11-20 03:23:40,727 INFO L444 ceAbstractionStarter]: For program point L166-1(lines 157 171) no Hoare annotation was computed. [2019-11-20 03:23:40,727 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 236) no Hoare annotation was computed. [2019-11-20 03:23:40,727 INFO L444 ceAbstractionStarter]: For program point L200-1(lines 200 204) no Hoare annotation was computed. [2019-11-20 03:23:40,728 INFO L440 ceAbstractionStarter]: At program point L200-2(lines 200 204) the Hoare annotation is: false [2019-11-20 03:23:40,728 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2019-11-20 03:23:40,728 INFO L444 ceAbstractionStarter]: For program point L200-3(lines 200 204) no Hoare annotation was computed. [2019-11-20 03:23:40,728 INFO L440 ceAbstractionStarter]: At program point L134-2(lines 134 138) the Hoare annotation is: false [2019-11-20 03:23:40,728 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2019-11-20 03:23:40,748 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.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:556) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:256) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-20 03:23:40,751 INFO L168 Benchmark]: Toolchain (without parser) took 292007.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 960.4 MB in the beginning and 880.5 MB in the end (delta: 79.9 MB). Peak memory consumption was 287.5 MB. Max. memory is 11.5 GB. [2019-11-20 03:23:40,751 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:23:40,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -189.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:23:40,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:23:40,752 INFO L168 Benchmark]: Boogie Preprocessor took 55.28 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-20 03:23:40,753 INFO L168 Benchmark]: RCFGBuilder took 6047.30 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:23:40,754 INFO L168 Benchmark]: TraceAbstraction took 285440.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 880.5 MB in the end (delta: 211.2 MB). Peak memory consumption was 259.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:23:40,756 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -189.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.28 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. * RCFGBuilder took 6047.30 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 285440.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 880.5 MB in the end (delta: 211.2 MB). Peak memory consumption was 259.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 234]: 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. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...