./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 f6fb2bb1 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-f6fb2bb [2019-11-19 18:46:51,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:46:51,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:46:51,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:46:51,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:46:51,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:46:51,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:46:51,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:46:51,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:46:51,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:46:51,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:46:51,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:46:51,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:46:51,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:46:51,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:46:51,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:46:51,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:46:51,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:46:51,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:46:51,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:46:51,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:46:51,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:46:51,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:46:51,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:46:51,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:46:51,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:46:51,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:46:51,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:46:51,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:46:51,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:46:51,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:46:51,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:46:51,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:46:51,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:46:51,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:46:51,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:46:51,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:46:51,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:46:51,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:46:51,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:46:51,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:46:51,660 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 18:46:51,694 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:46:51,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:46:51,699 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:46:51,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:46:51,700 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:46:51,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:46:51,700 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:46:51,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 18:46:51,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:46:51,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:46:51,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:46:51,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:46:51,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:46:51,704 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:46:51,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:46:51,704 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:46:51,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:46:51,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:46:51,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:46:51,706 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:46:51,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:46:51,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:46:51,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:46:51,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:46:51,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:46:51,708 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 18:46:51,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 18:46:51,709 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:46:51,709 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 18:46:52,037 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:46:52,056 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:46:52,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:46:52,062 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:46:52,063 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:46:52,064 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 18:46:52,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12fa7a8bf/6dbed50b61ab40ba87431d87002d3e42/FLAG9263acb77 [2019-11-19 18:46:52,649 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:46:52,649 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0920a.c [2019-11-19 18:46:52,656 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12fa7a8bf/6dbed50b61ab40ba87431d87002d3e42/FLAG9263acb77 [2019-11-19 18:46:53,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12fa7a8bf/6dbed50b61ab40ba87431d87002d3e42 [2019-11-19 18:46:53,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:46:53,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:46:53,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:46:53,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:46:53,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:46:53,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:46:53" (1/1) ... [2019-11-19 18:46:53,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c6f5b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:53, skipping insertion in model container [2019-11-19 18:46:53,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:46:53" (1/1) ... [2019-11-19 18:46:53,029 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:46:53,054 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:46:53,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:46:53,273 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:46:53,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:46:53,423 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:46:53,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:53 WrapperNode [2019-11-19 18:46:53,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:46:53,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:46:53,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:46:53,425 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:46:53,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:53" (1/1) ... [2019-11-19 18:46:53,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:53" (1/1) ... [2019-11-19 18:46:53,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:46:53,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:46:53,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:46:53,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:46:53,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:53" (1/1) ... [2019-11-19 18:46:53,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:53" (1/1) ... [2019-11-19 18:46:53,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:53" (1/1) ... [2019-11-19 18:46:53,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:53" (1/1) ... [2019-11-19 18:46:53,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:53" (1/1) ... [2019-11-19 18:46:53,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:53" (1/1) ... [2019-11-19 18:46:53,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:53" (1/1) ... [2019-11-19 18:46:53,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:46:53,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:46:53,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:46:53,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:46:53,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:53" (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 18:46:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 18:46:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-19 18:46:53,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 18:46:53,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-19 18:46:53,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:46:53,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:46:53,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 18:46:53,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 18:46:54,097 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:46:54,098 INFO L285 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-19 18:46:54,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:46:54 BoogieIcfgContainer [2019-11-19 18:46:54,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:46:54,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:46:54,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:46:54,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:46:54,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:46:53" (1/3) ... [2019-11-19 18:46:54,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b69a675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:46:54, skipping insertion in model container [2019-11-19 18:46:54,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:53" (2/3) ... [2019-11-19 18:46:54,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b69a675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:46:54, skipping insertion in model container [2019-11-19 18:46:54,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:46:54" (3/3) ... [2019-11-19 18:46:54,110 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0920a.c [2019-11-19 18:46:54,121 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:46:54,131 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 18:46:54,142 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 18:46:54,176 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:46:54,176 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:46:54,176 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:46:54,176 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:46:54,177 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:46:54,177 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:46:54,177 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:46:54,177 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:46:54,191 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-19 18:46:54,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 18:46:54,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:46:54,200 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:46:54,201 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:46:54,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:46:54,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1394505008, now seen corresponding path program 1 times [2019-11-19 18:46:54,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:46:54,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369512547] [2019-11-19 18:46:54,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:46:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:46:54,352 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 18:46:54,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369512547] [2019-11-19 18:46:54,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:46:54,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 18:46:54,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235214335] [2019-11-19 18:46:54,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 18:46:54,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:46:54,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 18:46:54,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 18:46:54,383 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2019-11-19 18:46:54,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:46:54,408 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2019-11-19 18:46:54,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 18:46:54,409 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-19 18:46:54,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:46:54,422 INFO L225 Difference]: With dead ends: 69 [2019-11-19 18:46:54,423 INFO L226 Difference]: Without dead ends: 32 [2019-11-19 18:46:54,426 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 18:46:54,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-19 18:46:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-19 18:46:54,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-19 18:46:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-11-19 18:46:54,471 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 12 [2019-11-19 18:46:54,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:46:54,472 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-19 18:46:54,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 18:46:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2019-11-19 18:46:54,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 18:46:54,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:46:54,474 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:46:54,474 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:46:54,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:46:54,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1007782307, now seen corresponding path program 1 times [2019-11-19 18:46:54,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:46:54,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38410534] [2019-11-19 18:46:54,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:46:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:46:54,555 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 18:46:54,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38410534] [2019-11-19 18:46:54,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:46:54,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 18:46:54,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322027948] [2019-11-19 18:46:54,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:46:54,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 18:46:54,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:46:54,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:46:54,569 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 3 states. [2019-11-19 18:46:54,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:46:54,604 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2019-11-19 18:46:54,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:46:54,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-19 18:46:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:46:54,608 INFO L225 Difference]: With dead ends: 57 [2019-11-19 18:46:54,609 INFO L226 Difference]: Without dead ends: 32 [2019-11-19 18:46:54,610 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 18:46:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-19 18:46:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-19 18:46:54,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-19 18:46:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-11-19 18:46:54,624 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 13 [2019-11-19 18:46:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:46:54,624 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-19 18:46:54,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:46:54,625 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-11-19 18:46:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 18:46:54,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:46:54,627 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 18:46:54,627 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:46:54,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:46:54,628 INFO L82 PathProgramCache]: Analyzing trace with hash 32951480, now seen corresponding path program 1 times [2019-11-19 18:46:54,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 18:46:54,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774042119] [2019-11-19 18:46:54,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 18:46:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:46:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 18:46:54,887 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 18:46:54,887 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 18:46:54,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:46:54 BoogieIcfgContainer [2019-11-19 18:46:54,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:46:54,933 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:46:54,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:46:54,934 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:46:54,934 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:46:54" (3/4) ... [2019-11-19 18:46:54,938 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 18:46:54,939 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:46:54,941 INFO L168 Benchmark]: Toolchain (without parser) took 1930.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 961.7 MB in the beginning and 1.0 GB in the end (delta: -41.6 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2019-11-19 18:46:54,942 INFO L168 Benchmark]: CDTParser took 0.26 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 18:46:54,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -109.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-19 18:46:54,944 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.55 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 18:46:54,945 INFO L168 Benchmark]: Boogie Preprocessor took 42.90 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-19 18:46:54,945 INFO L168 Benchmark]: RCFGBuilder took 574.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-11-19 18:46:54,946 INFO L168 Benchmark]: TraceAbstraction took 831.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. [2019-11-19 18:46:54,947 INFO L168 Benchmark]: Witness Printer took 5.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 18:46:54,951 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 413.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -109.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.55 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 42.90 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 574.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 831.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 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.7s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.1s, 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-f6fb2bb [2019-11-19 18:46:56,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 18:46:56,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 18:46:56,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 18:46:56,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 18:46:56,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 18:46:56,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 18:46:56,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 18:46:56,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 18:46:56,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 18:46:56,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 18:46:56,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 18:46:56,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 18:46:56,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 18:46:56,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 18:46:56,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 18:46:56,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 18:46:56,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 18:46:56,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 18:46:56,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 18:46:57,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 18:46:57,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 18:46:57,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 18:46:57,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 18:46:57,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 18:46:57,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 18:46:57,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 18:46:57,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 18:46:57,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 18:46:57,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 18:46:57,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 18:46:57,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 18:46:57,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 18:46:57,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 18:46:57,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 18:46:57,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 18:46:57,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 18:46:57,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 18:46:57,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 18:46:57,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 18:46:57,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 18:46:57,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 18:46:57,030 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 18:46:57,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 18:46:57,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 18:46:57,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 18:46:57,033 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 18:46:57,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 18:46:57,033 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 18:46:57,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 18:46:57,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 18:46:57,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 18:46:57,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 18:46:57,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 18:46:57,035 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 18:46:57,035 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 18:46:57,036 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 18:46:57,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 18:46:57,036 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 18:46:57,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 18:46:57,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 18:46:57,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 18:46:57,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 18:46:57,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 18:46:57,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 18:46:57,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 18:46:57,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 18:46:57,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 18:46:57,039 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 18:46:57,039 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 18:46:57,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 18:46:57,042 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 18:46:57,042 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 18:46:57,343 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 18:46:57,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 18:46:57,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 18:46:57,367 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 18:46:57,367 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 18:46:57,368 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 18:46:57,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac5b19f50/f20c2f74ba474b6e85895c501a9b6ae1/FLAGdb88b505b [2019-11-19 18:46:57,930 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 18:46:57,930 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0920a.c [2019-11-19 18:46:57,937 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac5b19f50/f20c2f74ba474b6e85895c501a9b6ae1/FLAGdb88b505b [2019-11-19 18:46:58,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac5b19f50/f20c2f74ba474b6e85895c501a9b6ae1 [2019-11-19 18:46:58,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 18:46:58,305 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 18:46:58,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 18:46:58,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 18:46:58,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 18:46:58,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:46:58" (1/1) ... [2019-11-19 18:46:58,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59bd2459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:58, skipping insertion in model container [2019-11-19 18:46:58,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:46:58" (1/1) ... [2019-11-19 18:46:58,329 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 18:46:58,380 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 18:46:58,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:46:58,729 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 18:46:58,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 18:46:58,888 INFO L192 MainTranslator]: Completed translation [2019-11-19 18:46:58,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:58 WrapperNode [2019-11-19 18:46:58,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 18:46:58,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 18:46:58,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 18:46:58,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 18:46:58,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:58" (1/1) ... [2019-11-19 18:46:58,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:58" (1/1) ... [2019-11-19 18:46:58,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 18:46:58,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 18:46:58,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 18:46:58,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 18:46:58,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:58" (1/1) ... [2019-11-19 18:46:58,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:58" (1/1) ... [2019-11-19 18:46:58,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:58" (1/1) ... [2019-11-19 18:46:58,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:58" (1/1) ... [2019-11-19 18:46:58,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:58" (1/1) ... [2019-11-19 18:46:58,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:58" (1/1) ... [2019-11-19 18:46:58,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:58" (1/1) ... [2019-11-19 18:46:58,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 18:46:58,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 18:46:58,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 18:46:58,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 18:46:58,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:58" (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 18:46:59,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-19 18:46:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-19 18:46:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 18:46:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 18:46:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 18:46:59,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 18:46:59,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 18:46:59,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 18:47:24,291 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 18:47:24,291 INFO L285 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-19 18:47:24,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:24 BoogieIcfgContainer [2019-11-19 18:47:24,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 18:47:24,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 18:47:24,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 18:47:24,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 18:47:24,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:46:58" (1/3) ... [2019-11-19 18:47:24,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179087cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:47:24, skipping insertion in model container [2019-11-19 18:47:24,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:46:58" (2/3) ... [2019-11-19 18:47:24,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179087cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:47:24, skipping insertion in model container [2019-11-19 18:47:24,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:24" (3/3) ... [2019-11-19 18:47:24,301 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0920a.c [2019-11-19 18:47:24,312 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 18:47:24,320 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 18:47:24,332 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 18:47:24,353 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 18:47:24,354 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 18:47:24,354 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 18:47:24,354 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 18:47:24,355 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 18:47:24,355 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 18:47:24,355 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 18:47:24,355 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 18:47:24,368 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-19 18:47:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 18:47:24,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:24,375 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:24,375 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:24,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:24,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1394505008, now seen corresponding path program 1 times [2019-11-19 18:47:24,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:47:24,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120241968] [2019-11-19 18:47:24,393 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 18:47:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:24,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-19 18:47:24,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:47:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:24,565 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:47:24,572 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 18:47:24,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120241968] [2019-11-19 18:47:24,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:24,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 18:47:24,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199185260] [2019-11-19 18:47:24,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 18:47:24,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:47:24,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 18:47:24,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 18:47:24,600 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2019-11-19 18:47:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:24,625 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2019-11-19 18:47:24,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 18:47:24,629 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-19 18:47:24,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:24,642 INFO L225 Difference]: With dead ends: 69 [2019-11-19 18:47:24,642 INFO L226 Difference]: Without dead ends: 32 [2019-11-19 18:47:24,645 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 18:47:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-19 18:47:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-19 18:47:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-19 18:47:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-11-19 18:47:24,677 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 12 [2019-11-19 18:47:24,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:24,677 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-19 18:47:24,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 18:47:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2019-11-19 18:47:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 18:47:24,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:24,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 18:47:24,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-19 18:47:24,880 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:24,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1007782307, now seen corresponding path program 1 times [2019-11-19 18:47:24,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:47:24,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366994318] [2019-11-19 18:47:24,884 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 18:47:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:25,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 18:47:25,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:47:25,088 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 18:47:25,088 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:47:25,091 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 18:47:25,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366994318] [2019-11-19 18:47:25,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:25,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-19 18:47:25,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293722574] [2019-11-19 18:47:25,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 18:47:25,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:47:25,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 18:47:25,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 18:47:25,097 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 3 states. [2019-11-19 18:47:25,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:25,145 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2019-11-19 18:47:25,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 18:47:25,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-19 18:47:25,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:25,147 INFO L225 Difference]: With dead ends: 57 [2019-11-19 18:47:25,148 INFO L226 Difference]: Without dead ends: 32 [2019-11-19 18:47:25,149 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 18:47:25,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-19 18:47:25,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-19 18:47:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-19 18:47:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-11-19 18:47:25,158 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 13 [2019-11-19 18:47:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:25,158 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-19 18:47:25,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 18:47:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-11-19 18:47:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 18:47:25,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:25,159 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 18:47:25,360 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-19 18:47:25,361 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:25,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:25,361 INFO L82 PathProgramCache]: Analyzing trace with hash 32951480, now seen corresponding path program 1 times [2019-11-19 18:47:25,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:47:25,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902890991] [2019-11-19 18:47:25,363 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 18:47:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:25,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 18:47:25,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:47:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 18:47:25,701 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:47:25,894 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 18:47:25,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902890991] [2019-11-19 18:47:25,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:25,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-19 18:47:25,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907235629] [2019-11-19 18:47:25,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 18:47:25,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:47:25,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 18:47:25,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-19 18:47:25,897 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 10 states. [2019-11-19 18:47:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:31,177 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2019-11-19 18:47:31,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 18:47:31,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-19 18:47:31,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:31,220 INFO L225 Difference]: With dead ends: 37 [2019-11-19 18:47:31,220 INFO L226 Difference]: Without dead ends: 19 [2019-11-19 18:47:31,221 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 18:47:31,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-19 18:47:31,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-19 18:47:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-19 18:47:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-11-19 18:47:31,226 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-11-19 18:47:31,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:31,226 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-11-19 18:47:31,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 18:47:31,227 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-11-19 18:47:31,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 18:47:31,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:31,228 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 18:47:31,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-19 18:47:31,439 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:31,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:31,440 INFO L82 PathProgramCache]: Analyzing trace with hash -677236169, now seen corresponding path program 1 times [2019-11-19 18:47:31,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:47:31,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373465745] [2019-11-19 18:47:31,442 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 18:47:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:32,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 18:47:32,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:47:32,550 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 18:47:32,569 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 18:47:32,570 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:32,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:32,606 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:32,607 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 18:47:32,608 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:32,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:32,613 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 18:47:32,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:32,628 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 18:47:32,628 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:48, output treesize:20 [2019-11-19 18:47:32,689 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 18:47:32,690 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:47:32,766 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:32,767 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 18:47:32,804 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:32,805 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 18:47:32,806 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:32,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:32,839 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:32,839 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 18:47:32,841 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 18:47:32,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:32,847 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 18:47:32,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 18:47:32,858 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 18:47:32,858 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:50, output treesize:21 [2019-11-19 18:47:33,027 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 18:47:33,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373465745] [2019-11-19 18:47:33,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:33,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-19 18:47:33,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778831874] [2019-11-19 18:47:33,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 18:47:33,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:47:33,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 18:47:33,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-19 18:47:33,032 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2019-11-19 18:47:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:34,998 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2019-11-19 18:47:35,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 18:47:35,403 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-19 18:47:35,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:35,404 INFO L225 Difference]: With dead ends: 24 [2019-11-19 18:47:35,404 INFO L226 Difference]: Without dead ends: 19 [2019-11-19 18:47:35,405 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 18:47:35,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-19 18:47:35,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-19 18:47:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-19 18:47:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2019-11-19 18:47:35,409 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 17 [2019-11-19 18:47:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:35,410 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2019-11-19 18:47:35,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 18:47:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2019-11-19 18:47:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 18:47:35,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 18:47:35,411 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 18:47:35,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-19 18:47:35,612 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 18:47:35,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 18:47:35,613 INFO L82 PathProgramCache]: Analyzing trace with hash 471217663, now seen corresponding path program 1 times [2019-11-19 18:47:35,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 18:47:35,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455213558] [2019-11-19 18:47:35,614 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 18:47:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 18:47:36,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 18:47:36,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 18:47:37,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 18:47:37,420 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 18:47:37,421 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 18:47:51,114 WARN L191 SmtUtils]: Spent 2.46 s on a formula simplification that was a NOOP. DAG size: 8 [2019-11-19 18:47:51,128 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 18:47:51,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455213558] [2019-11-19 18:47:51,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 18:47:51,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-19 18:47:51,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79820289] [2019-11-19 18:47:51,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 18:47:51,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 18:47:51,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 18:47:51,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=66, Unknown=2, NotChecked=0, Total=90 [2019-11-19 18:47:51,132 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand 10 states. [2019-11-19 18:47:54,261 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2019-11-19 18:47:54,836 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2019-11-19 18:47:55,290 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-11-19 18:47:55,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 18:47:55,292 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2019-11-19 18:47:55,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 18:47:55,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-19 18:47:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 18:47:55,293 INFO L225 Difference]: With dead ends: 19 [2019-11-19 18:47:55,293 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 18:47:55,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=49, Invalid=105, Unknown=2, NotChecked=0, Total=156 [2019-11-19 18:47:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 18:47:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 18:47:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 18:47:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 18:47:55,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-11-19 18:47:55,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 18:47:55,295 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 18:47:55,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 18:47:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 18:47:55,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 18:47:55,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-19 18:47:55,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 18:47:57,674 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-11-19 18:47:57,937 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-11-19 18:47:57,939 INFO L447 ceAbstractionStarter]: At program point L159(lines 139 160) the Hoare annotation is: true [2019-11-19 18:47:57,940 INFO L444 ceAbstractionStarter]: For program point L85(lines 85 92) no Hoare annotation was computed. [2019-11-19 18:47:57,940 INFO L444 ceAbstractionStarter]: For program point L94(lines 94 99) no Hoare annotation was computed. [2019-11-19 18:47:57,940 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 18:47:57,940 INFO L444 ceAbstractionStarter]: For program point L61(lines 61 62) no Hoare annotation was computed. [2019-11-19 18:47:57,940 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 18:47:57,940 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 122) no Hoare annotation was computed. [2019-11-19 18:47:57,941 INFO L444 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2019-11-19 18:47:57,941 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 123) no Hoare annotation was computed. [2019-11-19 18:47:57,941 INFO L444 ceAbstractionStarter]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2019-11-19 18:47:57,941 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 18:47:57,941 INFO L444 ceAbstractionStarter]: For program point L128-3(lines 128 132) no Hoare annotation was computed. [2019-11-19 18:47:57,941 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 156) no Hoare annotation was computed. [2019-11-19 18:47:57,942 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 18:47:57,942 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-19 18:47:57,942 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 117) no Hoare annotation was computed. [2019-11-19 18:47:57,942 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 18:47:57,942 INFO L444 ceAbstractionStarter]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2019-11-19 18:47:57,943 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 18:47:57,943 INFO L440 ceAbstractionStarter]: At program point L65-2(lines 65 69) the Hoare annotation is: false [2019-11-19 18:47:57,943 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2019-11-19 18:47:57,943 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-19 18:47:57,943 INFO L444 ceAbstractionStarter]: For program point L148-2(lines 148 157) no Hoare annotation was computed. [2019-11-19 18:47:57,943 INFO L444 ceAbstractionStarter]: For program point L148-4(lines 148 157) no Hoare annotation was computed. [2019-11-19 18:47:57,944 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 18:47:57,944 INFO L444 ceAbstractionStarter]: For program point L58(lines 58 70) no Hoare annotation was computed. [2019-11-19 18:47:57,944 INFO L444 ceAbstractionStarter]: For program point L58-1(lines 45 124) no Hoare annotation was computed. [2019-11-19 18:47:57,944 INFO L444 ceAbstractionStarter]: For program point L50-1(lines 50 55) no Hoare annotation was computed. [2019-11-19 18:47:57,944 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 18:47:57,944 INFO L444 ceAbstractionStarter]: For program point L50-3(lines 50 55) no Hoare annotation was computed. [2019-11-19 18:47:57,945 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 18:47:57,945 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 60) no Hoare annotation was computed. [2019-11-19 18:47:57,945 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 100) no Hoare annotation was computed. [2019-11-19 18:47:57,945 INFO L444 ceAbstractionStarter]: For program point L76-1(lines 76 81) no Hoare annotation was computed. [2019-11-19 18:47:57,945 INFO L440 ceAbstractionStarter]: At program point L76-2(lines 76 81) the Hoare annotation is: false [2019-11-19 18:47:57,945 INFO L444 ceAbstractionStarter]: For program point L76-3(lines 76 81) no Hoare annotation was computed. [2019-11-19 18:47:57,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,959 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,960 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,960 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,967 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,968 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,968 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,969 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,969 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,970 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,970 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,971 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,971 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,971 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,972 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,974 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,975 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,975 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,977 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:57,978 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,978 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:57,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:47:57 BoogieIcfgContainer [2019-11-19 18:47:57,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 18:47:57,984 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 18:47:57,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 18:47:57,984 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 18:47:57,985 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:47:24" (3/4) ... [2019-11-19 18:47:57,990 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 18:47:58,008 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-19 18:47:58,009 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-19 18:47:58,044 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 18:47:58,045 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 18:47:58,121 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 18:47:58,121 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 18:47:58,123 INFO L168 Benchmark]: Toolchain (without parser) took 59818.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 959.0 MB in the beginning and 870.3 MB in the end (delta: 88.7 MB). Peak memory consumption was 224.5 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:58,125 INFO L168 Benchmark]: CDTParser took 0.58 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 18:47:58,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 579.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:58,126 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.72 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:58,127 INFO L168 Benchmark]: Boogie Preprocessor took 46.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:58,127 INFO L168 Benchmark]: RCFGBuilder took 25295.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:58,128 INFO L168 Benchmark]: TraceAbstraction took 33687.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 877.0 MB in the end (delta: 203.1 MB). Peak memory consumption was 203.1 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:58,128 INFO L168 Benchmark]: Witness Printer took 137.54 ms. Allocated memory is still 1.2 GB. Free memory was 877.0 MB in the beginning and 870.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 18:47:58,130 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.58 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 579.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.72 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 25295.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33687.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 877.0 MB in the end (delta: 203.1 MB). Peak memory consumption was 203.1 MB. Max. memory is 11.5 GB. * Witness Printer took 137.54 ms. Allocated memory is still 1.2 GB. Free memory was 877.0 MB in the beginning and 870.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 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 18:47:58,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,145 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:58,145 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,145 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:58,146 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:58,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:58,148 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:58,148 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 18:47:58,150 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:58,151 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 18:47:58,158 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:58,158 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:58,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:58,159 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 18:47:58,160 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:58,160 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 18:47:58,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:58,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:58,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:58,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,163 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,164 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:58,164 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2019-11-19 18:47:58,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 18:47:58,165 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: 33.5s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, HoareTripleCheckerStatistics: 128 SDtfs, 123 SDslu, 151 SDs, 0 SdLazy, 54 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 16.6s 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, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 144 ConstructedInterpolants, 35 QuantifiedInterpolants, 14508 SizeOfPredicates, 21 NumberOfNonLiveVariables, 289 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...