./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0920a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/float-newlib/double_req_bl_0920a_true-unreach-call.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: 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 /storage/repos/svcomp/c/float-newlib/double_req_bl_0920a_true-unreach-call.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-2e94e6a [2018-12-31 03:56:27,797 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:56:27,802 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:56:27,817 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:56:27,818 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:56:27,820 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:56:27,823 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:56:27,825 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:56:27,826 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:56:27,827 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:56:27,828 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:56:27,829 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:56:27,829 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:56:27,830 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:56:27,832 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:56:27,833 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:56:27,833 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:56:27,836 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:56:27,838 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:56:27,840 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:56:27,841 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:56:27,842 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:56:27,845 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:56:27,845 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:56:27,846 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:56:27,847 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:56:27,848 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:56:27,849 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:56:27,850 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:56:27,851 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:56:27,851 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:56:27,852 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:56:27,853 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:56:27,853 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:56:27,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:56:27,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:56:27,856 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 03:56:27,888 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:56:27,889 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:56:27,890 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:56:27,890 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:56:27,890 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:56:27,890 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:56:27,892 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:56:27,892 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:56:27,893 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:56:27,893 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:56:27,893 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:56:27,893 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:56:27,893 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:56:27,894 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:56:27,895 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:56:27,895 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:56:27,895 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:56:27,896 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:56:27,896 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:56:27,896 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:56:27,896 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:56:27,896 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:56:27,896 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:56:27,899 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:56:27,900 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:56:27,900 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:56:27,900 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:56:27,900 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:56:27,900 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 [2018-12-31 03:56:27,977 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:56:27,994 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:56:28,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:56:28,004 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:56:28,004 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:56:28,005 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0920a_true-unreach-call.c [2018-12-31 03:56:28,057 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45ecfcf8/185578e649d04f00bdb9cdf582177c49/FLAG4274d636b [2018-12-31 03:56:28,489 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:56:28,490 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0920a_true-unreach-call.c [2018-12-31 03:56:28,498 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45ecfcf8/185578e649d04f00bdb9cdf582177c49/FLAG4274d636b [2018-12-31 03:56:28,850 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b45ecfcf8/185578e649d04f00bdb9cdf582177c49 [2018-12-31 03:56:28,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:56:28,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:56:28,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:56:28,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:56:28,860 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:56:28,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:56:28" (1/1) ... [2018-12-31 03:56:28,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5694ea96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:28, skipping insertion in model container [2018-12-31 03:56:28,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:56:28" (1/1) ... [2018-12-31 03:56:28,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:56:28,899 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:56:29,172 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:56:29,177 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:56:29,224 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:56:29,251 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:56:29,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:29 WrapperNode [2018-12-31 03:56:29,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:56:29,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:56:29,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:56:29,252 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:56:29,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:29" (1/1) ... [2018-12-31 03:56:29,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:29" (1/1) ... [2018-12-31 03:56:29,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:56:29,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:56:29,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:56:29,395 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:56:29,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:29" (1/1) ... [2018-12-31 03:56:29,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:29" (1/1) ... [2018-12-31 03:56:29,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:29" (1/1) ... [2018-12-31 03:56:29,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:29" (1/1) ... [2018-12-31 03:56:29,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:29" (1/1) ... [2018-12-31 03:56:29,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:29" (1/1) ... [2018-12-31 03:56:29,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:29" (1/1) ... [2018-12-31 03:56:29,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:56:29,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:56:29,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:56:29,442 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:56:29,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:29" (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 [2018-12-31 03:56:29,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:56:29,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-12-31 03:56:29,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 03:56:29,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 03:56:29,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:56:29,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:56:29,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 03:56:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:56:30,220 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:56:30,223 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-12-31 03:56:30,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:56:30 BoogieIcfgContainer [2018-12-31 03:56:30,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:56:30,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:56:30,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:56:30,229 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:56:30,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:56:28" (1/3) ... [2018-12-31 03:56:30,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dd7b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:56:30, skipping insertion in model container [2018-12-31 03:56:30,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:29" (2/3) ... [2018-12-31 03:56:30,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dd7b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:56:30, skipping insertion in model container [2018-12-31 03:56:30,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:56:30" (3/3) ... [2018-12-31 03:56:30,233 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0920a_true-unreach-call.c [2018-12-31 03:56:30,244 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:56:30,253 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:56:30,272 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:56:30,307 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:56:30,308 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:56:30,309 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:56:30,309 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:56:30,309 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:56:30,310 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:56:30,310 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:56:30,310 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:56:30,310 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:56:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-12-31 03:56:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:56:30,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:56:30,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:56:30,339 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:56:30,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:56:30,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1394505008, now seen corresponding path program 1 times [2018-12-31 03:56:30,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:56:30,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:56:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:56:30,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:56:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:56:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:56:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:56:30,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:56:30,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:56:30,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:56:30,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:56:30,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:56:30,531 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-12-31 03:56:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:56:30,556 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2018-12-31 03:56:30,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:56:30,558 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-12-31 03:56:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:56:30,579 INFO L225 Difference]: With dead ends: 69 [2018-12-31 03:56:30,579 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 03:56:30,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:56:30,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 03:56:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-31 03:56:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-31 03:56:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2018-12-31 03:56:30,618 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 12 [2018-12-31 03:56:30,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:56:30,618 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2018-12-31 03:56:30,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:56:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2018-12-31 03:56:30,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 03:56:30,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:56:30,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:56:30,620 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:56:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:56:30,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1007782307, now seen corresponding path program 1 times [2018-12-31 03:56:30,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:56:30,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:56:30,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:56:30,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:56:30,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:56:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:56:30,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:56:30,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:56:30,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 03:56:30,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 03:56:30,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 03:56:30,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 03:56:30,725 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 3 states. [2018-12-31 03:56:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:56:30,760 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2018-12-31 03:56:30,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 03:56:30,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-31 03:56:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:56:30,765 INFO L225 Difference]: With dead ends: 57 [2018-12-31 03:56:30,765 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 03:56:30,769 INFO L631 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 [2018-12-31 03:56:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 03:56:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-31 03:56:30,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-31 03:56:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2018-12-31 03:56:30,775 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 13 [2018-12-31 03:56:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:56:30,775 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-12-31 03:56:30,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 03:56:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2018-12-31 03:56:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 03:56:30,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:56:30,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:56:30,778 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:56:30,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:56:30,778 INFO L82 PathProgramCache]: Analyzing trace with hash 32951480, now seen corresponding path program 1 times [2018-12-31 03:56:30,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:56:30,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:56:30,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:56:30,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:56:30,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:56:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:56:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:56:30,960 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:56:31,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:56:31 BoogieIcfgContainer [2018-12-31 03:56:31,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:56:31,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:56:31,010 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:56:31,011 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:56:31,011 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:56:30" (3/4) ... [2018-12-31 03:56:31,016 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:56:31,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:56:31,017 INFO L168 Benchmark]: Toolchain (without parser) took 2162.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -79.3 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-31 03:56:31,020 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:56:31,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.99 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:56:31,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-31 03:56:31,023 INFO L168 Benchmark]: Boogie Preprocessor took 46.57 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: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:56:31,024 INFO L168 Benchmark]: RCFGBuilder took 782.19 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-12-31 03:56:31,025 INFO L168 Benchmark]: TraceAbstraction took 784.50 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: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-12-31 03:56:31,025 INFO L168 Benchmark]: Witness Printer took 6.65 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. [2018-12-31 03:56:31,030 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 395.99 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 142.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.57 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: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 782.19 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 784.50 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: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Witness Printer took 6.65 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. UNSAFE Result, 0.7s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 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, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:56:33,499 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:56:33,501 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:56:33,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:56:33,514 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:56:33,515 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:56:33,517 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:56:33,519 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:56:33,522 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:56:33,523 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:56:33,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:56:33,531 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:56:33,532 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:56:33,533 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:56:33,534 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:56:33,534 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:56:33,535 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:56:33,537 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:56:33,542 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:56:33,544 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:56:33,545 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:56:33,546 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:56:33,550 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:56:33,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:56:33,550 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:56:33,551 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:56:33,553 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:56:33,554 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:56:33,555 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:56:33,556 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:56:33,556 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:56:33,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:56:33,558 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:56:33,558 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:56:33,559 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:56:33,560 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:56:33,560 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 03:56:33,593 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:56:33,593 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:56:33,594 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:56:33,597 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:56:33,597 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:56:33,597 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:56:33,597 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:56:33,597 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:56:33,598 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:56:33,598 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:56:33,598 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:56:33,598 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:56:33,598 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:56:33,598 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:56:33,599 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:56:33,599 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:56:33,599 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:56:33,599 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:56:33,599 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:56:33,599 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:56:33,603 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:56:33,603 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:56:33,603 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:56:33,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:56:33,604 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:56:33,604 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:56:33,604 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:56:33,604 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:56:33,604 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:56:33,604 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:56:33,605 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 [2018-12-31 03:56:33,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:56:33,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:56:33,693 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:56:33,694 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:56:33,695 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:56:33,695 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0920a_true-unreach-call.c [2018-12-31 03:56:33,748 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b543a4cb7/9f81c4a184174fbbbdc295326185e2f6/FLAGa0618a66f [2018-12-31 03:56:34,180 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:56:34,181 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0920a_true-unreach-call.c [2018-12-31 03:56:34,189 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b543a4cb7/9f81c4a184174fbbbdc295326185e2f6/FLAGa0618a66f [2018-12-31 03:56:34,537 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b543a4cb7/9f81c4a184174fbbbdc295326185e2f6 [2018-12-31 03:56:34,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:56:34,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:56:34,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:56:34,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:56:34,547 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:56:34,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:56:34" (1/1) ... [2018-12-31 03:56:34,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b6e0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:34, skipping insertion in model container [2018-12-31 03:56:34,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:56:34" (1/1) ... [2018-12-31 03:56:34,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:56:34,587 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:56:34,876 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:56:34,883 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:56:34,945 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:56:34,978 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:56:34,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:34 WrapperNode [2018-12-31 03:56:34,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:56:34,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:56:34,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:56:34,980 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:56:35,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:34" (1/1) ... [2018-12-31 03:56:35,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:34" (1/1) ... [2018-12-31 03:56:35,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:56:35,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:56:35,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:56:35,109 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:56:35,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:34" (1/1) ... [2018-12-31 03:56:35,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:34" (1/1) ... [2018-12-31 03:56:35,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:34" (1/1) ... [2018-12-31 03:56:35,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:34" (1/1) ... [2018-12-31 03:56:35,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:34" (1/1) ... [2018-12-31 03:56:35,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:34" (1/1) ... [2018-12-31 03:56:35,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:34" (1/1) ... [2018-12-31 03:56:35,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:56:35,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:56:35,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:56:35,174 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:56:35,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:34" (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 [2018-12-31 03:56:35,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-12-31 03:56:35,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-31 03:56:35,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:56:35,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 03:56:35,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:56:35,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:56:35,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-31 03:56:35,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:56:35,619 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:56:35,745 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:56:41,115 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:56:41,222 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:57:00,824 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:57:00,824 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-12-31 03:57:00,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:57:00 BoogieIcfgContainer [2018-12-31 03:57:00,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:57:00,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:57:00,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:57:00,835 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:57:00,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:56:34" (1/3) ... [2018-12-31 03:57:00,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f57378a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:57:00, skipping insertion in model container [2018-12-31 03:57:00,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:34" (2/3) ... [2018-12-31 03:57:00,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f57378a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:57:00, skipping insertion in model container [2018-12-31 03:57:00,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:57:00" (3/3) ... [2018-12-31 03:57:00,841 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0920a_true-unreach-call.c [2018-12-31 03:57:00,852 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:57:00,861 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:57:00,882 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:57:00,914 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:57:00,915 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:57:00,915 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:57:00,915 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:57:00,916 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:57:00,916 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:57:00,916 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:57:00,916 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:57:00,916 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:57:00,931 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-12-31 03:57:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:57:00,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:57:00,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:57:00,942 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:57:00,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:57:00,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1394505008, now seen corresponding path program 1 times [2018-12-31 03:57:00,954 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:57:00,954 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-12-31 03:57:00,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:57:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:57:01,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:57:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:57:01,086 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:57:01,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:57:01,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:57:01,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:57:01,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:57:01,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:57:01,121 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-12-31 03:57:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:57:01,140 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2018-12-31 03:57:01,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:57:01,142 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-12-31 03:57:01,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:57:01,155 INFO L225 Difference]: With dead ends: 69 [2018-12-31 03:57:01,155 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 03:57:01,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:57:01,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 03:57:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-31 03:57:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-31 03:57:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2018-12-31 03:57:01,199 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 12 [2018-12-31 03:57:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:57:01,199 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2018-12-31 03:57:01,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:57:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2018-12-31 03:57:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 03:57:01,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:57:01,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:57:01,201 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:57:01,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:57:01,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1007782307, now seen corresponding path program 1 times [2018-12-31 03:57:01,202 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:57:01,202 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-12-31 03:57:01,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:57:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:57:01,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:57:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:57:01,408 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:57:01,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:57:01,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 03:57:01,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 03:57:01,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 03:57:01,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 03:57:01,429 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 3 states. [2018-12-31 03:57:01,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:57:01,519 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2018-12-31 03:57:01,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 03:57:01,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-31 03:57:01,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:57:01,522 INFO L225 Difference]: With dead ends: 57 [2018-12-31 03:57:01,522 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 03:57:01,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 03:57:01,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 03:57:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-31 03:57:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-31 03:57:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2018-12-31 03:57:01,530 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 13 [2018-12-31 03:57:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:57:01,531 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-12-31 03:57:01,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 03:57:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2018-12-31 03:57:01,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 03:57:01,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:57:01,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:57:01,534 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:57:01,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:57:01,534 INFO L82 PathProgramCache]: Analyzing trace with hash 32951480, now seen corresponding path program 1 times [2018-12-31 03:57:01,535 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:57:01,536 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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) [2018-12-31 03:57:01,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-31 03:57:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:57:01,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:57:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:57:02,103 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:57:02,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:57:02,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:57:02,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:57:02,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:57:02,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:57:02,118 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 6 states. [2018-12-31 03:57:02,318 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-12-31 03:57:05,465 WARN L181 SmtUtils]: Spent 903.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-31 03:57:10,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:57:10,010 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-12-31 03:57:10,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:57:10,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-31 03:57:10,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:57:10,043 INFO L225 Difference]: With dead ends: 37 [2018-12-31 03:57:10,043 INFO L226 Difference]: Without dead ends: 19 [2018-12-31 03:57:10,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=23, Invalid=48, Unknown=1, NotChecked=0, Total=72 [2018-12-31 03:57:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-31 03:57:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-31 03:57:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-31 03:57:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-31 03:57:10,049 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-31 03:57:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:57:10,049 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-31 03:57:10,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:57:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-31 03:57:10,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 03:57:10,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:57:10,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:57:10,051 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:57:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:57:10,051 INFO L82 PathProgramCache]: Analyzing trace with hash -677236169, now seen corresponding path program 1 times [2018-12-31 03:57:10,052 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:57:10,052 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-12-31 03:57:10,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:57:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:57:10,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:57:11,092 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:57:11,094 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:57:11,096 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:57:11,099 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:57:11,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2018-12-31 03:57:11,250 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-12-31 03:57:11,420 INFO L303 Elim1Store]: Index analysis took 164 ms [2018-12-31 03:57:11,422 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 56 [2018-12-31 03:57:11,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-12-31 03:57:11,466 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 03:57:11,615 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:57:11,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-31 03:57:11,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2018-12-31 03:57:11,721 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 03:57:11,730 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:57:11,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-12-31 03:57:11,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-31 03:57:11,832 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-31 03:57:11,835 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:57:11,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:57:11,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-31 03:57:11,894 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:73, output treesize:30 [2018-12-31 03:57:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:57:11,964 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:57:11,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:57:11,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:57:11,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:57:11,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:57:11,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:57:11,993 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 6 states. [2018-12-31 03:57:14,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:57:14,825 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2018-12-31 03:57:15,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:57:15,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-31 03:57:15,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:57:15,205 INFO L225 Difference]: With dead ends: 24 [2018-12-31 03:57:15,205 INFO L226 Difference]: Without dead ends: 19 [2018-12-31 03:57:15,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:57:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-31 03:57:15,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-31 03:57:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-31 03:57:15,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2018-12-31 03:57:15,211 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 17 [2018-12-31 03:57:15,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:57:15,211 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2018-12-31 03:57:15,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:57:15,212 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2018-12-31 03:57:15,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:57:15,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:57:15,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:57:15,213 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:57:15,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:57:15,213 INFO L82 PathProgramCache]: Analyzing trace with hash 471217663, now seen corresponding path program 1 times [2018-12-31 03:57:15,214 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:57:15,214 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-12-31 03:57:15,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:57:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:57:16,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:57:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:57:16,983 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:57:17,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:57:17,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 03:57:17,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:57:17,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:57:17,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:57:17,006 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand 6 states. [2018-12-31 03:57:20,532 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 03:57:21,642 WARN L181 SmtUtils]: Spent 797.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-31 03:57:21,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:57:21,643 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2018-12-31 03:57:21,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:57:21,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-31 03:57:21,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:57:21,644 INFO L225 Difference]: With dead ends: 19 [2018-12-31 03:57:21,644 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 03:57:21,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:57:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 03:57:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 03:57:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 03:57:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 03:57:21,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-12-31 03:57:21,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:57:21,646 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 03:57:21,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:57:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 03:57:21,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 03:57:21,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 03:57:24,358 WARN L181 SmtUtils]: Spent 2.64 s on a formula simplification that was a NOOP. DAG size: 25 [2018-12-31 03:57:25,567 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-31 03:57:25,573 INFO L451 ceAbstractionStarter]: At program point L159(lines 139 160) the Hoare annotation is: true [2018-12-31 03:57:25,573 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 92) no Hoare annotation was computed. [2018-12-31 03:57:25,574 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 99) no Hoare annotation was computed. [2018-12-31 03:57:25,574 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 03:57:25,574 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 62) no Hoare annotation was computed. [2018-12-31 03:57:25,574 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 03:57:25,574 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 122) no Hoare annotation was computed. [2018-12-31 03:57:25,574 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2018-12-31 03:57:25,574 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 123) no Hoare annotation was computed. [2018-12-31 03:57:25,575 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2018-12-31 03:57:25,575 INFO L444 ceAbstractionStarter]: At program point L128-2(lines 128 132) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short16| (fp.lt ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (= (_ +zero 11 53) ~zero~0)) [2018-12-31 03:57:25,575 INFO L448 ceAbstractionStarter]: For program point L128-3(lines 128 132) no Hoare annotation was computed. [2018-12-31 03:57:25,575 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 156) no Hoare annotation was computed. [2018-12-31 03:57:25,575 INFO L444 ceAbstractionStarter]: At program point L137(line 137) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (exists ((ULTIMATE.start___ieee754_log_~x (_ FloatingPoint 11 53))) (= |ULTIMATE.start___ieee754_log_#res| (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start___ieee754_log_~x ULTIMATE.start___ieee754_log_~x) (_ +zero 11 53)))) (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (fp.lt ULTIMATE.start_main_~x~0 .cse0) (exists ((|v_q#valueAsBitvector_5| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_5|) ULTIMATE.start___ieee754_log_~hx~1) (fp.lt (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))) (fp.lt ULTIMATE.start___ieee754_log_~x .cse0))) [2018-12-31 03:57:25,576 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-31 03:57:25,577 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 117) no Hoare annotation was computed. [2018-12-31 03:57:25,577 INFO L444 ceAbstractionStarter]: At program point L122(lines 45 124) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (exists ((ULTIMATE.start___ieee754_log_~x (_ FloatingPoint 11 53))) (= |ULTIMATE.start___ieee754_log_#res| (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start___ieee754_log_~x ULTIMATE.start___ieee754_log_~x) (_ +zero 11 53)))) (fp.lt ULTIMATE.start_main_~x~0 .cse0) (exists ((|v_q#valueAsBitvector_5| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_5|) ULTIMATE.start___ieee754_log_~hx~1) (fp.lt (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))) (fp.lt ULTIMATE.start___ieee754_log_~x .cse0))) [2018-12-31 03:57:25,578 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2018-12-31 03:57:25,578 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 03:57:25,578 INFO L444 ceAbstractionStarter]: At program point L65-2(lines 65 69) the Hoare annotation is: false [2018-12-31 03:57:25,578 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-31 03:57:25,578 INFO L448 ceAbstractionStarter]: For program point L148-2(lines 148 157) no Hoare annotation was computed. [2018-12-31 03:57:25,578 INFO L448 ceAbstractionStarter]: For program point L148-4(lines 148 157) no Hoare annotation was computed. [2018-12-31 03:57:25,578 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 03:57:25,578 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 70) no Hoare annotation was computed. [2018-12-31 03:57:25,579 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 45 124) no Hoare annotation was computed. [2018-12-31 03:57:25,587 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 50 55) no Hoare annotation was computed. [2018-12-31 03:57:25,587 INFO L444 ceAbstractionStarter]: At program point L50-2(lines 50 55) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.lt ULTIMATE.start_main_~x~0 .cse0) (fp.lt ULTIMATE.start___ieee754_log_~x .cse0) (= (_ +zero 11 53) ~zero~0))) [2018-12-31 03:57:25,587 INFO L448 ceAbstractionStarter]: For program point L50-3(lines 50 55) no Hoare annotation was computed. [2018-12-31 03:57:25,587 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 134) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short16| (fp.lt ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (= (_ +zero 11 53) ~zero~0)) [2018-12-31 03:57:25,588 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2018-12-31 03:57:25,588 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 60) no Hoare annotation was computed. [2018-12-31 03:57:25,588 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 100) no Hoare annotation was computed. [2018-12-31 03:57:25,588 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 81) no Hoare annotation was computed. [2018-12-31 03:57:25,588 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 81) the Hoare annotation is: false [2018-12-31 03:57:25,588 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 76 81) no Hoare annotation was computed. [2018-12-31 03:57:25,603 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,604 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,605 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2018-12-31 03:57:25,605 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2018-12-31 03:57:25,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,605 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,605 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,606 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,606 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,606 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,606 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,610 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,610 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2018-12-31 03:57:25,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2018-12-31 03:57:25,611 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,612 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,612 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,614 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,615 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,615 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,615 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,616 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,616 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,616 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,617 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,618 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,618 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2018-12-31 03:57:25,618 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2018-12-31 03:57:25,618 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,619 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,619 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,619 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,619 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2018-12-31 03:57:25,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2018-12-31 03:57:25,621 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,623 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,623 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:57:25 BoogieIcfgContainer [2018-12-31 03:57:25,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:57:25,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:57:25,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:57:25,628 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:57:25,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:57:00" (3/4) ... [2018-12-31 03:57:25,639 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 03:57:25,653 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-31 03:57:25,654 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-31 03:57:25,684 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists ULTIMATE.start___ieee754_log_~x : C_DOUBLE :: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.sub~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_log_~x, ULTIMATE.start___ieee754_log_~x), ~Pluszero~LONGDOUBLE())) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && (\exists v_q#valueAsBitvector_5 : bv64 :: v_q#valueAsBitvector_5[63:32] == hx && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)))) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) [2018-12-31 03:57:25,685 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists ULTIMATE.start___ieee754_log_~x : C_DOUBLE :: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.sub~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_log_~x, ULTIMATE.start___ieee754_log_~x), ~Pluszero~LONGDOUBLE())) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && (\exists v_q#valueAsBitvector_5 : bv64 :: v_q#valueAsBitvector_5[63:32] == hx && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)))) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) [2018-12-31 03:57:25,764 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 03:57:25,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:57:25,769 INFO L168 Benchmark]: Toolchain (without parser) took 51225.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 951.4 MB in the beginning and 905.4 MB in the end (delta: 46.0 MB). Peak memory consumption was 167.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:57:25,770 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:57:25,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.64 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:57:25,771 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -174.9 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:57:25,771 INFO L168 Benchmark]: Boogie Preprocessor took 64.48 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. [2018-12-31 03:57:25,772 INFO L168 Benchmark]: RCFGBuilder took 25652.10 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: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. [2018-12-31 03:57:25,772 INFO L168 Benchmark]: TraceAbstraction took 24801.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 912.1 MB in the end (delta: 157.1 MB). Peak memory consumption was 157.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:57:25,773 INFO L168 Benchmark]: Witness Printer took 136.63 ms. Allocated memory is still 1.2 GB. Free memory was 912.1 MB in the beginning and 905.4 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:57:25,776 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 436.64 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 128.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -174.9 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.48 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. * RCFGBuilder took 25652.10 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: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24801.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 912.1 MB in the end (delta: 157.1 MB). Peak memory consumption was 157.1 MB. Max. memory is 11.5 GB. * Witness Printer took 136.63 ms. Allocated memory is still 1.2 GB. Free memory was 912.1 MB in the beginning and 905.4 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation 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[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,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_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,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_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,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 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[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,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_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,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_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,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 [2018-12-31 03:57:25,784 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,787 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2018-12-31 03:57:25,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2018-12-31 03:57:25,788 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,789 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,789 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,790 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,790 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2018-12-31 03:57:25,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2018-12-31 03:57:25,790 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,791 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,792 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((\exists ULTIMATE.start___ieee754_log_~x : C_DOUBLE :: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.sub~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_log_~x, ULTIMATE.start___ieee754_log_~x), ~Pluszero~LONGDOUBLE())) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && (\exists v_q#valueAsBitvector_5 : bv64 :: v_q#valueAsBitvector_5[63:32] == hx && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)))) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant [2018-12-31 03:57:25,795 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,796 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (aux-x < 0 && isfinite_double(x)-aux && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~Pluszero~LONGDOUBLE() == zero - InvariantResult [Line: 50]: Loop Invariant [2018-12-31 03:57:25,796 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,796 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,797 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,797 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~Pluszero~LONGDOUBLE() == zero - InvariantResult [Line: 128]: Loop Invariant [2018-12-31 03:57:25,797 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,797 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (aux-x < 0 && isfinite_double(x)-aux && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~Pluszero~LONGDOUBLE() == zero - InvariantResult [Line: 137]: Loop Invariant [2018-12-31 03:57:25,798 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,798 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2018-12-31 03:57:25,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2018-12-31 03:57:25,799 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,800 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,800 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,801 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,801 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2018-12-31 03:57:25,808 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2018-12-31 03:57:25,808 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,808 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,809 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,809 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,809 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:57:25,809 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:57:25,809 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((\exists ULTIMATE.start___ieee754_log_~x : C_DOUBLE :: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.sub~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_log_~x, ULTIMATE.start___ieee754_log_~x), ~Pluszero~LONGDOUBLE())) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && (\exists v_q#valueAsBitvector_5 : bv64 :: v_q#valueAsBitvector_5[63:32] == hx && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)))) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. SAFE Result, 24.6s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 15.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 128 SDtfs, 54 SDslu, 127 SDs, 0 SdLazy, 43 SolverSat, 1 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.5s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 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, 0 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 72 ConstructedInterpolants, 8 QuantifiedInterpolants, 5743 SizeOfPredicates, 18 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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...