./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0920a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0920a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 9a30c63b7ba6607790fb9b2ddb8b19a74f00f07b ................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0920a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 9a30c63b7ba6607790fb9b2ddb8b19a74f00f07b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:11:53,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:11:53,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:11:53,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:11:53,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:11:53,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:11:53,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:11:53,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:11:53,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:11:53,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:11:53,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:11:53,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:11:53,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:11:53,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:11:53,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:11:53,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:11:53,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:11:53,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:11:53,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:11:53,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:11:53,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:11:53,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:11:53,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:11:53,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:11:53,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:11:53,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:11:53,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:11:53,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:11:53,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:11:53,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:11:53,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:11:53,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:11:53,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:11:53,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:11:53,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:11:53,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:11:53,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:11:53,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:11:53,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:11:53,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:11:53,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:11:53,296 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:11:53,314 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:11:53,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:11:53,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:11:53,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:11:53,328 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:11:53,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:11:53,329 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:11:53,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:11:53,329 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:11:53,330 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:11:53,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:11:53,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:11:53,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:11:53,331 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:11:53,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:11:53,331 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:11:53,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:11:53,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:11:53,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:11:53,332 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:11:53,333 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:11:53,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:11:53,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:11:53,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:11:53,335 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:11:53,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:11:53,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:11:53,337 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:11:53,337 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 9a30c63b7ba6607790fb9b2ddb8b19a74f00f07b [2019-11-19 21:11:53,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:11:53,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:11:53,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:11:53,673 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:11:53,673 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:11:53,674 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0920a.c [2019-11-19 21:11:53,736 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4150430/45299bd0bf8f45cba174324393c21c52/FLAGcd16df0b4 [2019-11-19 21:11:54,234 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:11:54,236 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0920a.c [2019-11-19 21:11:54,247 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4150430/45299bd0bf8f45cba174324393c21c52/FLAGcd16df0b4 [2019-11-19 21:11:54,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4150430/45299bd0bf8f45cba174324393c21c52 [2019-11-19 21:11:54,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:11:54,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:11:54,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:11:54,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:11:54,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:11:54,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:11:54" (1/1) ... [2019-11-19 21:11:54,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67680f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:11:54, skipping insertion in model container [2019-11-19 21:11:54,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:11:54" (1/1) ... [2019-11-19 21:11:54,575 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:11:54,626 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:11:54,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:11:54,875 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:11:54,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:11:55,017 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:11:55,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:11:55 WrapperNode [2019-11-19 21:11:55,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:11:55,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:11:55,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:11:55,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:11:55,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:11:55" (1/1) ... [2019-11-19 21:11:55,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:11:55" (1/1) ... [2019-11-19 21:11:55,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:11:55,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:11:55,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:11:55,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:11:55,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:11:55" (1/1) ... [2019-11-19 21:11:55,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:11:55" (1/1) ... [2019-11-19 21:11:55,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:11:55" (1/1) ... [2019-11-19 21:11:55,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:11:55" (1/1) ... [2019-11-19 21:11:55,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:11:55" (1/1) ... [2019-11-19 21:11:55,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:11:55" (1/1) ... [2019-11-19 21:11:55,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:11:55" (1/1) ... [2019-11-19 21:11:55,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:11:55,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:11:55,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:11:55,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:11:55,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:11:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-19 21:11:55,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:11:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-19 21:11:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 21:11:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-19 21:11:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:11:55,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:11:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 21:11:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:11:55,634 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:11:55,634 INFO L285 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-19 21:11:55,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:11:55 BoogieIcfgContainer [2019-11-19 21:11:55,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:11:55,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:11:55,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:11:55,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:11:55,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:11:54" (1/3) ... [2019-11-19 21:11:55,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2076529d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:11:55, skipping insertion in model container [2019-11-19 21:11:55,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:11:55" (2/3) ... [2019-11-19 21:11:55,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2076529d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:11:55, skipping insertion in model container [2019-11-19 21:11:55,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:11:55" (3/3) ... [2019-11-19 21:11:55,645 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0920a.c [2019-11-19 21:11:55,655 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:11:55,663 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:11:55,674 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:11:55,695 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:11:55,695 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:11:55,696 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:11:55,696 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:11:55,696 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:11:55,696 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:11:55,696 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:11:55,696 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:11:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-19 21:11:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 21:11:55,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:11:55,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:11:55,720 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:11:55,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:11:55,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1394505008, now seen corresponding path program 1 times [2019-11-19 21:11:55,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:11:55,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226884009] [2019-11-19 21:11:55,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:11:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:11:55,857 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-19 21:11:55,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226884009] [2019-11-19 21:11:55,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:11:55,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:11:55,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666594509] [2019-11-19 21:11:55,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:11:55,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:11:55,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:11:55,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:11:55,882 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2019-11-19 21:11:55,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:11:55,901 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2019-11-19 21:11:55,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:11:55,902 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-19 21:11:55,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:11:55,914 INFO L225 Difference]: With dead ends: 69 [2019-11-19 21:11:55,914 INFO L226 Difference]: Without dead ends: 32 [2019-11-19 21:11:55,918 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-19 21:11:55,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-19 21:11:55,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-19 21:11:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-19 21:11:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-11-19 21:11:55,957 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 12 [2019-11-19 21:11:55,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:11:55,958 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-19 21:11:55,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:11:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2019-11-19 21:11:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 21:11:55,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:11:55,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:11:55,960 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:11:55,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:11:55,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1007782307, now seen corresponding path program 1 times [2019-11-19 21:11:55,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:11:55,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355453770] [2019-11-19 21:11:55,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:11:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:11:56,017 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-19 21:11:56,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355453770] [2019-11-19 21:11:56,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:11:56,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:11:56,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169093125] [2019-11-19 21:11:56,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:11:56,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:11:56,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:11:56,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:11:56,021 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 3 states. [2019-11-19 21:11:56,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:11:56,048 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2019-11-19 21:11:56,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:11:56,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-19 21:11:56,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:11:56,049 INFO L225 Difference]: With dead ends: 57 [2019-11-19 21:11:56,050 INFO L226 Difference]: Without dead ends: 32 [2019-11-19 21:11:56,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:11:56,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-19 21:11:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-19 21:11:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-19 21:11:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-11-19 21:11:56,058 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 13 [2019-11-19 21:11:56,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:11:56,058 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-19 21:11:56,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:11:56,058 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-11-19 21:11:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 21:11:56,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:11:56,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:11:56,060 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:11:56,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:11:56,061 INFO L82 PathProgramCache]: Analyzing trace with hash 32951480, now seen corresponding path program 1 times [2019-11-19 21:11:56,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:11:56,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47164912] [2019-11-19 21:11:56,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:11:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:11:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:11:56,302 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:11:56,303 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:11:56,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:11:56 BoogieIcfgContainer [2019-11-19 21:11:56,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:11:56,379 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:11:56,379 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:11:56,380 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:11:56,381 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:11:55" (3/4) ... [2019-11-19 21:11:56,390 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 21:11:56,390 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:11:56,394 INFO L168 Benchmark]: Toolchain (without parser) took 1836.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -99.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:11:56,395 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:11:56,397 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-19 21:11:56,398 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.00 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-19 21:11:56,399 INFO L168 Benchmark]: Boogie Preprocessor took 40.06 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:11:56,400 INFO L168 Benchmark]: RCFGBuilder took 524.06 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-11-19 21:11:56,402 INFO L168 Benchmark]: TraceAbstraction took 741.78 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-11-19 21:11:56,403 INFO L168 Benchmark]: Witness Printer took 11.35 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-19 21:11:56,418 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 460.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.06 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 524.06 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 741.78 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Witness Printer took 11.35 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: 154]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of bitwiseAnd at line 133, overapproximation of someBinaryArithmeticDOUBLEoperation at line 72. Possible FailurePath: [L32-L41] static const double ln2_hi_log = 6.93147180369123816490e-01, ln2_lo_log = 1.90821492927058770002e-10, two54_log = 1.80143985094819840000e+16, Lg1_log = 6.666666666666735130e-01, Lg2_log = 3.999999999940941908e-01, Lg3_log = 2.857142874366239149e-01, Lg4_log = 2.222219843214978396e-01, Lg5_log = 1.818357216161805012e-01, Lg6_log = 1.531383769920937332e-01, Lg7_log = 1.479819860511658591e-01; [L43] static const double zero = 0.0; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L146] double x = __VERIFIER_nondet_double(); [L148] EXPR x < 0 && isfinite_double(x) [L127] __int32_t hx; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L129] ieee_double_shape_type gh_u; [L130] gh_u.value = (x) [L131] EXPR gh_u.parts.msw [L131] (hx) = gh_u.parts.msw [L133] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L148] EXPR x < 0 && isfinite_double(x) VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L148] COND TRUE (x < 0 && isfinite_double(x)) [L46] double hfsq, f, s, z, R, w, t1, t2, dk; [L47] __int32_t k, hx, i, j; [L48] __uint32_t lx; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L51] ieee_double_shape_type ew_u; [L52] ew_u.value = (x) [L53] EXPR ew_u.parts.msw [L53] (hx) = ew_u.parts.msw [L54] EXPR ew_u.parts.lsw [L54] (lx) = ew_u.parts.lsw [L57] k = 0 VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L58] COND FALSE !(hx < 0x00100000) VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L71] COND TRUE hx >= 0x7ff00000 [L72] return x + x; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L150] double res = __ieee754_log(x); [L137] return x != x; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L153] COND TRUE !isnan_double(res) [L154] __VERIFIER_error() VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 91 SDtfs, 0 SDslu, 38 SDs, 0 SdLazy, 4 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-19 21:11:58,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:11:58,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:11:58,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:11:58,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:11:58,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:11:58,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:11:58,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:11:58,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:11:58,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:11:58,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:11:58,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:11:58,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:11:58,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:11:58,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:11:58,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:11:58,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:11:58,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:11:58,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:11:58,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:11:58,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:11:58,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:11:58,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:11:58,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:11:58,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:11:58,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:11:58,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:11:58,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:11:58,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:11:58,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:11:58,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:11:58,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:11:58,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:11:58,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:11:58,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:11:58,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:11:58,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:11:58,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:11:58,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:11:58,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:11:58,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:11:58,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 21:11:58,515 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:11:58,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:11:58,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:11:58,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:11:58,517 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:11:58,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:11:58,518 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:11:58,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:11:58,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:11:58,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:11:58,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:11:58,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:11:58,520 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 21:11:58,520 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 21:11:58,520 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:11:58,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:11:58,521 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:11:58,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:11:58,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:11:58,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:11:58,522 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:11:58,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:11:58,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:11:58,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:11:58,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:11:58,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:11:58,524 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 21:11:58,524 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 21:11:58,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:11:58,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 21:11:58,525 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 9a30c63b7ba6607790fb9b2ddb8b19a74f00f07b [2019-11-19 21:11:58,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:11:58,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:11:58,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:11:58,886 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:11:58,886 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:11:58,887 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0920a.c [2019-11-19 21:11:58,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fd07e65/150c1738f51a4e3087f15a31f368b5ad/FLAGeb0a149f9 [2019-11-19 21:11:59,458 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:11:59,459 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0920a.c [2019-11-19 21:11:59,468 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fd07e65/150c1738f51a4e3087f15a31f368b5ad/FLAGeb0a149f9 [2019-11-19 21:11:59,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fd07e65/150c1738f51a4e3087f15a31f368b5ad [2019-11-19 21:11:59,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:11:59,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:11:59,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:11:59,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:11:59,784 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:11:59,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:11:59" (1/1) ... [2019-11-19 21:11:59,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c641f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:11:59, skipping insertion in model container [2019-11-19 21:11:59,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:11:59" (1/1) ... [2019-11-19 21:11:59,797 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:11:59,833 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:12:00,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:12:00,076 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:12:00,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:12:00,236 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:12:00,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:00 WrapperNode [2019-11-19 21:12:00,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:12:00,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:12:00,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:12:00,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:12:00,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:00" (1/1) ... [2019-11-19 21:12:00,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:00" (1/1) ... [2019-11-19 21:12:00,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:12:00,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:12:00,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:12:00,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:12:00,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:00" (1/1) ... [2019-11-19 21:12:00,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:00" (1/1) ... [2019-11-19 21:12:00,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:00" (1/1) ... [2019-11-19 21:12:00,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:00" (1/1) ... [2019-11-19 21:12:00,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:00" (1/1) ... [2019-11-19 21:12:00,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:00" (1/1) ... [2019-11-19 21:12:00,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:00" (1/1) ... [2019-11-19 21:12:00,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:12:00,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:12:00,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:12:00,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:12:00,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-19 21:12:00,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-19 21:12:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-19 21:12:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:12:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 21:12:00,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:12:00,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:12:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 21:12:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:12:23,203 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:12:23,203 INFO L285 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-19 21:12:23,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:23 BoogieIcfgContainer [2019-11-19 21:12:23,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:12:23,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:12:23,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:12:23,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:12:23,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:11:59" (1/3) ... [2019-11-19 21:12:23,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464dd601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:12:23, skipping insertion in model container [2019-11-19 21:12:23,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:00" (2/3) ... [2019-11-19 21:12:23,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464dd601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:12:23, skipping insertion in model container [2019-11-19 21:12:23,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:23" (3/3) ... [2019-11-19 21:12:23,212 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0920a.c [2019-11-19 21:12:23,222 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:12:23,231 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:12:23,243 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:12:23,278 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:12:23,278 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:12:23,278 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:12:23,279 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:12:23,279 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:12:23,279 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:12:23,279 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:12:23,280 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:12:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-19 21:12:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 21:12:23,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:23,301 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:23,301 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:23,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:23,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1394505008, now seen corresponding path program 1 times [2019-11-19 21:12:23,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:23,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856834472] [2019-11-19 21:12:23,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-19 21:12:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:23,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-19 21:12:23,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:23,490 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-19 21:12:23,491 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:23,495 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-19 21:12:23,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856834472] [2019-11-19 21:12:23,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:23,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 21:12:23,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121202080] [2019-11-19 21:12:23,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:12:23,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:23,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:12:23,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:12:23,524 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2019-11-19 21:12:23,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:23,548 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2019-11-19 21:12:23,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:12:23,550 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-19 21:12:23,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:23,562 INFO L225 Difference]: With dead ends: 69 [2019-11-19 21:12:23,563 INFO L226 Difference]: Without dead ends: 32 [2019-11-19 21:12:23,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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-19 21:12:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-19 21:12:23,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-19 21:12:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-19 21:12:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-11-19 21:12:23,608 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 12 [2019-11-19 21:12:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:23,609 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-19 21:12:23,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:12:23,609 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2019-11-19 21:12:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 21:12:23,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:23,610 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:23,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-19 21:12:23,825 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:23,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:23,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1007782307, now seen corresponding path program 1 times [2019-11-19 21:12:23,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:23,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519645744] [2019-11-19 21:12:23,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-19 21:12:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:23,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 21:12:23,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:23,980 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-19 21:12:23,981 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:23,984 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-19 21:12:23,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519645744] [2019-11-19 21:12:23,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:23,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-19 21:12:23,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006451648] [2019-11-19 21:12:23,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:12:23,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:23,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:12:23,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:12:23,989 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 3 states. [2019-11-19 21:12:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:24,019 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2019-11-19 21:12:24,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:12:24,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-19 21:12:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:24,020 INFO L225 Difference]: With dead ends: 57 [2019-11-19 21:12:24,021 INFO L226 Difference]: Without dead ends: 32 [2019-11-19 21:12:24,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:12:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-19 21:12:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-19 21:12:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-19 21:12:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-11-19 21:12:24,028 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 13 [2019-11-19 21:12:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:24,029 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-19 21:12:24,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:12:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-11-19 21:12:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 21:12:24,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:24,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:24,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-19 21:12:24,252 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:24,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:24,253 INFO L82 PathProgramCache]: Analyzing trace with hash 32951480, now seen corresponding path program 1 times [2019-11-19 21:12:24,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:24,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075703303] [2019-11-19 21:12:24,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-19 21:12:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:24,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 21:12:24,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:24,849 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-19 21:12:24,849 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:25,028 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-19 21:12:25,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075703303] [2019-11-19 21:12:25,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:25,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-19 21:12:25,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746900714] [2019-11-19 21:12:25,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 21:12:25,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:25,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 21:12:25,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:12:25,031 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 10 states. [2019-11-19 21:12:29,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:29,788 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2019-11-19 21:12:29,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:12:29,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-19 21:12:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:29,823 INFO L225 Difference]: With dead ends: 37 [2019-11-19 21:12:29,823 INFO L226 Difference]: Without dead ends: 19 [2019-11-19 21:12:29,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-11-19 21:12:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-19 21:12:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-19 21:12:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-19 21:12:29,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-11-19 21:12:29,829 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-11-19 21:12:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:29,830 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-11-19 21:12:29,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 21:12:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-11-19 21:12:29,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 21:12:29,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:29,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:30,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-19 21:12:30,053 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:30,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:30,054 INFO L82 PathProgramCache]: Analyzing trace with hash -677236169, now seen corresponding path program 1 times [2019-11-19 21:12:30,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:30,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099930040] [2019-11-19 21:12:30,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-19 21:12:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:31,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 21:12:31,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:31,182 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-19 21:12:31,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-19 21:12:31,210 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:31,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:31,234 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:31,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2019-11-19 21:12:31,235 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:31,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:31,238 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:12:31,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:31,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 21:12:31,257 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:48, output treesize:20 [2019-11-19 21:12:31,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-19 21:12:31,296 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:31,353 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:31,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 40 [2019-11-19 21:12:31,380 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:31,380 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 36 [2019-11-19 21:12:31,381 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:31,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:31,402 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:31,403 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 20 [2019-11-19 21:12:31,403 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:31,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:31,406 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:12:31,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:31,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 21:12:31,417 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:50, output treesize:21 [2019-11-19 21:12:31,561 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-19 21:12:31,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099930040] [2019-11-19 21:12:31,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:31,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-19 21:12:31,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254425710] [2019-11-19 21:12:31,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 21:12:31,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:31,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 21:12:31,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:12:31,565 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2019-11-19 21:12:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:33,142 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2019-11-19 21:12:33,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:12:33,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-19 21:12:33,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:33,535 INFO L225 Difference]: With dead ends: 24 [2019-11-19 21:12:33,535 INFO L226 Difference]: Without dead ends: 19 [2019-11-19 21:12:33,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-11-19 21:12:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-19 21:12:33,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-19 21:12:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-19 21:12:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2019-11-19 21:12:33,540 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 17 [2019-11-19 21:12:33,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:33,541 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2019-11-19 21:12:33,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 21:12:33,541 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2019-11-19 21:12:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 21:12:33,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:33,542 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:33,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-19 21:12:33,746 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:33,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:33,746 INFO L82 PathProgramCache]: Analyzing trace with hash 471217663, now seen corresponding path program 1 times [2019-11-19 21:12:33,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:33,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900487415] [2019-11-19 21:12:33,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-19 21:12:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:34,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 21:12:35,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:35,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:35,385 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-19 21:12:35,385 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:46,299 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 8 [2019-11-19 21:12:46,310 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-19 21:12:46,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900487415] [2019-11-19 21:12:46,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:46,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-19 21:12:46,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730866570] [2019-11-19 21:12:46,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 21:12:46,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:46,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 21:12:46,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:12:46,312 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand 10 states. [2019-11-19 21:12:49,682 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2019-11-19 21:12:50,065 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2019-11-19 21:12:50,487 WARN L191 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-11-19 21:12:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:50,489 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2019-11-19 21:12:50,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:12:50,489 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-19 21:12:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:50,490 INFO L225 Difference]: With dead ends: 19 [2019-11-19 21:12:50,490 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:12:50,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-11-19 21:12:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:12:50,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:12:50,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:12:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:12:50,492 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-11-19 21:12:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:50,492 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:12:50,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 21:12:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:12:50,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:12:50,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-19 21:12:50,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 21:12:52,924 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-11-19 21:12:53,916 WARN L191 SmtUtils]: Spent 947.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-11-19 21:12:53,918 INFO L447 ceAbstractionStarter]: At program point L159(lines 139 160) the Hoare annotation is: true [2019-11-19 21:12:53,918 INFO L444 ceAbstractionStarter]: For program point L85(lines 85 92) no Hoare annotation was computed. [2019-11-19 21:12:53,919 INFO L444 ceAbstractionStarter]: For program point L94(lines 94 99) no Hoare annotation was computed. [2019-11-19 21:12:53,919 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 21:12:53,919 INFO L444 ceAbstractionStarter]: For program point L61(lines 61 62) no Hoare annotation was computed. [2019-11-19 21:12:53,919 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 21:12:53,919 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 122) no Hoare annotation was computed. [2019-11-19 21:12:53,919 INFO L444 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2019-11-19 21:12:53,919 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 123) no Hoare annotation was computed. [2019-11-19 21:12:53,919 INFO L444 ceAbstractionStarter]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2019-11-19 21:12:53,920 INFO L440 ceAbstractionStarter]: At program point L128-2(lines 128 132) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short16| (= (_ +zero 11 53) ~zero~0) (fp.lt ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) [2019-11-19 21:12:53,920 INFO L444 ceAbstractionStarter]: For program point L128-3(lines 128 132) no Hoare annotation was computed. [2019-11-19 21:12:53,920 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 156) no Hoare annotation was computed. [2019-11-19 21:12:53,920 INFO L440 ceAbstractionStarter]: At program point L137(line 137) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (= (_ +zero 11 53) ~zero~0) (exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_log_~lx~1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_10|)) (fp.lt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (= ULTIMATE.start___ieee754_log_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)))) (fp.lt ULTIMATE.start___ieee754_log_~x .cse0) (not (fp.eq |ULTIMATE.start___ieee754_log_#res| |ULTIMATE.start___ieee754_log_#res|)) (fp.lt ULTIMATE.start_main_~x~0 .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|))) [2019-11-19 21:12:53,920 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-19 21:12:53,920 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 117) no Hoare annotation was computed. [2019-11-19 21:12:53,921 INFO L440 ceAbstractionStarter]: At program point L122(lines 45 124) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (= (_ +zero 11 53) ~zero~0) (exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_log_~lx~1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_10|)) (fp.lt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (= ULTIMATE.start___ieee754_log_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)))) (fp.lt ULTIMATE.start___ieee754_log_~x .cse0) (not (fp.eq |ULTIMATE.start___ieee754_log_#res| |ULTIMATE.start___ieee754_log_#res|)) (fp.lt ULTIMATE.start_main_~x~0 .cse0))) [2019-11-19 21:12:53,921 INFO L444 ceAbstractionStarter]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2019-11-19 21:12:53,921 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 21:12:53,921 INFO L440 ceAbstractionStarter]: At program point L65-2(lines 65 69) the Hoare annotation is: false [2019-11-19 21:12:53,921 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2019-11-19 21:12:53,921 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-19 21:12:53,921 INFO L444 ceAbstractionStarter]: For program point L148-2(lines 148 157) no Hoare annotation was computed. [2019-11-19 21:12:53,921 INFO L444 ceAbstractionStarter]: For program point L148-4(lines 148 157) no Hoare annotation was computed. [2019-11-19 21:12:53,922 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 21:12:53,922 INFO L444 ceAbstractionStarter]: For program point L58(lines 58 70) no Hoare annotation was computed. [2019-11-19 21:12:53,922 INFO L444 ceAbstractionStarter]: For program point L58-1(lines 45 124) no Hoare annotation was computed. [2019-11-19 21:12:53,923 INFO L444 ceAbstractionStarter]: For program point L50-1(lines 50 55) no Hoare annotation was computed. [2019-11-19 21:12:53,923 INFO L440 ceAbstractionStarter]: At program point L50-2(lines 50 55) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (= (_ +zero 11 53) ~zero~0) (fp.lt ULTIMATE.start___ieee754_log_~x .cse0) (fp.lt ULTIMATE.start_main_~x~0 .cse0))) [2019-11-19 21:12:53,923 INFO L444 ceAbstractionStarter]: For program point L50-3(lines 50 55) no Hoare annotation was computed. [2019-11-19 21:12:53,923 INFO L440 ceAbstractionStarter]: At program point L133(lines 126 134) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short16| (= (_ +zero 11 53) ~zero~0) (fp.lt ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) [2019-11-19 21:12:53,923 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 60) no Hoare annotation was computed. [2019-11-19 21:12:53,923 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 100) no Hoare annotation was computed. [2019-11-19 21:12:53,923 INFO L444 ceAbstractionStarter]: For program point L76-1(lines 76 81) no Hoare annotation was computed. [2019-11-19 21:12:53,924 INFO L440 ceAbstractionStarter]: At program point L76-2(lines 76 81) the Hoare annotation is: false [2019-11-19 21:12:53,925 INFO L444 ceAbstractionStarter]: For program point L76-3(lines 76 81) no Hoare annotation was computed. [2019-11-19 21:12:53,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,939 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,941 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,942 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,947 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,948 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,948 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,949 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,950 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,951 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,951 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,952 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,952 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,953 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,954 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,955 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,956 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,956 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,958 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:53,958 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,959 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:53,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:12:53 BoogieIcfgContainer [2019-11-19 21:12:53,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:12:53,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:12:53,963 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:12:53,963 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:12:53,964 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:23" (3/4) ... [2019-11-19 21:12:53,968 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:12:53,982 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-19 21:12:53,983 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-19 21:12:53,984 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 21:12:54,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~Pluszero~LONGDOUBLE() == zero && (\exists v_skolemized_q#valueAsBitvector_10 : bv64 :: (lx == v_skolemized_q#valueAsBitvector_10[31:0] && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_10[63:63], v_skolemized_q#valueAsBitvector_10[62:52], v_skolemized_q#valueAsBitvector_10[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && hx == v_skolemized_q#valueAsBitvector_10[63:32])) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && !~fp.eq~DOUBLE(\result, \result)) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) [2019-11-19 21:12:54,017 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~Pluszero~LONGDOUBLE() == zero && (\exists v_skolemized_q#valueAsBitvector_10 : bv64 :: (lx == v_skolemized_q#valueAsBitvector_10[31:0] && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_10[63:63], v_skolemized_q#valueAsBitvector_10[62:52], v_skolemized_q#valueAsBitvector_10[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && hx == v_skolemized_q#valueAsBitvector_10[63:32])) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && !~fp.eq~DOUBLE(\result, \result)) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && 1bv32 == \result [2019-11-19 21:12:54,073 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:12:54,073 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:12:54,075 INFO L168 Benchmark]: Toolchain (without parser) took 54299.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 961.7 MB in the beginning and 843.2 MB in the end (delta: 118.5 MB). Peak memory consumption was 231.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:54,076 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:12:54,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -138.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:54,077 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:12:54,078 INFO L168 Benchmark]: Boogie Preprocessor took 47.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:54,078 INFO L168 Benchmark]: RCFGBuilder took 22859.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:54,079 INFO L168 Benchmark]: TraceAbstraction took 30756.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 850.0 MB in the end (delta: 211.2 MB). Peak memory consumption was 211.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:54,079 INFO L168 Benchmark]: Witness Printer took 111.30 ms. Allocated memory is still 1.1 GB. Free memory was 850.0 MB in the beginning and 843.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:54,082 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 460.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -138.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 22859.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30756.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 850.0 MB in the end (delta: 211.2 MB). Peak memory consumption was 211.2 MB. Max. memory is 11.5 GB. * Witness Printer took 111.30 ms. Allocated memory is still 1.1 GB. Free memory was 850.0 MB in the beginning and 843.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 154]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant [2019-11-19 21:12:54,096 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:54,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:54,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:54,099 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,099 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:54,100 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,102 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:54,102 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((~Pluszero~LONGDOUBLE() == zero && (\exists v_skolemized_q#valueAsBitvector_10 : bv64 :: (lx == v_skolemized_q#valueAsBitvector_10[31:0] && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_10[63:63], v_skolemized_q#valueAsBitvector_10[62:52], v_skolemized_q#valueAsBitvector_10[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && hx == v_skolemized_q#valueAsBitvector_10[63:32])) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && !~fp.eq~DOUBLE(\result, \result)) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant [2019-11-19 21:12:54,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:54,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (aux-x < 0 && isfinite_double(x)-aux && ~Pluszero~LONGDOUBLE() == zero) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) - InvariantResult [Line: 50]: Loop Invariant [2019-11-19 21:12:54,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:54,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:54,108 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:54,108 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~Pluszero~LONGDOUBLE() == zero && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) - InvariantResult [Line: 128]: Loop Invariant [2019-11-19 21:12:54,109 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:54,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (aux-x < 0 && isfinite_double(x)-aux && ~Pluszero~LONGDOUBLE() == zero) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) - InvariantResult [Line: 137]: Loop Invariant [2019-11-19 21:12:54,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,112 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:54,112 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,112 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:54,113 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:54,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:54,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 21:12:54,115 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:12:54,115 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~Pluszero~LONGDOUBLE() == zero && (\exists v_skolemized_q#valueAsBitvector_10 : bv64 :: (lx == v_skolemized_q#valueAsBitvector_10[31:0] && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_10[63:63], v_skolemized_q#valueAsBitvector_10[62:52], v_skolemized_q#valueAsBitvector_10[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && hx == v_skolemized_q#valueAsBitvector_10[63:32])) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && !~fp.eq~DOUBLE(\result, \result)) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && 1bv32 == \result - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. Result: SAFE, OverallTime: 30.6s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.2s, HoareTripleCheckerStatistics: 128 SDtfs, 123 SDslu, 151 SDs, 0 SdLazy, 54 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 14 NumberOfFragments, 118 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 34 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 144 ConstructedInterpolants, 35 QuantifiedInterpolants, 14508 SizeOfPredicates, 21 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...