./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0833_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_0833_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 e9c6bf05d102b43fb2b728009d6b55f3314474ef ............................................................................................................................................................................................................................................................................................................... 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_0833_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 e9c6bf05d102b43fb2b728009d6b55f3314474ef ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:54:43,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:54:44,000 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:54:44,012 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:54:44,013 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:54:44,014 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:54:44,015 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:54:44,018 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:54:44,020 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:54:44,021 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:54:44,022 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:54:44,022 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:54:44,023 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:54:44,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:54:44,026 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:54:44,027 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:54:44,028 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:54:44,030 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:54:44,033 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:54:44,034 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:54:44,036 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:54:44,037 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:54:44,040 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:54:44,041 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:54:44,041 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:54:44,042 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:54:44,044 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:54:44,044 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:54:44,046 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:54:44,047 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:54:44,047 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:54:44,049 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:54:44,049 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:54:44,049 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:54:44,050 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:54:44,052 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:54:44,052 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:54:44,074 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:54:44,075 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:54:44,076 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:54:44,076 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:54:44,076 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:54:44,078 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:54:44,079 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:54:44,079 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:54:44,079 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:54:44,079 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:54:44,079 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:54:44,079 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:54:44,081 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:54:44,081 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:54:44,081 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:54:44,081 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:54:44,082 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:54:44,082 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:54:44,082 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:54:44,082 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:54:44,082 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:54:44,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:54:44,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:54:44,087 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:54:44,087 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:54:44,087 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:54:44,087 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:54:44,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:54:44,088 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 -> e9c6bf05d102b43fb2b728009d6b55f3314474ef [2018-12-31 03:54:44,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:54:44,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:54:44,189 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:54:44,191 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:54:44,191 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:54:44,192 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0833_true-unreach-call.c [2018-12-31 03:54:44,248 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73a1aef9/53410a457fde44d1b267a77626a79276/FLAGe1ab64935 [2018-12-31 03:54:44,679 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:54:44,680 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0833_true-unreach-call.c [2018-12-31 03:54:44,689 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73a1aef9/53410a457fde44d1b267a77626a79276/FLAGe1ab64935 [2018-12-31 03:54:45,046 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73a1aef9/53410a457fde44d1b267a77626a79276 [2018-12-31 03:54:45,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:54:45,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:54:45,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:54:45,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:54:45,057 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:54:45,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:54:45" (1/1) ... [2018-12-31 03:54:45,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649944d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:45, skipping insertion in model container [2018-12-31 03:54:45,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:54:45" (1/1) ... [2018-12-31 03:54:45,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:54:45,105 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:54:45,415 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:54:45,423 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:54:45,472 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:54:45,500 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:54:45,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:45 WrapperNode [2018-12-31 03:54:45,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:54:45,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:54:45,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:54:45,503 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:54:45,587 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:54:45" (1/1) ... [2018-12-31 03:54:45,606 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:54:45" (1/1) ... [2018-12-31 03:54:45,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:54:45,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:54:45,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:54:45,656 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:54:45,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:45" (1/1) ... [2018-12-31 03:54:45,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:45" (1/1) ... [2018-12-31 03:54:45,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:45" (1/1) ... [2018-12-31 03:54:45,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:45" (1/1) ... [2018-12-31 03:54:45,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:45" (1/1) ... [2018-12-31 03:54:45,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:45" (1/1) ... [2018-12-31 03:54:45,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:45" (1/1) ... [2018-12-31 03:54:45,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:54:45,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:54:45,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:54:45,704 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:54:45,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:45" (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:54:45,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:54:45,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 03:54:45,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-12-31 03:54:45,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 03:54:45,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:54:45,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:54:45,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 03:54:45,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2018-12-31 03:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:54:46,689 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:54:46,689 INFO L280 CfgBuilder]: Removed 22 assue(true) statements. [2018-12-31 03:54:46,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:54:46 BoogieIcfgContainer [2018-12-31 03:54:46,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:54:46,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:54:46,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:54:46,695 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:54:46,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:54:45" (1/3) ... [2018-12-31 03:54:46,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421eba2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:54:46, skipping insertion in model container [2018-12-31 03:54:46,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:45" (2/3) ... [2018-12-31 03:54:46,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421eba2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:54:46, skipping insertion in model container [2018-12-31 03:54:46,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:54:46" (3/3) ... [2018-12-31 03:54:46,700 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0833_true-unreach-call.c [2018-12-31 03:54:46,711 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:54:46,720 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:54:46,739 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:54:46,774 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:54:46,774 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:54:46,775 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:54:46,775 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:54:46,776 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:54:46,776 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:54:46,776 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:54:46,776 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:54:46,777 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:54:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-12-31 03:54:46,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:54:46,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:54:46,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:54:46,807 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:54:46,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:54:46,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1722268475, now seen corresponding path program 1 times [2018-12-31 03:54:46,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:54:46,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:54:46,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:54:46,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:54:46,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:54:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:54:46,969 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:54:46,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:54:46,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:54:46,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:54:46,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:54:46,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:54:46,993 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-12-31 03:54:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:54:47,014 INFO L93 Difference]: Finished difference Result 86 states and 140 transitions. [2018-12-31 03:54:47,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:54:47,015 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-31 03:54:47,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:54:47,027 INFO L225 Difference]: With dead ends: 86 [2018-12-31 03:54:47,028 INFO L226 Difference]: Without dead ends: 41 [2018-12-31 03:54:47,031 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:54:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-31 03:54:47,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-31 03:54:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-31 03:54:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2018-12-31 03:54:47,073 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 11 [2018-12-31 03:54:47,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:54:47,073 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-12-31 03:54:47,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:54:47,074 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2018-12-31 03:54:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:54:47,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:54:47,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:54:47,075 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:54:47,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:54:47,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1102347550, now seen corresponding path program 1 times [2018-12-31 03:54:47,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:54:47,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:54:47,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:54:47,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:54:47,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:54:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:54:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:54:47,250 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:54:47,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:54:47 BoogieIcfgContainer [2018-12-31 03:54:47,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:54:47,336 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:54:47,336 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:54:47,336 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:54:47,338 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:54:46" (3/4) ... [2018-12-31 03:54:47,343 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:54:47,343 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:54:47,344 INFO L168 Benchmark]: Toolchain (without parser) took 2293.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -77.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:54:47,347 INFO L168 Benchmark]: CDTParser took 0.15 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:54:47,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.80 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:54:47,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:54:47,351 INFO L168 Benchmark]: Boogie Preprocessor took 48.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:54:47,351 INFO L168 Benchmark]: RCFGBuilder took 985.94 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: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2018-12-31 03:54:47,353 INFO L168 Benchmark]: TraceAbstraction took 644.03 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: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:54:47,354 INFO L168 Benchmark]: Witness Printer took 7.23 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:54:47,360 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.15 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 448.80 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 153.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 985.94 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: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 644.03 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: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * Witness Printer took 7.23 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: 153]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 21, overapproximation of someBinaryArithmeticDOUBLEoperation at line 71, overapproximation of bitwiseAnd at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 152. Possible FailurePath: [L17-L42] static const double one_exp = 1.0, halF_exp[2] = { 0.5, -0.5, }, huge_exp = 1.0e+300, twom1000_exp = 9.33263618503218878990e-302, o_threshold_exp = 7.09782712893383973096e+02, u_threshold_exp = -7.45133219101941108420e+02, ln2HI_exp[2] = { 6.93147180369123816490e-01, -6.93147180369123816490e-01, }, ln2LO_exp[2] = { 1.90821492927058770002e-10, -1.90821492927058770002e-10, }, invln2_exp = 1.44269504088896338700e+00, P1_exp = 1.66666666666666019037e-01, P2_exp = -2.77777777770155933842e-03, P3_exp = 6.61375632143793436117e-05, P4_exp = -1.65339022054652515390e-06, P5_exp = 4.13813679705723846039e-08; VAL [halF_exp={-3:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={-2:0}, ln2LO_exp={1:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L149] double x = -1.0 / 0.0; [L45] double y, hi, lo, c, t; [L46] __int32_t k = 0, xsb; [L47] __uint32_t hx; VAL [halF_exp={-3:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={-2:0}, ln2LO_exp={1:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L50] ieee_double_shape_type gh_u; [L51] gh_u.value = (x) [L52] EXPR gh_u.parts.msw [L52] (hx) = gh_u.parts.msw [L54] xsb = (hx >> 31) & 1 [L55] hx &= 0x7fffffff VAL [halF_exp={-3:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={-2:0}, ln2LO_exp={1:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L57] COND TRUE hx >= 0x40862E42 VAL [halF_exp={-3:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={-2:0}, ln2LO_exp={1:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L58] COND FALSE !(hx >= 0x7ff00000) VAL [halF_exp={-3:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={-2:0}, ln2LO_exp={1:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L70] COND TRUE x > o_threshold_exp [L71] return huge_exp * huge_exp; VAL [halF_exp={-3:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={-2:0}, ln2LO_exp={1:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] double res = __ieee754_exp(x); [L152] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [halF_exp={-3:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={-2:0}, ln2LO_exp={1:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L152] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L153] __VERIFIER_error() VAL [halF_exp={-3:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={-2:0}, ln2LO_exp={1:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 1 error locations. UNSAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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:54:49,795 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:54:49,797 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:54:49,809 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:54:49,810 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:54:49,811 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:54:49,813 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:54:49,815 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:54:49,817 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:54:49,818 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:54:49,819 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:54:49,820 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:54:49,821 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:54:49,822 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:54:49,824 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:54:49,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:54:49,826 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:54:49,828 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:54:49,831 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:54:49,833 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:54:49,835 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:54:49,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:54:49,840 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:54:49,841 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:54:49,841 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:54:49,842 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:54:49,843 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:54:49,844 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:54:49,845 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:54:49,847 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:54:49,847 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:54:49,848 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:54:49,848 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:54:49,848 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:54:49,849 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:54:49,850 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:54:49,850 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:54:49,869 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:54:49,871 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:54:49,874 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:54:49,875 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:54:49,875 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:54:49,875 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:54:49,876 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:54:49,876 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:54:49,876 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:54:49,876 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:54:49,876 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:54:49,877 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:54:49,877 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:54:49,877 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:54:49,877 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:54:49,880 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:54:49,880 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:54:49,880 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:54:49,880 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:54:49,883 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:54:49,883 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:54:49,883 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:54:49,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:54:49,884 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:54:49,884 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:54:49,884 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:54:49,884 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:54:49,884 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:54:49,884 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:54:49,885 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:54:49,885 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 -> e9c6bf05d102b43fb2b728009d6b55f3314474ef [2018-12-31 03:54:49,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:54:49,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:54:49,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:54:49,969 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:54:49,969 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:54:49,970 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0833_true-unreach-call.c [2018-12-31 03:54:50,036 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c11ce76d5/0fb15cfe7c6c481897ce00f2bd2842f6/FLAG84602b25a [2018-12-31 03:54:50,473 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:54:50,474 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0833_true-unreach-call.c [2018-12-31 03:54:50,482 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c11ce76d5/0fb15cfe7c6c481897ce00f2bd2842f6/FLAG84602b25a [2018-12-31 03:54:50,832 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c11ce76d5/0fb15cfe7c6c481897ce00f2bd2842f6 [2018-12-31 03:54:50,836 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:54:50,837 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:54:50,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:54:50,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:54:50,845 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:54:50,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:54:50" (1/1) ... [2018-12-31 03:54:50,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1788681d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:50, skipping insertion in model container [2018-12-31 03:54:50,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:54:50" (1/1) ... [2018-12-31 03:54:50,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:54:50,899 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:54:51,256 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:54:51,266 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:54:51,320 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:54:51,356 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:54:51,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:51 WrapperNode [2018-12-31 03:54:51,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:54:51,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:54:51,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:54:51,358 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:54:51,439 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:54:51" (1/1) ... [2018-12-31 03:54:51,456 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:54:51" (1/1) ... [2018-12-31 03:54:51,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:54:51,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:54:51,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:54:51,496 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:54:51,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:51" (1/1) ... [2018-12-31 03:54:51,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:51" (1/1) ... [2018-12-31 03:54:51,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:51" (1/1) ... [2018-12-31 03:54:51,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:51" (1/1) ... [2018-12-31 03:54:51,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:51" (1/1) ... [2018-12-31 03:54:51,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:51" (1/1) ... [2018-12-31 03:54:51,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:51" (1/1) ... [2018-12-31 03:54:51,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:54:51,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:54:51,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:54:51,586 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:54:51,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:51" (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:54:51,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-12-31 03:54:51,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-31 03:54:51,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:54:51,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2018-12-31 03:54:51,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 03:54:51,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:54:51,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:54:51,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-31 03:54:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:54:51,953 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:54:52,018 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:54:52,079 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:54:52,710 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:54:52,742 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:55:04,980 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:55:05,004 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:55:05,054 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:55:05,081 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:55:05,081 INFO L280 CfgBuilder]: Removed 22 assue(true) statements. [2018-12-31 03:55:05,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:55:05 BoogieIcfgContainer [2018-12-31 03:55:05,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:55:05,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:55:05,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:55:05,087 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:55:05,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:54:50" (1/3) ... [2018-12-31 03:55:05,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215ced8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:55:05, skipping insertion in model container [2018-12-31 03:55:05,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:51" (2/3) ... [2018-12-31 03:55:05,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215ced8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:55:05, skipping insertion in model container [2018-12-31 03:55:05,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:55:05" (3/3) ... [2018-12-31 03:55:05,093 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0833_true-unreach-call.c [2018-12-31 03:55:05,105 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:55:05,115 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:55:05,136 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:55:05,186 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:55:05,187 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:55:05,187 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:55:05,187 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:55:05,187 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:55:05,187 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:55:05,187 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:55:05,188 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:55:05,189 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:55:05,212 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-12-31 03:55:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:55:05,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:55:05,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:55:05,232 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:55:05,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:55:05,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1722268475, now seen corresponding path program 1 times [2018-12-31 03:55:05,247 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:55:05,248 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:55:05,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:55:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:55:05,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:55:05,735 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:55:05,736 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:55:05,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:55:05,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:55:05,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:55:05,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:55:05,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:55:05,770 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-12-31 03:55:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:55:05,793 INFO L93 Difference]: Finished difference Result 86 states and 140 transitions. [2018-12-31 03:55:05,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:55:05,796 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-31 03:55:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:55:05,811 INFO L225 Difference]: With dead ends: 86 [2018-12-31 03:55:05,811 INFO L226 Difference]: Without dead ends: 41 [2018-12-31 03:55:05,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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:55:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-31 03:55:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-31 03:55:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-31 03:55:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2018-12-31 03:55:05,857 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 11 [2018-12-31 03:55:05,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:55:05,857 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-12-31 03:55:05,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:55:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2018-12-31 03:55:05,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:55:05,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:55:05,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:55:05,859 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:55:05,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:55:05,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1102347550, now seen corresponding path program 1 times [2018-12-31 03:55:05,861 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:55:05,861 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:55:05,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:55:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:55:06,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:55:06,360 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:55:06,361 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:55:06,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:55:06,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 03:55:06,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 03:55:06,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 03:55:06,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:55:06,377 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 5 states. [2018-12-31 03:55:06,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:55:06,683 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-12-31 03:55:06,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 03:55:06,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-12-31 03:55:06,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:55:06,686 INFO L225 Difference]: With dead ends: 50 [2018-12-31 03:55:06,686 INFO L226 Difference]: Without dead ends: 21 [2018-12-31 03:55:06,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:55:06,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-31 03:55:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-31 03:55:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-31 03:55:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-31 03:55:06,694 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2018-12-31 03:55:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:55:06,694 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-31 03:55:06,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 03:55:06,695 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-12-31 03:55:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:55:06,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:55:06,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:55:06,696 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:55:06,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:55:06,696 INFO L82 PathProgramCache]: Analyzing trace with hash -691534902, now seen corresponding path program 1 times [2018-12-31 03:55:06,697 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:55:06,697 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) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-31 03:55:06,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:55:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:55:06,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:55:07,142 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:55:07,142 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:55:07,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:55:07,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:55:07,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:55:07,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:55:07,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:55:07,159 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2018-12-31 03:55:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:55:07,401 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-12-31 03:55:07,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:55:07,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-31 03:55:07,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:55:07,403 INFO L225 Difference]: With dead ends: 30 [2018-12-31 03:55:07,403 INFO L226 Difference]: Without dead ends: 21 [2018-12-31 03:55:07,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:55:07,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-31 03:55:07,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-31 03:55:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-31 03:55:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-31 03:55:07,410 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2018-12-31 03:55:07,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:55:07,411 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-31 03:55:07,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:55:07,411 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-31 03:55:07,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 03:55:07,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:55:07,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:55:07,412 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:55:07,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:55:07,413 INFO L82 PathProgramCache]: Analyzing trace with hash -129518544, now seen corresponding path program 1 times [2018-12-31 03:55:07,413 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:55:07,413 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:55:07,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:55:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:55:07,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:55:07,648 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:55:07,649 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:55:07,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:55:07,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 03:55:07,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 03:55:07,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 03:55:07,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:55:07,670 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-12-31 03:55:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:55:07,834 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-31 03:55:07,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 03:55:07,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-31 03:55:07,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:55:07,838 INFO L225 Difference]: With dead ends: 31 [2018-12-31 03:55:07,838 INFO L226 Difference]: Without dead ends: 21 [2018-12-31 03:55:07,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:55:07,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-31 03:55:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-31 03:55:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-31 03:55:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-31 03:55:07,848 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-12-31 03:55:07,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:55:07,848 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-31 03:55:07,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 03:55:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-31 03:55:07,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 03:55:07,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:55:07,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:55:07,849 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:55:07,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:55:07,850 INFO L82 PathProgramCache]: Analyzing trace with hash -72260242, now seen corresponding path program 1 times [2018-12-31 03:55:07,850 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:55:07,850 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:55:07,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:55:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:55:08,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:55:08,281 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:55:08,284 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:55:08,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:55:08,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 03:55:08,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 03:55:08,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 03:55:08,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:55:08,296 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 5 states. [2018-12-31 03:55:08,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:55:08,444 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2018-12-31 03:55:08,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 03:55:08,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-31 03:55:08,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:55:08,447 INFO L225 Difference]: With dead ends: 24 [2018-12-31 03:55:08,448 INFO L226 Difference]: Without dead ends: 21 [2018-12-31 03:55:08,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:55:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-31 03:55:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-31 03:55:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-31 03:55:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2018-12-31 03:55:08,457 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 16 [2018-12-31 03:55:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:55:08,457 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2018-12-31 03:55:08,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 03:55:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-12-31 03:55:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 03:55:08,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:55:08,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:55:08,459 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:55:08,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:55:08,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1346464765, now seen corresponding path program 1 times [2018-12-31 03:55:08,460 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:55:08,460 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-31 03:55:08,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:55:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:55:08,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:55:08,755 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:55:08,756 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:55:08,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:55:08,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 03:55:08,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 03:55:08,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 03:55:08,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:55:08,770 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand 9 states. [2018-12-31 03:55:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:55:09,162 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-12-31 03:55:09,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:55:09,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-12-31 03:55:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:55:09,164 INFO L225 Difference]: With dead ends: 21 [2018-12-31 03:55:09,165 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 03:55:09,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-31 03:55:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 03:55:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 03:55:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 03:55:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 03:55:09,167 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-12-31 03:55:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:55:09,167 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 03:55:09,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 03:55:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 03:55:09,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 03:55:09,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 03:55:09,598 WARN L181 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2018-12-31 03:55:09,848 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2018-12-31 03:55:10,040 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-12-31 03:55:10,045 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 60 64) no Hoare annotation was computed. [2018-12-31 03:55:10,046 INFO L444 ceAbstractionStarter]: At program point L60-2(lines 60 64) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_exp_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (exists ((v_prenex_23 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_23) ((_ extract 62 52) v_prenex_23) ((_ extract 51 0) v_prenex_23)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= (bvand (_ bv1 32) (bvlshr ((_ extract 63 32) v_prenex_23) (_ bv31 32))) ULTIMATE.start___ieee754_exp_~xsb~0))) (exists ((v_prenex_21 (_ BitVec 64))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= ULTIMATE.start___ieee754_exp_~hx~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_21)))))) [2018-12-31 03:55:10,046 INFO L448 ceAbstractionStarter]: For program point L60-3(lines 58 69) no Hoare annotation was computed. [2018-12-31 03:55:10,046 INFO L448 ceAbstractionStarter]: For program point L77(lines 77 86) no Hoare annotation was computed. [2018-12-31 03:55:10,046 INFO L448 ceAbstractionStarter]: For program point L77-2(lines 77 86) no Hoare annotation was computed. [2018-12-31 03:55:10,046 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 102 106) no Hoare annotation was computed. [2018-12-31 03:55:10,048 INFO L444 ceAbstractionStarter]: At program point L102-2(lines 102 106) the Hoare annotation is: false [2018-12-31 03:55:10,048 INFO L444 ceAbstractionStarter]: At program point L127(lines 44 129) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_exp_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_exp_~lx~0 ((_ extract 31 0) |v_q#valueAsBitvector_9|)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (exists ((v_prenex_23 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_23) ((_ extract 62 52) v_prenex_23) ((_ extract 51 0) v_prenex_23)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= (bvand (_ bv1 32) (bvlshr ((_ extract 63 32) v_prenex_23) (_ bv31 32))) ULTIMATE.start___ieee754_exp_~xsb~0))) (exists ((v_prenex_21 (_ BitVec 64))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= ULTIMATE.start___ieee754_exp_~hx~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_21))))) (= |ULTIMATE.start___ieee754_exp_#res| (_ +zero 11 53))) [2018-12-31 03:55:10,048 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 03:55:10,048 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 03:55:10,048 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-12-31 03:55:10,050 INFO L448 ceAbstractionStarter]: For program point L152-2(lines 152 155) no Hoare annotation was computed. [2018-12-31 03:55:10,050 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 71) no Hoare annotation was computed. [2018-12-31 03:55:10,050 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-12-31 03:55:10,051 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 99) no Hoare annotation was computed. [2018-12-31 03:55:10,051 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 126) no Hoare annotation was computed. [2018-12-31 03:55:10,051 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 91) no Hoare annotation was computed. [2018-12-31 03:55:10,052 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 114 128) no Hoare annotation was computed. [2018-12-31 03:55:10,052 INFO L448 ceAbstractionStarter]: For program point L121-2(lines 121 126) no Hoare annotation was computed. [2018-12-31 03:55:10,052 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 76 91) no Hoare annotation was computed. [2018-12-31 03:55:10,052 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 73) no Hoare annotation was computed. [2018-12-31 03:55:10,052 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 90) no Hoare annotation was computed. [2018-12-31 03:55:10,052 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 03:55:10,053 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 74) no Hoare annotation was computed. [2018-12-31 03:55:10,053 INFO L448 ceAbstractionStarter]: For program point L57-2(lines 44 129) no Hoare annotation was computed. [2018-12-31 03:55:10,053 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 49 53) no Hoare annotation was computed. [2018-12-31 03:55:10,053 INFO L444 ceAbstractionStarter]: At program point L49-2(lines 49 53) the Hoare annotation is: (= ULTIMATE.start___ieee754_exp_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) [2018-12-31 03:55:10,053 INFO L448 ceAbstractionStarter]: For program point L49-3(lines 49 53) no Hoare annotation was computed. [2018-12-31 03:55:10,056 INFO L444 ceAbstractionStarter]: At program point L140(lines 131 141) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_exp_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_exp_~lx~0 ((_ extract 31 0) |v_q#valueAsBitvector_9|)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) |ULTIMATE.start_main_#t~short22| (= (_ bv0 32) |ULTIMATE.start___signbit_double_#res|) (exists ((v_prenex_23 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_23) ((_ extract 62 52) v_prenex_23) ((_ extract 51 0) v_prenex_23)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= (bvand (_ bv1 32) (bvlshr ((_ extract 63 32) v_prenex_23) (_ bv31 32))) ULTIMATE.start___ieee754_exp_~xsb~0))) (exists ((v_prenex_21 (_ BitVec 64))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= ULTIMATE.start___ieee754_exp_~hx~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_21))))) (= |ULTIMATE.start___ieee754_exp_#res| (_ +zero 11 53)) (exists ((v_prenex_24 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_prenex_24) ((_ extract 62 52) v_prenex_24) ((_ extract 51 0) v_prenex_24))) (= ((_ extract 63 32) v_prenex_24) ULTIMATE.start___signbit_double_~msw~0)))) [2018-12-31 03:55:10,056 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 112) no Hoare annotation was computed. [2018-12-31 03:55:10,056 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 100 114) no Hoare annotation was computed. [2018-12-31 03:55:10,056 INFO L448 ceAbstractionStarter]: For program point L107-2(lines 107 112) no Hoare annotation was computed. [2018-12-31 03:55:10,056 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 03:55:10,057 INFO L451 ceAbstractionStarter]: At program point L157(lines 143 158) the Hoare annotation is: true [2018-12-31 03:55:10,057 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 69) no Hoare annotation was computed. [2018-12-31 03:55:10,057 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 116 120) no Hoare annotation was computed. [2018-12-31 03:55:10,057 INFO L444 ceAbstractionStarter]: At program point L116-2(lines 116 120) the Hoare annotation is: false [2018-12-31 03:55:10,057 INFO L448 ceAbstractionStarter]: For program point L100(lines 100 128) no Hoare annotation was computed. [2018-12-31 03:55:10,057 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2018-12-31 03:55:10,057 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-12-31 03:55:10,058 INFO L444 ceAbstractionStarter]: At program point L134-2(lines 134 138) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_exp_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_exp_~lx~0 ((_ extract 31 0) |v_q#valueAsBitvector_9|)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))))) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) |ULTIMATE.start_main_#t~short22| (exists ((v_prenex_23 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_23) ((_ extract 62 52) v_prenex_23) ((_ extract 51 0) v_prenex_23)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= (bvand (_ bv1 32) (bvlshr ((_ extract 63 32) v_prenex_23) (_ bv31 32))) ULTIMATE.start___ieee754_exp_~xsb~0))) (exists ((v_prenex_21 (_ BitVec 64))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_21) ((_ extract 62 52) v_prenex_21) ((_ extract 51 0) v_prenex_21))) (= ULTIMATE.start___ieee754_exp_~hx~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_21))))) (= |ULTIMATE.start___ieee754_exp_#res| (_ +zero 11 53))) [2018-12-31 03:55:10,058 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 153) no Hoare annotation was computed. [2018-12-31 03:55:10,058 INFO L448 ceAbstractionStarter]: For program point L134-3(lines 134 138) no Hoare annotation was computed. [2018-12-31 03:55:10,058 INFO L448 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2018-12-31 03:55:10,070 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,072 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,073 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,073 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,074 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,074 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,074 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,074 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,075 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,075 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,075 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,075 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,076 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,076 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,076 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,076 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,083 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,083 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,083 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,084 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,084 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,084 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,085 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,085 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,085 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,085 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,086 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,086 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,086 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,086 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,087 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,087 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,087 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,087 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,089 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,090 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,090 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,090 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,091 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,091 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,091 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,092 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,092 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,092 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,092 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,093 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,093 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,093 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,093 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,094 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,094 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,094 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,095 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,095 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,095 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,095 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,096 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,096 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,097 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,097 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,098 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,099 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,099 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,101 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,101 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,101 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,102 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,102 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,103 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,103 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,103 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,103 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,104 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,104 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,104 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,104 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2018-12-31 03:55:10,105 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2018-12-31 03:55:10,105 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2018-12-31 03:55:10,105 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2018-12-31 03:55:10,109 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,109 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,110 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,110 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,110 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,111 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,111 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,112 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,113 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,113 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,113 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,114 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,114 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,114 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,114 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,115 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2018-12-31 03:55:10,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2018-12-31 03:55:10,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2018-12-31 03:55:10,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2018-12-31 03:55:10,123 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,123 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,124 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,124 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,129 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,130 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,133 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,133 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,136 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,136 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,137 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,137 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,137 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,137 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,137 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,143 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,144 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,144 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,144 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,144 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,144 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:55:10 BoogieIcfgContainer [2018-12-31 03:55:10,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:55:10,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:55:10,151 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:55:10,152 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:55:10,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:55:05" (3/4) ... [2018-12-31 03:55:10,157 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 03:55:10,173 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-31 03:55:10,173 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-31 03:55:10,205 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && (\exists v_prenex_23 : bv64 :: ~fp~LONGDOUBLE(v_prenex_23[63:63], v_prenex_23[62:52], v_prenex_23[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && ~bvand32(1bv32, ~bvlshr32(v_prenex_23[63:32], 31bv32)) == xsb)) && (\exists v_prenex_21 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_21[63:63], v_prenex_21[62:52], v_prenex_21[51:0]) && hx == ~bvand32(2147483647bv32, v_prenex_21[63:32])) [2018-12-31 03:55:10,205 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_9 : bv64 :: lx == v_q#valueAsBitvector_9[31:0] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_prenex_23 : bv64 :: ~fp~LONGDOUBLE(v_prenex_23[63:63], v_prenex_23[62:52], v_prenex_23[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && ~bvand32(1bv32, ~bvlshr32(v_prenex_23[63:32], 31bv32)) == xsb)) && (\exists v_prenex_21 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_21[63:63], v_prenex_21[62:52], v_prenex_21[51:0]) && hx == ~bvand32(2147483647bv32, v_prenex_21[63:32]))) && \result == ~Pluszero~LONGDOUBLE() [2018-12-31 03:55:10,206 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_9 : bv64 :: lx == v_q#valueAsBitvector_9[31:0] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()))) && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_prenex_23 : bv64 :: ~fp~LONGDOUBLE(v_prenex_23[63:63], v_prenex_23[62:52], v_prenex_23[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && ~bvand32(1bv32, ~bvlshr32(v_prenex_23[63:32], 31bv32)) == xsb)) && (\exists v_prenex_21 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_21[63:63], v_prenex_21[62:52], v_prenex_21[51:0]) && hx == ~bvand32(2147483647bv32, v_prenex_21[63:32]))) && \result == ~Pluszero~LONGDOUBLE() [2018-12-31 03:55:10,207 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_9 : bv64 :: lx == v_q#valueAsBitvector_9[31:0] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()))) && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && 0bv32 == \result) && (\exists v_prenex_23 : bv64 :: ~fp~LONGDOUBLE(v_prenex_23[63:63], v_prenex_23[62:52], v_prenex_23[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && ~bvand32(1bv32, ~bvlshr32(v_prenex_23[63:32], 31bv32)) == xsb)) && (\exists v_prenex_21 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_21[63:63], v_prenex_21[62:52], v_prenex_21[51:0]) && hx == ~bvand32(2147483647bv32, v_prenex_21[63:32]))) && \result == ~Pluszero~LONGDOUBLE()) && (\exists v_prenex_24 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_prenex_24[63:63], v_prenex_24[62:52], v_prenex_24[51:0]) && v_prenex_24[63:32] == msw) [2018-12-31 03:55:10,288 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 03:55:10,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:55:10,291 INFO L168 Benchmark]: Toolchain (without parser) took 19452.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 952.7 MB in the beginning and 854.5 MB in the end (delta: 98.3 MB). Peak memory consumption was 234.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:55:10,294 INFO L168 Benchmark]: CDTParser took 0.14 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:55:10,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 518.44 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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:55:10,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:55:10,296 INFO L168 Benchmark]: Boogie Preprocessor took 88.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:55:10,296 INFO L168 Benchmark]: RCFGBuilder took 13496.75 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: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:55:10,296 INFO L168 Benchmark]: TraceAbstraction took 5067.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 868.1 MB in the end (delta: 209.1 MB). Peak memory consumption was 209.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:55:10,296 INFO L168 Benchmark]: Witness Printer took 136.61 ms. Allocated memory is still 1.2 GB. Free memory was 868.1 MB in the beginning and 854.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:55:10,304 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.14 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 518.44 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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 137.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 13496.75 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: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5067.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 868.1 MB in the end (delta: 209.1 MB). Peak memory consumption was 209.1 MB. Max. memory is 11.5 GB. * Witness Printer took 136.61 ms. Allocated memory is still 1.2 GB. Free memory was 868.1 MB in the beginning and 854.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 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[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 153]: 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: 44]: Loop Invariant [2018-12-31 03:55:10,322 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,322 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,322 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,323 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,323 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,323 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,323 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,323 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,323 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,328 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,328 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,328 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,328 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,330 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,330 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,331 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,331 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,332 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,332 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,332 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,333 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] Derived loop invariant: (((x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_9 : bv64 :: lx == v_q#valueAsBitvector_9[31:0] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_prenex_23 : bv64 :: ~fp~LONGDOUBLE(v_prenex_23[63:63], v_prenex_23[62:52], v_prenex_23[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && ~bvand32(1bv32, ~bvlshr32(v_prenex_23[63:32], 31bv32)) == xsb)) && (\exists v_prenex_21 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_21[63:63], v_prenex_21[62:52], v_prenex_21[51:0]) && hx == ~bvand32(2147483647bv32, v_prenex_21[63:32]))) && \result == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 49]: Loop Invariant [2018-12-31 03:55:10,334 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,334 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,335 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,335 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 60]: Loop Invariant [2018-12-31 03:55:10,335 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,335 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,335 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,336 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,336 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,344 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,344 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,344 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,344 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,345 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,346 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,349 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,349 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,349 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,349 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,350 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,350 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,350 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,350 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,350 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,351 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,351 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,351 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] Derived loop invariant: (x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && (\exists v_prenex_23 : bv64 :: ~fp~LONGDOUBLE(v_prenex_23[63:63], v_prenex_23[62:52], v_prenex_23[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && ~bvand32(1bv32, ~bvlshr32(v_prenex_23[63:32], 31bv32)) == xsb)) && (\exists v_prenex_21 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_21[63:63], v_prenex_21[62:52], v_prenex_21[51:0]) && hx == ~bvand32(2147483647bv32, v_prenex_21[63:32])) - InvariantResult [Line: 131]: Loop Invariant [2018-12-31 03:55:10,352 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,352 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,352 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,352 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,352 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,356 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,356 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,357 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,357 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,358 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,358 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2018-12-31 03:55:10,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2018-12-31 03:55:10,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2018-12-31 03:55:10,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2018-12-31 03:55:10,360 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,360 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,365 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,365 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,369 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,369 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,370 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,370 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2018-12-31 03:55:10,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2018-12-31 03:55:10,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] [2018-12-31 03:55:10,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_24,QUANTIFIED] Derived loop invariant: ((((((((x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_9 : bv64 :: lx == v_q#valueAsBitvector_9[31:0] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()))) && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && 0bv32 == \result) && (\exists v_prenex_23 : bv64 :: ~fp~LONGDOUBLE(v_prenex_23[63:63], v_prenex_23[62:52], v_prenex_23[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && ~bvand32(1bv32, ~bvlshr32(v_prenex_23[63:32], 31bv32)) == xsb)) && (\exists v_prenex_21 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_21[63:63], v_prenex_21[62:52], v_prenex_21[51:0]) && hx == ~bvand32(2147483647bv32, v_prenex_21[63:32]))) && \result == ~Pluszero~LONGDOUBLE()) && (\exists v_prenex_24 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_prenex_24[63:63], v_prenex_24[62:52], v_prenex_24[51:0]) && v_prenex_24[63:32] == msw) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 134]: Loop Invariant [2018-12-31 03:55:10,375 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,375 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,378 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,378 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,379 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,379 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,380 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,380 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,385 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,386 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-12-31 03:55:10,387 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,387 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,390 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,390 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_23,QUANTIFIED] [2018-12-31 03:55:10,390 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,391 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:55:10,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] [2018-12-31 03:55:10,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_21,QUANTIFIED] Derived loop invariant: ((((((x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_9 : bv64 :: lx == v_q#valueAsBitvector_9[31:0] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()))) && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_prenex_23 : bv64 :: ~fp~LONGDOUBLE(v_prenex_23[63:63], v_prenex_23[62:52], v_prenex_23[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && ~bvand32(1bv32, ~bvlshr32(v_prenex_23[63:32], 31bv32)) == xsb)) && (\exists v_prenex_21 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_21[63:63], v_prenex_21[62:52], v_prenex_21[51:0]) && hx == ~bvand32(2147483647bv32, v_prenex_21[63:32]))) && \result == ~Pluszero~LONGDOUBLE() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 1 error locations. SAFE Result, 4.8s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 132 SDtfs, 127 SDslu, 159 SDs, 0 SdLazy, 91 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 14 NumberOfFragments, 348 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 68 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 83 ConstructedInterpolants, 21 QuantifiedInterpolants, 8761 SizeOfPredicates, 22 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...