./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0920a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0920a_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a30c63b7ba6607790fb9b2ddb8b19a74f00f07b .............................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0920a_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a30c63b7ba6607790fb9b2ddb8b19a74f00f07b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:06:36,379 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:06:36,381 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:06:36,393 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:06:36,393 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:06:36,394 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:06:36,395 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:06:36,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:06:36,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:06:36,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:06:36,404 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:06:36,404 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:06:36,405 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:06:36,407 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:06:36,413 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:06:36,414 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:06:36,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:06:36,419 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:06:36,422 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:06:36,425 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:06:36,426 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:06:36,427 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:06:36,429 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:06:36,429 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:06:36,430 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:06:36,433 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:06:36,434 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:06:36,435 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:06:36,436 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:06:36,437 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:06:36,439 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:06:36,439 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:06:36,441 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:06:36,441 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:06:36,442 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:06:36,443 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:06:36,444 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:06:36,469 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:06:36,469 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:06:36,471 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:06:36,471 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:06:36,471 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:06:36,471 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:06:36,471 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:06:36,471 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:06:36,472 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:06:36,472 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:06:36,472 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:06:36,472 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:06:36,472 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:06:36,472 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:06:36,473 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:06:36,473 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:06:36,474 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:06:36,474 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:06:36,474 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:06:36,474 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:06:36,474 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:06:36,474 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:06:36,475 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:06:36,475 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:06:36,475 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:06:36,475 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:06:36,475 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:06:36,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:06:36,477 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a30c63b7ba6607790fb9b2ddb8b19a74f00f07b [2019-01-12 09:06:36,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:06:36,558 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:06:36,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:06:36,567 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:06:36,568 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:06:36,569 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0920a_true-unreach-call.c [2019-01-12 09:06:36,644 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d03c168f9/d9c6f1f3b3a645149b3ceb05dddaf3d1/FLAGa2aded985 [2019-01-12 09:06:37,052 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:06:37,052 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0920a_true-unreach-call.c [2019-01-12 09:06:37,060 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d03c168f9/d9c6f1f3b3a645149b3ceb05dddaf3d1/FLAGa2aded985 [2019-01-12 09:06:37,407 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d03c168f9/d9c6f1f3b3a645149b3ceb05dddaf3d1 [2019-01-12 09:06:37,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:06:37,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:06:37,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:06:37,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:06:37,417 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:06:37,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:06:37" (1/1) ... [2019-01-12 09:06:37,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ac6d98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:37, skipping insertion in model container [2019-01-12 09:06:37,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:06:37" (1/1) ... [2019-01-12 09:06:37,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:06:37,463 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:06:37,743 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:06:37,749 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:06:37,816 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:06:37,849 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:06:37,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:37 WrapperNode [2019-01-12 09:06:37,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:06:37,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:06:37,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:06:37,851 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:06:37,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:37" (1/1) ... [2019-01-12 09:06:37,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:37" (1/1) ... [2019-01-12 09:06:37,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:06:37,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:06:37,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:06:37,969 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:06:37,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:37" (1/1) ... [2019-01-12 09:06:37,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:37" (1/1) ... [2019-01-12 09:06:37,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:37" (1/1) ... [2019-01-12 09:06:37,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:37" (1/1) ... [2019-01-12 09:06:37,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:37" (1/1) ... [2019-01-12 09:06:38,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:37" (1/1) ... [2019-01-12 09:06:38,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:37" (1/1) ... [2019-01-12 09:06:38,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:06:38,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:06:38,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:06:38,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:06:38,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:06:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:06:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-01-12 09:06:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:06:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:06:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:06:38,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:06:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:06:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:06:38,657 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:06:38,657 INFO L286 CfgBuilder]: Removed 18 assue(true) statements. [2019-01-12 09:06:38,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:06:38 BoogieIcfgContainer [2019-01-12 09:06:38,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:06:38,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:06:38,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:06:38,663 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:06:38,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:06:37" (1/3) ... [2019-01-12 09:06:38,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374e0056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:06:38, skipping insertion in model container [2019-01-12 09:06:38,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:37" (2/3) ... [2019-01-12 09:06:38,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374e0056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:06:38, skipping insertion in model container [2019-01-12 09:06:38,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:06:38" (3/3) ... [2019-01-12 09:06:38,666 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0920a_true-unreach-call.c [2019-01-12 09:06:38,676 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:06:38,683 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:06:38,698 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:06:38,729 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:06:38,730 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:06:38,730 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:06:38,730 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:06:38,731 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:06:38,731 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:06:38,731 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:06:38,731 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:06:38,731 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:06:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-01-12 09:06:38,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:06:38,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:06:38,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:06:38,754 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:06:38,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:06:38,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1394505008, now seen corresponding path program 1 times [2019-01-12 09:06:38,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:06:38,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:06:38,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:06:38,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:06:38,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:06:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:06:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:06:38,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:06:38,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:06:38,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:06:38,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:06:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:06:38,894 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2019-01-12 09:06:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:06:38,911 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2019-01-12 09:06:38,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:06:38,912 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-01-12 09:06:38,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:06:38,922 INFO L225 Difference]: With dead ends: 69 [2019-01-12 09:06:38,922 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 09:06:38,925 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 [2019-01-12 09:06:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 09:06:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 09:06:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 09:06:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-01-12 09:06:38,955 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 12 [2019-01-12 09:06:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:06:38,955 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-01-12 09:06:38,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:06:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2019-01-12 09:06:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:06:38,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:06:38,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:06:38,957 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:06:38,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:06:38,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1007782307, now seen corresponding path program 1 times [2019-01-12 09:06:38,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:06:38,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:06:38,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:06:38,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:06:38,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:06:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:06:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:06:39,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:06:39,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:06:39,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:06:39,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:06:39,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:06:39,028 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 3 states. [2019-01-12 09:06:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:06:39,092 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2019-01-12 09:06:39,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:06:39,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-12 09:06:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:06:39,093 INFO L225 Difference]: With dead ends: 57 [2019-01-12 09:06:39,093 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 09:06:39,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:06:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 09:06:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 09:06:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 09:06:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-01-12 09:06:39,100 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 13 [2019-01-12 09:06:39,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:06:39,100 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-01-12 09:06:39,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:06:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-01-12 09:06:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:06:39,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:06:39,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:06:39,101 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:06:39,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:06:39,102 INFO L82 PathProgramCache]: Analyzing trace with hash 32951480, now seen corresponding path program 1 times [2019-01-12 09:06:39,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:06:39,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:06:39,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:06:39,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:06:39,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:06:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:06:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:06:39,255 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:06:39,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:06:39 BoogieIcfgContainer [2019-01-12 09:06:39,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:06:39,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:06:39,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:06:39,309 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:06:39,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:06:38" (3/4) ... [2019-01-12 09:06:39,315 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:06:39,315 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:06:39,316 INFO L168 Benchmark]: Toolchain (without parser) took 1905.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -83.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:06:39,318 INFO L168 Benchmark]: CDTParser took 0.17 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. [2019-01-12 09:06:39,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.23 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. [2019-01-12 09:06:39,320 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:06:39,321 INFO L168 Benchmark]: Boogie Preprocessor took 37.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:06:39,321 INFO L168 Benchmark]: RCFGBuilder took 652.56 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: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:06:39,322 INFO L168 Benchmark]: TraceAbstraction took 648.59 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: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:06:39,323 INFO L168 Benchmark]: Witness Printer took 6.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:06:39,327 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.17 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 437.23 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 118.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.61 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 652.56 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: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 648.59 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: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * Witness Printer took 6.15 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 154]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of bitwiseAnd at line 133, overapproximation of someBinaryArithmeticDOUBLEoperation at line 72. Possible FailurePath: [L32-L41] static const double ln2_hi_log = 6.93147180369123816490e-01, ln2_lo_log = 1.90821492927058770002e-10, two54_log = 1.80143985094819840000e+16, Lg1_log = 6.666666666666735130e-01, Lg2_log = 3.999999999940941908e-01, Lg3_log = 2.857142874366239149e-01, Lg4_log = 2.222219843214978396e-01, Lg5_log = 1.818357216161805012e-01, Lg6_log = 1.531383769920937332e-01, Lg7_log = 1.479819860511658591e-01; [L43] static const double zero = 0.0; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L146] double x = __VERIFIER_nondet_double(); [L148] EXPR x < 0 && isfinite_double(x) [L127] __int32_t hx; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L129] ieee_double_shape_type gh_u; [L130] gh_u.value = (x) [L131] EXPR gh_u.parts.msw [L131] (hx) = gh_u.parts.msw [L133] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L148] EXPR x < 0 && isfinite_double(x) VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L148] COND TRUE (x < 0 && isfinite_double(x)) [L46] double hfsq, f, s, z, R, w, t1, t2, dk; [L47] __int32_t k, hx, i, j; [L48] __uint32_t lx; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L51] ieee_double_shape_type ew_u; [L52] ew_u.value = (x) [L53] EXPR ew_u.parts.msw [L53] (hx) = ew_u.parts.msw [L54] EXPR ew_u.parts.lsw [L54] (lx) = ew_u.parts.lsw [L57] k = 0 VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L58] COND FALSE !(hx < 0x00100000) VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L71] COND TRUE hx >= 0x7ff00000 [L72] return x + x; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L150] double res = __ieee754_log(x); [L137] return x != x; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L153] COND TRUE !isnan_double(res) [L154] __VERIFIER_error() VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. UNSAFE Result, 0.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 91 SDtfs, 0 SDslu, 38 SDs, 0 SdLazy, 4 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:06:41,647 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:06:41,649 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:06:41,664 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:06:41,664 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:06:41,665 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:06:41,666 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:06:41,668 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:06:41,670 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:06:41,671 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:06:41,672 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:06:41,672 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:06:41,673 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:06:41,674 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:06:41,675 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:06:41,675 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:06:41,676 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:06:41,678 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:06:41,680 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:06:41,682 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:06:41,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:06:41,684 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:06:41,688 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:06:41,690 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:06:41,690 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:06:41,691 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:06:41,694 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:06:41,695 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:06:41,698 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:06:41,699 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:06:41,699 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:06:41,700 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:06:41,700 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:06:41,700 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:06:41,701 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:06:41,701 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:06:41,702 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:06:41,717 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:06:41,717 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:06:41,718 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:06:41,718 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:06:41,719 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:06:41,719 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:06:41,719 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:06:41,719 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:06:41,719 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:06:41,720 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:06:41,720 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:06:41,720 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:06:41,720 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:06:41,720 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:06:41,720 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:06:41,721 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:06:41,721 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:06:41,721 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:06:41,721 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:06:41,721 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:06:41,721 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:06:41,722 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:06:41,722 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:06:41,722 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:06:41,722 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:06:41,722 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:06:41,723 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:06:41,723 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:06:41,723 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:06:41,723 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:06:41,723 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a30c63b7ba6607790fb9b2ddb8b19a74f00f07b [2019-01-12 09:06:41,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:06:41,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:06:41,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:06:41,797 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:06:41,798 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:06:41,799 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0920a_true-unreach-call.c [2019-01-12 09:06:41,860 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac5802226/3b4aa92366384fb9ac221308ff140bab/FLAGf598de100 [2019-01-12 09:06:42,285 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:06:42,286 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0920a_true-unreach-call.c [2019-01-12 09:06:42,294 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac5802226/3b4aa92366384fb9ac221308ff140bab/FLAGf598de100 [2019-01-12 09:06:42,662 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac5802226/3b4aa92366384fb9ac221308ff140bab [2019-01-12 09:06:42,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:06:42,666 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:06:42,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:06:42,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:06:42,671 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:06:42,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:06:42" (1/1) ... [2019-01-12 09:06:42,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784edb78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:42, skipping insertion in model container [2019-01-12 09:06:42,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:06:42" (1/1) ... [2019-01-12 09:06:42,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:06:42,708 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:06:43,031 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:06:43,043 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:06:43,112 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:06:43,154 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:06:43,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:43 WrapperNode [2019-01-12 09:06:43,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:06:43,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:06:43,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:06:43,156 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:06:43,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:43" (1/1) ... [2019-01-12 09:06:43,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:43" (1/1) ... [2019-01-12 09:06:43,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:06:43,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:06:43,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:06:43,277 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:06:43,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:43" (1/1) ... [2019-01-12 09:06:43,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:43" (1/1) ... [2019-01-12 09:06:43,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:43" (1/1) ... [2019-01-12 09:06:43,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:43" (1/1) ... [2019-01-12 09:06:43,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:43" (1/1) ... [2019-01-12 09:06:43,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:43" (1/1) ... [2019-01-12 09:06:43,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:43" (1/1) ... [2019-01-12 09:06:43,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:06:43,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:06:43,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:06:43,322 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:06:43,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:06:43,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-01-12 09:06:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 09:06:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:06:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:06:43,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:06:43,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:06:43,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 09:06:43,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:06:43,726 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:06:43,877 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:06:49,064 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:06:49,169 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:07:09,070 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:07:09,070 INFO L286 CfgBuilder]: Removed 18 assue(true) statements. [2019-01-12 09:07:09,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:07:09 BoogieIcfgContainer [2019-01-12 09:07:09,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:07:09,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:07:09,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:07:09,077 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:07:09,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:06:42" (1/3) ... [2019-01-12 09:07:09,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6ab2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:07:09, skipping insertion in model container [2019-01-12 09:07:09,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:43" (2/3) ... [2019-01-12 09:07:09,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6ab2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:07:09, skipping insertion in model container [2019-01-12 09:07:09,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:07:09" (3/3) ... [2019-01-12 09:07:09,080 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0920a_true-unreach-call.c [2019-01-12 09:07:09,088 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:07:09,096 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:07:09,110 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:07:09,136 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:07:09,137 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:07:09,137 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:07:09,137 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:07:09,137 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:07:09,137 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:07:09,137 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:07:09,138 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:07:09,138 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:07:09,153 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-01-12 09:07:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:07:09,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:09,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:07:09,163 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:09,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:09,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1394505008, now seen corresponding path program 1 times [2019-01-12 09:07:09,172 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:07:09,172 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 [2019-01-12 09:07:09,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:07:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:07:09,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:07:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:07:09,304 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:07:09,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:07:09,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:07:09,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:07:09,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:07:09,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:07:09,337 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2019-01-12 09:07:09,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:07:09,354 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2019-01-12 09:07:09,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:07:09,356 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-01-12 09:07:09,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:07:09,366 INFO L225 Difference]: With dead ends: 69 [2019-01-12 09:07:09,366 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 09:07:09,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:07:09,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 09:07:09,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 09:07:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 09:07:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-01-12 09:07:09,402 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 12 [2019-01-12 09:07:09,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:07:09,402 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-01-12 09:07:09,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:07:09,403 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2019-01-12 09:07:09,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:07:09,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:09,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:07:09,404 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:09,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:09,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1007782307, now seen corresponding path program 1 times [2019-01-12 09:07:09,405 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:07:09,405 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) [2019-01-12 09:07:09,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 09:07:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:07:09,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:07:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:07:09,548 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:07:09,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:07:09,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:07:09,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:07:09,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:07:09,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:07:09,563 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 3 states. [2019-01-12 09:07:09,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:07:09,631 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2019-01-12 09:07:09,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:07:09,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-12 09:07:09,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:07:09,637 INFO L225 Difference]: With dead ends: 57 [2019-01-12 09:07:09,637 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 09:07:09,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:07:09,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 09:07:09,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 09:07:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 09:07:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-01-12 09:07:09,644 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 13 [2019-01-12 09:07:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:07:09,644 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-01-12 09:07:09,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:07:09,644 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-01-12 09:07:09,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:07:09,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:09,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:07:09,646 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:09,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:09,646 INFO L82 PathProgramCache]: Analyzing trace with hash 32951480, now seen corresponding path program 1 times [2019-01-12 09:07:09,647 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:07:09,647 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 [2019-01-12 09:07:09,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:07:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:07:09,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:07:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:07:10,312 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:07:10,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:07:10,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:07:10,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:07:10,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:07:10,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:07:10,325 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 6 states. [2019-01-12 09:07:10,600 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-01-12 09:07:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:07:15,145 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-01-12 09:07:15,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:07:15,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-12 09:07:15,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:07:15,178 INFO L225 Difference]: With dead ends: 42 [2019-01-12 09:07:15,178 INFO L226 Difference]: Without dead ends: 24 [2019-01-12 09:07:15,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:07:15,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-12 09:07:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-01-12 09:07:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-12 09:07:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-12 09:07:15,186 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-01-12 09:07:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:07:15,186 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-12 09:07:15,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:07:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-12 09:07:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:07:15,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:15,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:07:15,188 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:15,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:15,188 INFO L82 PathProgramCache]: Analyzing trace with hash -677236169, now seen corresponding path program 1 times [2019-01-12 09:07:15,189 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:07:15,189 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 [2019-01-12 09:07:15,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:07:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:07:16,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:07:16,197 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:07:16,198 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:07:16,201 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:07:16,202 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:07:16,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2019-01-12 09:07:16,479 INFO L303 Elim1Store]: Index analysis took 166 ms [2019-01-12 09:07:16,481 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 62 [2019-01-12 09:07:16,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2019-01-12 09:07:16,497 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:07:16,682 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:07:16,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-01-12 09:07:16,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2019-01-12 09:07:16,802 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:07:16,829 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:07:16,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2019-01-12 09:07:16,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-01-12 09:07:16,964 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:07:16,974 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:07:16,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:07:17,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 09:07:17,019 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:73, output treesize:30 [2019-01-12 09:07:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:07:17,108 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:07:17,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:07:17,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:07:17,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:07:17,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:07:17,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:07:17,133 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 6 states. [2019-01-12 09:07:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:07:19,934 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2019-01-12 09:07:20,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:07:20,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-12 09:07:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:07:20,305 INFO L225 Difference]: With dead ends: 24 [2019-01-12 09:07:20,305 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 09:07:20,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:07:20,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 09:07:20,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-12 09:07:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-12 09:07:20,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2019-01-12 09:07:20,309 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 17 [2019-01-12 09:07:20,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:07:20,309 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2019-01-12 09:07:20,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:07:20,310 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2019-01-12 09:07:20,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:07:20,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:20,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:07:20,311 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:20,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:20,312 INFO L82 PathProgramCache]: Analyzing trace with hash 471217663, now seen corresponding path program 1 times [2019-01-12 09:07:20,312 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:07:20,312 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 [2019-01-12 09:07:20,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:07:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:07:21,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:07:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:07:21,948 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:07:21,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:07:21,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:07:21,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:07:21,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:07:21,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:07:21,969 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand 6 states. [2019-01-12 09:07:25,417 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 09:07:26,625 WARN L181 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 09:07:27,795 WARN L181 SmtUtils]: Spent 889.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-12 09:07:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:07:27,797 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2019-01-12 09:07:27,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:07:27,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-12 09:07:27,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:07:27,799 INFO L225 Difference]: With dead ends: 19 [2019-01-12 09:07:27,799 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:07:27,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:07:27,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:07:27,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:07:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:07:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:07:27,801 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-01-12 09:07:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:07:27,801 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:07:27,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:07:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:07:27,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:07:27,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:07:29,557 WARN L181 SmtUtils]: Spent 1.64 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-12 09:07:31,336 WARN L181 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 39 [2019-01-12 09:07:31,340 INFO L451 ceAbstractionStarter]: At program point L159(lines 139 160) the Hoare annotation is: true [2019-01-12 09:07:31,340 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 92) no Hoare annotation was computed. [2019-01-12 09:07:31,340 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 99) no Hoare annotation was computed. [2019-01-12 09:07:31,340 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:07:31,341 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 62) no Hoare annotation was computed. [2019-01-12 09:07:31,342 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:07:31,342 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 122) no Hoare annotation was computed. [2019-01-12 09:07:31,342 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2019-01-12 09:07:31,342 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2019-01-12 09:07:31,342 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 123) no Hoare annotation was computed. [2019-01-12 09:07:31,343 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2019-01-12 09:07:31,343 INFO L444 ceAbstractionStarter]: At program point L128-2(lines 128 132) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short16| (fp.lt ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (= (_ +zero 11 53) ~zero~0)) [2019-01-12 09:07:31,343 INFO L448 ceAbstractionStarter]: For program point L128-3(lines 128 132) no Hoare annotation was computed. [2019-01-12 09:07:31,343 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 156) no Hoare annotation was computed. [2019-01-12 09:07:31,343 INFO L444 ceAbstractionStarter]: At program point L137(line 137) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (exists ((ULTIMATE.start___ieee754_log_~x (_ FloatingPoint 11 53))) (= |ULTIMATE.start___ieee754_log_#res| (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start___ieee754_log_~x ULTIMATE.start___ieee754_log_~x) (_ +zero 11 53)))) (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (fp.lt ULTIMATE.start_main_~x~0 .cse0) (fp.lt ULTIMATE.start___ieee754_log_~x .cse0) (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) v_prenex_9)) (.cse2 ((_ extract 63 32) |v_q#valueAsBitvector_6|))) (and (= .cse1 ((_ extract 31 0) |v_q#valueAsBitvector_6|)) (= ((_ extract 63 32) v_prenex_9) .cse2) (fp.lt (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (= .cse1 ULTIMATE.start___ieee754_log_~lx~1) (= .cse2 ULTIMATE.start___ieee754_log_~hx~1)))) (= (_ +zero 11 53) ~zero~0))) [2019-01-12 09:07:31,344 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 09:07:31,344 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 117) no Hoare annotation was computed. [2019-01-12 09:07:31,344 INFO L444 ceAbstractionStarter]: At program point L122(lines 45 124) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (exists ((ULTIMATE.start___ieee754_log_~x (_ FloatingPoint 11 53))) (= |ULTIMATE.start___ieee754_log_#res| (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven ULTIMATE.start___ieee754_log_~x ULTIMATE.start___ieee754_log_~x) (_ +zero 11 53)))) (fp.lt ULTIMATE.start_main_~x~0 .cse0) (fp.lt ULTIMATE.start___ieee754_log_~x .cse0) (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) v_prenex_9)) (.cse2 ((_ extract 63 32) |v_q#valueAsBitvector_6|))) (and (= .cse1 ((_ extract 31 0) |v_q#valueAsBitvector_6|)) (= ((_ extract 63 32) v_prenex_9) .cse2) (fp.lt (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (= .cse1 ULTIMATE.start___ieee754_log_~lx~1) (= .cse2 ULTIMATE.start___ieee754_log_~hx~1)))) (= (_ +zero 11 53) ~zero~0))) [2019-01-12 09:07:31,344 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2019-01-12 09:07:31,344 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:07:31,344 INFO L444 ceAbstractionStarter]: At program point L65-2(lines 65 69) the Hoare annotation is: false [2019-01-12 09:07:31,345 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 09:07:31,345 INFO L448 ceAbstractionStarter]: For program point L148-2(lines 148 157) no Hoare annotation was computed. [2019-01-12 09:07:31,345 INFO L448 ceAbstractionStarter]: For program point L148-4(lines 148 157) no Hoare annotation was computed. [2019-01-12 09:07:31,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:07:31,345 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 70) no Hoare annotation was computed. [2019-01-12 09:07:31,345 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 45 124) no Hoare annotation was computed. [2019-01-12 09:07:31,345 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 50 55) no Hoare annotation was computed. [2019-01-12 09:07:31,346 INFO L444 ceAbstractionStarter]: At program point L50-2(lines 50 55) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.lt ULTIMATE.start_main_~x~0 .cse0) (fp.lt ULTIMATE.start___ieee754_log_~x .cse0) (= (_ +zero 11 53) ~zero~0))) [2019-01-12 09:07:31,346 INFO L448 ceAbstractionStarter]: For program point L50-3(lines 50 55) no Hoare annotation was computed. [2019-01-12 09:07:31,346 INFO L444 ceAbstractionStarter]: At program point L133(lines 126 134) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short16| (fp.lt ULTIMATE.start_main_~x~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (= (_ +zero 11 53) ~zero~0)) [2019-01-12 09:07:31,346 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 60) no Hoare annotation was computed. [2019-01-12 09:07:31,346 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 100) no Hoare annotation was computed. [2019-01-12 09:07:31,346 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 81) no Hoare annotation was computed. [2019-01-12 09:07:31,346 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 81) the Hoare annotation is: false [2019-01-12 09:07:31,346 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 76 81) no Hoare annotation was computed. [2019-01-12 09:07:31,358 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,359 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2019-01-12 09:07:31,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2019-01-12 09:07:31,360 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,361 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,363 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,363 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,363 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,363 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,367 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,368 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2019-01-12 09:07:31,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2019-01-12 09:07:31,368 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,369 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,371 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,372 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,373 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,373 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,373 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,374 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,374 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,374 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,377 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,377 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,378 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2019-01-12 09:07:31,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2019-01-12 09:07:31,379 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,379 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,384 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,386 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,386 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2019-01-12 09:07:31,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2019-01-12 09:07:31,387 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,387 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,390 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:07:31 BoogieIcfgContainer [2019-01-12 09:07:31,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:07:31,397 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:07:31,397 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:07:31,397 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:07:31,398 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:07:09" (3/4) ... [2019-01-12 09:07:31,402 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:07:31,414 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-01-12 09:07:31,415 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-12 09:07:31,415 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:07:31,440 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists ULTIMATE.start___ieee754_log_~x : C_DOUBLE :: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.sub~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_log_~x, ULTIMATE.start___ieee754_log_~x), ~Pluszero~LONGDOUBLE())) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && (\exists v_q#valueAsBitvector_6 : bv64, v_prenex_9 : bv64 :: (((v_prenex_9[31:0] == v_q#valueAsBitvector_6[31:0] && v_prenex_9[63:32] == v_q#valueAsBitvector_6[63:32]) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && v_prenex_9[31:0] == lx) && v_q#valueAsBitvector_6[63:32] == hx)) && ~Pluszero~LONGDOUBLE() == zero [2019-01-12 09:07:31,441 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\exists ULTIMATE.start___ieee754_log_~x : C_DOUBLE :: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.sub~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_log_~x, ULTIMATE.start___ieee754_log_~x), ~Pluszero~LONGDOUBLE())) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && (\exists v_q#valueAsBitvector_6 : bv64, v_prenex_9 : bv64 :: (((v_prenex_9[31:0] == v_q#valueAsBitvector_6[31:0] && v_prenex_9[63:32] == v_q#valueAsBitvector_6[63:32]) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && v_prenex_9[31:0] == lx) && v_q#valueAsBitvector_6[63:32] == hx)) && ~Pluszero~LONGDOUBLE() == zero [2019-01-12 09:07:31,498 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:07:31,501 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:07:31,502 INFO L168 Benchmark]: Toolchain (without parser) took 48836.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 952.7 MB in the beginning and 902.2 MB in the end (delta: 50.5 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:31,503 INFO L168 Benchmark]: CDTParser took 0.46 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. [2019-01-12 09:07:31,503 INFO L168 Benchmark]: CACSL2BoogieTranslator took 488.00 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. [2019-01-12 09:07:31,504 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:31,504 INFO L168 Benchmark]: Boogie Preprocessor took 44.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:07:31,505 INFO L168 Benchmark]: RCFGBuilder took 25749.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:31,505 INFO L168 Benchmark]: TraceAbstraction took 22323.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 908.9 MB in the end (delta: 162.3 MB). Peak memory consumption was 162.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:31,506 INFO L168 Benchmark]: Witness Printer took 104.27 ms. Allocated memory is still 1.2 GB. Free memory was 908.9 MB in the beginning and 902.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:31,509 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.46 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 488.00 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 121.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.69 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 25749.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22323.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 908.9 MB in the end (delta: 162.3 MB). Peak memory consumption was 162.3 MB. Max. memory is 11.5 GB. * Witness Printer took 104.27 ms. Allocated memory is still 1.2 GB. Free memory was 908.9 MB in the beginning and 902.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,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[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,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[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 154]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant [2019-01-12 09:07:31,517 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,517 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2019-01-12 09:07:31,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2019-01-12 09:07:31,518 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,518 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,520 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,521 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,521 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,521 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2019-01-12 09:07:31,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2019-01-12 09:07:31,522 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,522 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,524 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] Derived loop invariant: ((((\exists ULTIMATE.start___ieee754_log_~x : C_DOUBLE :: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.sub~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_log_~x, ULTIMATE.start___ieee754_log_~x), ~Pluszero~LONGDOUBLE())) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && (\exists v_q#valueAsBitvector_6 : bv64, v_prenex_9 : bv64 :: (((v_prenex_9[31:0] == v_q#valueAsBitvector_6[31:0] && v_prenex_9[63:32] == v_q#valueAsBitvector_6[63:32]) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && v_prenex_9[31:0] == lx) && v_q#valueAsBitvector_6[63:32] == hx)) && ~Pluszero~LONGDOUBLE() == zero - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant [2019-01-12 09:07:31,525 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,525 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (aux-x < 0 && isfinite_double(x)-aux && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~Pluszero~LONGDOUBLE() == zero - InvariantResult [Line: 50]: Loop Invariant [2019-01-12 09:07:31,526 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,526 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,526 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,526 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32)) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~Pluszero~LONGDOUBLE() == zero - InvariantResult [Line: 128]: Loop Invariant [2019-01-12 09:07:31,527 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,527 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (aux-x < 0 && isfinite_double(x)-aux && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~Pluszero~LONGDOUBLE() == zero - InvariantResult [Line: 137]: Loop Invariant [2019-01-12 09:07:31,527 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,528 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2019-01-12 09:07:31,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2019-01-12 09:07:31,528 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,528 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,530 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,530 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,530 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,530 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,530 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,531 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,531 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2019-01-12 09:07:31,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_log_~x,QUANTIFIED] [2019-01-12 09:07:31,532 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,532 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,534 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2019-01-12 09:07:31,534 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:31,534 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2019-01-12 09:07:31,534 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] Derived loop invariant: (((((\exists ULTIMATE.start___ieee754_log_~x : C_DOUBLE :: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.sub~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start___ieee754_log_~x, ULTIMATE.start___ieee754_log_~x), ~Pluszero~LONGDOUBLE())) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && ~fp.lt~DOUBLE(x, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && (\exists v_q#valueAsBitvector_6 : bv64, v_prenex_9 : bv64 :: (((v_prenex_9[31:0] == v_q#valueAsBitvector_6[31:0] && v_prenex_9[63:32] == v_q#valueAsBitvector_6[63:32]) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 0bv32))) && v_prenex_9[31:0] == lx) && v_q#valueAsBitvector_6[63:32] == hx)) && ~Pluszero~LONGDOUBLE() == zero - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. SAFE Result, 22.2s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 13.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 128 SDtfs, 69 SDslu, 127 SDs, 0 SdLazy, 44 SolverSat, 1 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 14 NumberOfFragments, 152 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 72 ConstructedInterpolants, 8 QuantifiedInterpolants, 5743 SizeOfPredicates, 18 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...