./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1052c.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1052c.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 69b156b7cb8e47e9e9902f33725c5b7467b2d17a ............................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1052c.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 69b156b7cb8e47e9e9902f33725c5b7467b2d17a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:42:22,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:42:22,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:42:22,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:42:22,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:42:22,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:42:22,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:42:22,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:42:22,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:42:22,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:42:22,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:42:22,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:42:22,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:42:22,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:42:22,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:42:22,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:42:22,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:42:22,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:42:22,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:42:22,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:42:22,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:42:22,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:42:22,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:42:22,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:42:22,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:42:22,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:42:22,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:42:22,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:42:22,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:42:22,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:42:22,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:42:22,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:42:22,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:42:22,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:42:22,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:42:22,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:42:22,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:42:22,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:42:22,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:42:22,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:42:22,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:42:22,543 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 17:42:22,575 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:42:22,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:42:22,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:42:22,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:42:22,580 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:42:22,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:42:22,581 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:42:22,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:42:22,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:42:22,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:42:22,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:42:22,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:42:22,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:42:22,585 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:42:22,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:42:22,585 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:42:22,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:42:22,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:42:22,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:42:22,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:42:22,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:42:22,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:42:22,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:42:22,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:42:22,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:42:22,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:42:22,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:42:22,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:42:22,594 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:42:22,594 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69b156b7cb8e47e9e9902f33725c5b7467b2d17a [2020-07-28 17:42:22,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:42:22,966 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:42:22,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:42:22,972 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:42:22,972 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:42:22,973 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1052c.c [2020-07-28 17:42:23,051 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c66b26eb9/1a1d10cd653f4e2f9e8f73950c0348d7/FLAG124cfcf74 [2020-07-28 17:42:23,545 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:42:23,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052c.c [2020-07-28 17:42:23,551 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c66b26eb9/1a1d10cd653f4e2f9e8f73950c0348d7/FLAG124cfcf74 [2020-07-28 17:42:23,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c66b26eb9/1a1d10cd653f4e2f9e8f73950c0348d7 [2020-07-28 17:42:23,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:42:23,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:42:23,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:23,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:42:23,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:42:23,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:23" (1/1) ... [2020-07-28 17:42:23,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d277d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:23, skipping insertion in model container [2020-07-28 17:42:23,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:23" (1/1) ... [2020-07-28 17:42:23,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:42:23,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:42:24,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:24,166 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:42:24,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:24,298 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:42:24,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:24 WrapperNode [2020-07-28 17:42:24,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:24,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:24,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:42:24,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:42:24,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:24" (1/1) ... [2020-07-28 17:42:24,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:24" (1/1) ... [2020-07-28 17:42:24,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:24,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:42:24,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:42:24,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:42:24,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:24" (1/1) ... [2020-07-28 17:42:24,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:24" (1/1) ... [2020-07-28 17:42:24,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:24" (1/1) ... [2020-07-28 17:42:24,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:24" (1/1) ... [2020-07-28 17:42:24,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:24" (1/1) ... [2020-07-28 17:42:24,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:24" (1/1) ... [2020-07-28 17:42:24,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:24" (1/1) ... [2020-07-28 17:42:24,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:42:24,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:42:24,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:42:24,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:42:24,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:24" (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 [2020-07-28 17:42:24,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-28 17:42:24,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:42:24,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:42:24,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:42:24,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:42:24,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:42:24,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:42:24,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:42:25,095 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:42:25,096 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 17:42:25,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:25 BoogieIcfgContainer [2020-07-28 17:42:25,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:42:25,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:42:25,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:42:25,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:42:25,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:42:23" (1/3) ... [2020-07-28 17:42:25,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bddae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:25, skipping insertion in model container [2020-07-28 17:42:25,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:24" (2/3) ... [2020-07-28 17:42:25,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bddae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:25, skipping insertion in model container [2020-07-28 17:42:25,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:25" (3/3) ... [2020-07-28 17:42:25,114 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052c.c [2020-07-28 17:42:25,126 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:42:25,134 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:42:25,150 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:42:25,174 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:42:25,174 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:42:25,174 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:42:25,174 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:42:25,175 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:42:25,175 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:42:25,175 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:42:25,175 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:42:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-28 17:42:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:42:25,197 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:25,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:25,199 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:25,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:25,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1930029915, now seen corresponding path program 1 times [2020-07-28 17:42:25,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:42:25,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246293655] [2020-07-28 17:42:25,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:42:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:25,361 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~huge_floor~0 := 1.0E300; {41#true} is VALID [2020-07-28 17:42:25,362 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~someUnaryDOUBLEoperation(0.0);floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {41#true} is VALID [2020-07-28 17:42:25,366 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#true} assume !true; {42#false} is VALID [2020-07-28 17:42:25,367 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#false} floor_double_~j0~0 := ~bitwiseAnd(floor_double_~i0~0 / 1048576, 2047) - 1023; {42#false} is VALID [2020-07-28 17:42:25,367 INFO L280 TraceCheckUtils]: 4: Hoare triple {42#false} assume floor_double_~j0~0 < 20; {42#false} is VALID [2020-07-28 17:42:25,368 INFO L280 TraceCheckUtils]: 5: Hoare triple {42#false} assume !(floor_double_~j0~0 < 0);floor_double_~i~0 := ~shiftRight(1048575, floor_double_~j0~0); {42#false} is VALID [2020-07-28 17:42:25,368 INFO L280 TraceCheckUtils]: 6: Hoare triple {42#false} assume 0 == ~bitwiseOr(~bitwiseAnd(floor_double_~i0~0, floor_double_~i~0), floor_double_~i1~0) % 4294967296;floor_double_#res := floor_double_~x; {42#false} is VALID [2020-07-28 17:42:25,368 INFO L280 TraceCheckUtils]: 7: Hoare triple {42#false} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, ~someUnaryDOUBLEoperation(0.0)); {42#false} is VALID [2020-07-28 17:42:25,369 INFO L280 TraceCheckUtils]: 8: Hoare triple {42#false} assume !main_#t~short10; {42#false} is VALID [2020-07-28 17:42:25,369 INFO L280 TraceCheckUtils]: 9: Hoare triple {42#false} assume !main_#t~short10;havoc main_#t~short10;havoc main_#t~ret9; {42#false} is VALID [2020-07-28 17:42:25,369 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-28 17:42:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:42:25,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246293655] [2020-07-28 17:42:25,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:25,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:42:25,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241601481] [2020-07-28 17:42:25,382 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:25,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:25,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:42:25,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:25,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:42:25,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:42:25,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:42:25,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:42:25,426 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2020-07-28 17:42:25,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:25,521 INFO L93 Difference]: Finished difference Result 74 states and 118 transitions. [2020-07-28 17:42:25,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:42:25,521 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:25,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2020-07-28 17:42:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2020-07-28 17:42:25,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 118 transitions. [2020-07-28 17:42:25,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:25,757 INFO L225 Difference]: With dead ends: 74 [2020-07-28 17:42:25,757 INFO L226 Difference]: Without dead ends: 35 [2020-07-28 17:42:25,761 INFO L675 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 [2020-07-28 17:42:25,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-28 17:42:25,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-28 17:42:25,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:25,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:25,807 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:25,807 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:25,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:25,812 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2020-07-28 17:42:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2020-07-28 17:42:25,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:25,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:25,814 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:25,815 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:25,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:25,819 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2020-07-28 17:42:25,819 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2020-07-28 17:42:25,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:25,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:25,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:25,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-28 17:42:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2020-07-28 17:42:25,828 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 11 [2020-07-28 17:42:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:25,829 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2020-07-28 17:42:25,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:42:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2020-07-28 17:42:25,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:42:25,830 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:25,831 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:25,831 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:42:25,832 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:25,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1310108990, now seen corresponding path program 1 times [2020-07-28 17:42:25,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:42:25,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741775867] [2020-07-28 17:42:25,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:42:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:42:25,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:42:25,948 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:42:25,949 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1010) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1157) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:295) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:206) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:337) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:223) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 17:42:25,957 INFO L168 Benchmark]: Toolchain (without parser) took 2041.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 954.9 MB in the beginning and 1.0 GB in the end (delta: -66.0 MB). Peak memory consumption was 65.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:25,958 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:42:25,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:25,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.92 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. [2020-07-28 17:42:25,960 INFO L168 Benchmark]: Boogie Preprocessor took 44.08 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. [2020-07-28 17:42:25,961 INFO L168 Benchmark]: RCFGBuilder took 699.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:25,962 INFO L168 Benchmark]: TraceAbstraction took 849.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:25,969 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.80 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.08 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 699.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 849.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:42:28,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:42:28,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:42:28,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:42:28,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:42:28,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:42:28,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:42:28,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:42:28,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:42:28,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:42:28,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:42:28,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:42:28,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:42:28,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:42:28,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:42:28,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:42:28,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:42:28,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:42:28,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:42:28,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:42:28,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:42:28,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:42:28,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:42:28,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:42:28,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:42:28,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:42:28,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:42:28,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:42:28,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:42:28,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:42:28,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:42:28,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:42:28,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:42:28,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:42:28,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:42:28,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:42:28,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:42:28,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:42:28,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:42:28,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:42:28,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:42:28,077 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 17:42:28,093 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:42:28,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:42:28,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:42:28,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:42:28,095 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:42:28,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:42:28,095 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:42:28,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:42:28,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:42:28,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:42:28,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:42:28,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:42:28,097 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:42:28,097 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:42:28,097 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:42:28,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:42:28,097 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:42:28,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:42:28,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:42:28,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:42:28,098 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:42:28,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:42:28,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:42:28,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:42:28,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:42:28,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:42:28,100 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:42:28,100 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:42:28,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:42:28,100 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:42:28,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:42:28,101 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69b156b7cb8e47e9e9902f33725c5b7467b2d17a [2020-07-28 17:42:28,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:42:28,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:42:28,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:42:28,436 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:42:28,436 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:42:28,437 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1052c.c [2020-07-28 17:42:28,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f42829af/5949b5195bba46bba704a20fe75caa91/FLAG6ada7874f [2020-07-28 17:42:28,941 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:42:28,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052c.c [2020-07-28 17:42:28,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f42829af/5949b5195bba46bba704a20fe75caa91/FLAG6ada7874f [2020-07-28 17:42:29,300 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f42829af/5949b5195bba46bba704a20fe75caa91 [2020-07-28 17:42:29,305 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:42:29,308 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:42:29,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:29,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:42:29,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:42:29,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:29" (1/1) ... [2020-07-28 17:42:29,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b27cb53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:29, skipping insertion in model container [2020-07-28 17:42:29,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:29" (1/1) ... [2020-07-28 17:42:29,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:42:29,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:42:29,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:29,563 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:42:29,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:29,707 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:42:29,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:29 WrapperNode [2020-07-28 17:42:29,708 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:29,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:29,709 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:42:29,709 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:42:29,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:29" (1/1) ... [2020-07-28 17:42:29,731 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:29" (1/1) ... [2020-07-28 17:42:29,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:29,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:42:29,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:42:29,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:42:29,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:29" (1/1) ... [2020-07-28 17:42:29,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:29" (1/1) ... [2020-07-28 17:42:29,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:29" (1/1) ... [2020-07-28 17:42:29,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:29" (1/1) ... [2020-07-28 17:42:29,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:29" (1/1) ... [2020-07-28 17:42:29,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:29" (1/1) ... [2020-07-28 17:42:29,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:29" (1/1) ... [2020-07-28 17:42:29,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:42:29,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:42:29,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:42:29,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:42:29,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:42:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2020-07-28 17:42:29,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-07-28 17:42:29,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:42:29,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:42:29,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:42:29,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:42:29,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-28 17:42:29,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:42:31,527 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:42:31,527 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 17:42:31,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:31 BoogieIcfgContainer [2020-07-28 17:42:31,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:42:31,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:42:31,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:42:31,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:42:31,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:42:29" (1/3) ... [2020-07-28 17:42:31,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276da443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:31, skipping insertion in model container [2020-07-28 17:42:31,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:29" (2/3) ... [2020-07-28 17:42:31,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276da443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:31, skipping insertion in model container [2020-07-28 17:42:31,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:31" (3/3) ... [2020-07-28 17:42:31,540 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052c.c [2020-07-28 17:42:31,551 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:42:31,559 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:42:31,573 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:42:31,592 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:42:31,592 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:42:31,592 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:42:31,592 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:42:31,593 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:42:31,593 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:42:31,593 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:42:31,594 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:42:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-28 17:42:31,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:42:31,614 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:31,616 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:31,616 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:31,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:31,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1930029915, now seen corresponding path program 1 times [2020-07-28 17:42:31,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:31,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511714148] [2020-07-28 17:42:31,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 17:42:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:31,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:42:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:31,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:42:31,763 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_floor~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {41#true} is VALID [2020-07-28 17:42:31,763 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE());floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {41#true} is VALID [2020-07-28 17:42:31,765 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#true} assume !true; {42#false} is VALID [2020-07-28 17:42:31,765 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#false} floor_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(floor_double_~i0~0, 20bv32)), 1023bv32); {42#false} is VALID [2020-07-28 17:42:31,765 INFO L280 TraceCheckUtils]: 4: Hoare triple {42#false} assume ~bvslt32(floor_double_~j0~0, 20bv32); {42#false} is VALID [2020-07-28 17:42:31,766 INFO L280 TraceCheckUtils]: 5: Hoare triple {42#false} assume !~bvslt32(floor_double_~j0~0, 0bv32);floor_double_~i~0 := ~bvashr32(1048575bv32, floor_double_~j0~0); {42#false} is VALID [2020-07-28 17:42:31,766 INFO L280 TraceCheckUtils]: 6: Hoare triple {42#false} assume 0bv32 == ~bvor32(~bvand32(floor_double_~i0~0, floor_double_~i~0), floor_double_~i1~0);floor_double_#res := floor_double_~x; {42#false} is VALID [2020-07-28 17:42:31,766 INFO L280 TraceCheckUtils]: 7: Hoare triple {42#false} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~fp.eq~DOUBLE(main_~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); {42#false} is VALID [2020-07-28 17:42:31,767 INFO L280 TraceCheckUtils]: 8: Hoare triple {42#false} assume !main_#t~short10; {42#false} is VALID [2020-07-28 17:42:31,767 INFO L280 TraceCheckUtils]: 9: Hoare triple {42#false} assume !main_#t~short10;havoc main_#t~short10;havoc main_#t~ret9; {42#false} is VALID [2020-07-28 17:42:31,768 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-28 17:42:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:42:31,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:42:31,791 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-28 17:42:31,791 INFO L280 TraceCheckUtils]: 9: Hoare triple {42#false} assume !main_#t~short10;havoc main_#t~short10;havoc main_#t~ret9; {42#false} is VALID [2020-07-28 17:42:31,792 INFO L280 TraceCheckUtils]: 8: Hoare triple {42#false} assume !main_#t~short10; {42#false} is VALID [2020-07-28 17:42:31,792 INFO L280 TraceCheckUtils]: 7: Hoare triple {42#false} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~fp.eq~DOUBLE(main_~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); {42#false} is VALID [2020-07-28 17:42:31,792 INFO L280 TraceCheckUtils]: 6: Hoare triple {42#false} assume 0bv32 == ~bvor32(~bvand32(floor_double_~i0~0, floor_double_~i~0), floor_double_~i1~0);floor_double_#res := floor_double_~x; {42#false} is VALID [2020-07-28 17:42:31,793 INFO L280 TraceCheckUtils]: 5: Hoare triple {42#false} assume !~bvslt32(floor_double_~j0~0, 0bv32);floor_double_~i~0 := ~bvashr32(1048575bv32, floor_double_~j0~0); {42#false} is VALID [2020-07-28 17:42:31,793 INFO L280 TraceCheckUtils]: 4: Hoare triple {42#false} assume ~bvslt32(floor_double_~j0~0, 20bv32); {42#false} is VALID [2020-07-28 17:42:31,793 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#false} floor_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(floor_double_~i0~0, 20bv32)), 1023bv32); {42#false} is VALID [2020-07-28 17:42:31,794 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#true} assume !true; {42#false} is VALID [2020-07-28 17:42:31,794 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE());floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {41#true} is VALID [2020-07-28 17:42:31,795 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_floor~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {41#true} is VALID [2020-07-28 17:42:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:42:31,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511714148] [2020-07-28 17:42:31,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:31,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:42:31,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876497635] [2020-07-28 17:42:31,804 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:31,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:31,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:42:31,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:31,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:42:31,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:42:31,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:42:31,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:42:31,849 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2020-07-28 17:42:32,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:32,875 INFO L93 Difference]: Finished difference Result 74 states and 118 transitions. [2020-07-28 17:42:32,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:42:32,876 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:32,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2020-07-28 17:42:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2020-07-28 17:42:32,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 118 transitions. [2020-07-28 17:42:33,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:33,546 INFO L225 Difference]: With dead ends: 74 [2020-07-28 17:42:33,546 INFO L226 Difference]: Without dead ends: 35 [2020-07-28 17:42:33,550 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:42:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-28 17:42:33,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-28 17:42:33,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:33,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:33,594 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:33,594 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:33,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:33,599 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2020-07-28 17:42:33,599 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2020-07-28 17:42:33,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:33,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:33,600 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:33,600 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:33,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:33,604 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2020-07-28 17:42:33,605 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2020-07-28 17:42:33,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:33,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:33,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:33,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-28 17:42:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2020-07-28 17:42:33,611 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 11 [2020-07-28 17:42:33,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:33,612 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2020-07-28 17:42:33,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:42:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2020-07-28 17:42:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:42:33,613 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:33,613 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:33,835 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:42:33,836 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:33,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:33,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1310108990, now seen corresponding path program 1 times [2020-07-28 17:42:33,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:33,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59624275] [2020-07-28 17:42:33,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 17:42:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:33,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 17:42:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:33,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:42:34,102 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_floor~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {298#true} is VALID [2020-07-28 17:42:34,103 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE());floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {306#(= (fp.neg (_ +zero 11 53)) ULTIMATE.start_floor_double_~x)} is VALID [2020-07-28 17:42:34,108 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#(= (fp.neg (_ +zero 11 53)) ULTIMATE.start_floor_double_~x)} call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);call floor_double_#t~mem0 := read~intINTTYPE4(floor_double_~#ew_u~0.base, ~bvadd32(4bv32, floor_double_~#ew_u~0.offset), 4bv32);floor_double_~i0~0 := floor_double_#t~mem0;call write~intFLOATTYPE8(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~mem0;havoc floor_double_#t~union1;call floor_double_#t~mem2 := read~intINTTYPE4(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4bv32);floor_double_~i1~0 := floor_double_#t~mem2;call write~intFLOATTYPE8(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union3;havoc floor_double_#t~mem2;call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset);havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; {310#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start_floor_double_~i0~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.neg (_ +zero 11 53)))))} is VALID [2020-07-28 17:42:34,110 INFO L280 TraceCheckUtils]: 3: Hoare triple {310#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start_floor_double_~i0~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.neg (_ +zero 11 53)))))} goto; {310#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start_floor_double_~i0~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.neg (_ +zero 11 53)))))} is VALID [2020-07-28 17:42:34,113 INFO L280 TraceCheckUtils]: 4: Hoare triple {310#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start_floor_double_~i0~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.neg (_ +zero 11 53)))))} floor_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(floor_double_~i0~0, 20bv32)), 1023bv32); {317#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.neg (_ +zero 11 53))) (= (bvadd ULTIMATE.start_floor_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))))))} is VALID [2020-07-28 17:42:34,114 INFO L280 TraceCheckUtils]: 5: Hoare triple {317#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.neg (_ +zero 11 53))) (= (bvadd ULTIMATE.start_floor_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))))))} assume ~bvslt32(floor_double_~j0~0, 20bv32); {317#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.neg (_ +zero 11 53))) (= (bvadd ULTIMATE.start_floor_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))))))} is VALID [2020-07-28 17:42:34,116 INFO L280 TraceCheckUtils]: 6: Hoare triple {317#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.neg (_ +zero 11 53))) (= (bvadd ULTIMATE.start_floor_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))))))} assume !~bvslt32(floor_double_~j0~0, 0bv32);floor_double_~i~0 := ~bvashr32(1048575bv32, floor_double_~j0~0); {299#false} is VALID [2020-07-28 17:42:34,116 INFO L280 TraceCheckUtils]: 7: Hoare triple {299#false} assume 0bv32 == ~bvor32(~bvand32(floor_double_~i0~0, floor_double_~i~0), floor_double_~i1~0);floor_double_#res := floor_double_~x; {299#false} is VALID [2020-07-28 17:42:34,117 INFO L280 TraceCheckUtils]: 8: Hoare triple {299#false} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~fp.eq~DOUBLE(main_~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); {299#false} is VALID [2020-07-28 17:42:34,117 INFO L280 TraceCheckUtils]: 9: Hoare triple {299#false} assume !main_#t~short10; {299#false} is VALID [2020-07-28 17:42:34,117 INFO L280 TraceCheckUtils]: 10: Hoare triple {299#false} assume !main_#t~short10;havoc main_#t~short10;havoc main_#t~ret9; {299#false} is VALID [2020-07-28 17:42:34,117 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-28 17:42:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:42:34,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:42:34,247 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-28 17:42:34,247 INFO L280 TraceCheckUtils]: 10: Hoare triple {299#false} assume !main_#t~short10;havoc main_#t~short10;havoc main_#t~ret9; {299#false} is VALID [2020-07-28 17:42:34,248 INFO L280 TraceCheckUtils]: 9: Hoare triple {299#false} assume !main_#t~short10; {299#false} is VALID [2020-07-28 17:42:34,248 INFO L280 TraceCheckUtils]: 8: Hoare triple {299#false} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~fp.eq~DOUBLE(main_~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); {299#false} is VALID [2020-07-28 17:42:34,248 INFO L280 TraceCheckUtils]: 7: Hoare triple {299#false} assume 0bv32 == ~bvor32(~bvand32(floor_double_~i0~0, floor_double_~i~0), floor_double_~i1~0);floor_double_#res := floor_double_~x; {299#false} is VALID [2020-07-28 17:42:34,249 INFO L280 TraceCheckUtils]: 6: Hoare triple {354#(bvslt ULTIMATE.start_floor_double_~j0~0 (_ bv0 32))} assume !~bvslt32(floor_double_~j0~0, 0bv32);floor_double_~i~0 := ~bvashr32(1048575bv32, floor_double_~j0~0); {299#false} is VALID [2020-07-28 17:42:34,250 INFO L280 TraceCheckUtils]: 5: Hoare triple {354#(bvslt ULTIMATE.start_floor_double_~j0~0 (_ bv0 32))} assume ~bvslt32(floor_double_~j0~0, 20bv32); {354#(bvslt ULTIMATE.start_floor_double_~j0~0 (_ bv0 32))} is VALID [2020-07-28 17:42:34,251 INFO L280 TraceCheckUtils]: 4: Hoare triple {361#(bvslt (bvadd (bvand (_ bv2047 32) (bvashr ULTIMATE.start_floor_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv0 32))} floor_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(floor_double_~i0~0, 20bv32)), 1023bv32); {354#(bvslt ULTIMATE.start_floor_double_~j0~0 (_ bv0 32))} is VALID [2020-07-28 17:42:34,253 INFO L280 TraceCheckUtils]: 3: Hoare triple {361#(bvslt (bvadd (bvand (_ bv2047 32) (bvashr ULTIMATE.start_floor_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv0 32))} goto; {361#(bvslt (bvadd (bvand (_ bv2047 32) (bvashr ULTIMATE.start_floor_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv0 32))} is VALID [2020-07-28 17:42:34,260 INFO L280 TraceCheckUtils]: 2: Hoare triple {368#(forall ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) ULTIMATE.start_floor_double_~x)) (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (_ bv4294966273 32)) (_ bv0 32))))} call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);call floor_double_#t~mem0 := read~intINTTYPE4(floor_double_~#ew_u~0.base, ~bvadd32(4bv32, floor_double_~#ew_u~0.offset), 4bv32);floor_double_~i0~0 := floor_double_#t~mem0;call write~intFLOATTYPE8(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~mem0;havoc floor_double_#t~union1;call floor_double_#t~mem2 := read~intINTTYPE4(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4bv32);floor_double_~i1~0 := floor_double_#t~mem2;call write~intFLOATTYPE8(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union3;havoc floor_double_#t~mem2;call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset);havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; {361#(bvslt (bvadd (bvand (_ bv2047 32) (bvashr ULTIMATE.start_floor_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv0 32))} is VALID [2020-07-28 17:42:34,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE());floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {368#(forall ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) ULTIMATE.start_floor_double_~x)) (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (_ bv4294966273 32)) (_ bv0 32))))} is VALID [2020-07-28 17:42:34,263 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_floor~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {298#true} is VALID [2020-07-28 17:42:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:42:34,265 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59624275] [2020-07-28 17:42:34,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:34,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2020-07-28 17:42:34,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749415546] [2020-07-28 17:42:34,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-28 17:42:34,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:34,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 17:42:34,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:34,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 17:42:34,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:42:34,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 17:42:34,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-28 17:42:34,315 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. Second operand 8 states. [2020-07-28 17:42:35,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:35,374 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2020-07-28 17:42:35,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 17:42:35,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-28 17:42:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:42:35,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2020-07-28 17:42:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:42:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2020-07-28 17:42:35,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2020-07-28 17:42:35,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:35,802 INFO L225 Difference]: With dead ends: 59 [2020-07-28 17:42:35,802 INFO L226 Difference]: Without dead ends: 34 [2020-07-28 17:42:35,804 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-07-28 17:42:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-28 17:42:35,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 22. [2020-07-28 17:42:35,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:35,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 22 states. [2020-07-28 17:42:35,824 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 22 states. [2020-07-28 17:42:35,824 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 22 states. [2020-07-28 17:42:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:35,827 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-28 17:42:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-28 17:42:35,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:35,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:35,828 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 34 states. [2020-07-28 17:42:35,828 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 34 states. [2020-07-28 17:42:35,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:35,830 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-28 17:42:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-28 17:42:35,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:35,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:35,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:35,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 17:42:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-07-28 17:42:35,834 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 12 [2020-07-28 17:42:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:35,834 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-28 17:42:35,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 17:42:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-28 17:42:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:42:35,835 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:35,835 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:36,049 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:42:36,050 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:36,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:36,051 INFO L82 PathProgramCache]: Analyzing trace with hash -649381144, now seen corresponding path program 1 times [2020-07-28 17:42:36,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:36,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828299539] [2020-07-28 17:42:36,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 17:42:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:36,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 17:42:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:36,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:42:36,326 INFO L280 TraceCheckUtils]: 0: Hoare triple {545#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_floor~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {550#(and (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2020-07-28 17:42:36,328 INFO L280 TraceCheckUtils]: 1: Hoare triple {550#(and (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE());floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {554#(and (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_floor_double_~x) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2020-07-28 17:42:36,331 INFO L280 TraceCheckUtils]: 2: Hoare triple {554#(and (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_floor_double_~x) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))} call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);call floor_double_#t~mem0 := read~intINTTYPE4(floor_double_~#ew_u~0.base, ~bvadd32(4bv32, floor_double_~#ew_u~0.offset), 4bv32);floor_double_~i0~0 := floor_double_#t~mem0;call write~intFLOATTYPE8(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~mem0;havoc floor_double_#t~union1;call floor_double_#t~mem2 := read~intINTTYPE4(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4bv32);floor_double_~i1~0 := floor_double_#t~mem2;call write~intFLOATTYPE8(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union3;havoc floor_double_#t~mem2;call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset);havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; {554#(and (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_floor_double_~x) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2020-07-28 17:42:36,333 INFO L280 TraceCheckUtils]: 3: Hoare triple {554#(and (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_floor_double_~x) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))} goto; {554#(and (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_floor_double_~x) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2020-07-28 17:42:36,335 INFO L280 TraceCheckUtils]: 4: Hoare triple {554#(and (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_floor_double_~x) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))} floor_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(floor_double_~i0~0, 20bv32)), 1023bv32); {554#(and (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_floor_double_~x) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2020-07-28 17:42:36,337 INFO L280 TraceCheckUtils]: 5: Hoare triple {554#(and (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_floor_double_~x) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvslt32(floor_double_~j0~0, 20bv32); {554#(and (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_floor_double_~x) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2020-07-28 17:42:36,346 INFO L280 TraceCheckUtils]: 6: Hoare triple {554#(and (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_floor_double_~x) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvslt32(floor_double_~j0~0, 0bv32); {554#(and (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_floor_double_~x) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2020-07-28 17:42:36,348 INFO L280 TraceCheckUtils]: 7: Hoare triple {554#(and (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_floor_double_~x) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))} assume !~fp.gt~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~huge_floor~0, floor_double_~x), ~Pluszero~DOUBLE()); {546#false} is VALID [2020-07-28 17:42:36,348 INFO L280 TraceCheckUtils]: 8: Hoare triple {546#false} call floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(floor_double_~i0~0, floor_double_~#iw_u~0.base, ~bvadd32(4bv32, floor_double_~#iw_u~0.offset), 4bv32);call write~intINTTYPE4(floor_double_~i1~0, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 4bv32);call floor_double_#t~mem4 := read~intFLOATTYPE8(floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 8bv32);floor_double_~x := floor_double_#t~mem4;call write~intINTTYPE4(floor_double_#t~union5.lsw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 4bv32);call write~intINTTYPE4(floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, ~bvadd32(4bv32, floor_double_~#iw_u~0.offset), 4bv32);havoc floor_double_#t~union5.lsw, floor_double_#t~union5.msw;havoc floor_double_#t~mem4;call ULTIMATE.dealloc(floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset);havoc floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset; {546#false} is VALID [2020-07-28 17:42:36,348 INFO L280 TraceCheckUtils]: 9: Hoare triple {546#false} goto; {546#false} is VALID [2020-07-28 17:42:36,349 INFO L280 TraceCheckUtils]: 10: Hoare triple {546#false} floor_double_#res := floor_double_~x; {546#false} is VALID [2020-07-28 17:42:36,349 INFO L280 TraceCheckUtils]: 11: Hoare triple {546#false} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~fp.eq~DOUBLE(main_~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); {546#false} is VALID [2020-07-28 17:42:36,352 INFO L280 TraceCheckUtils]: 12: Hoare triple {546#false} assume !main_#t~short10; {546#false} is VALID [2020-07-28 17:42:36,352 INFO L280 TraceCheckUtils]: 13: Hoare triple {546#false} assume !main_#t~short10;havoc main_#t~short10;havoc main_#t~ret9; {546#false} is VALID [2020-07-28 17:42:36,352 INFO L280 TraceCheckUtils]: 14: Hoare triple {546#false} assume !false; {546#false} is VALID [2020-07-28 17:42:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:42:36,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:42:37,167 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-07-28 17:42:37,892 INFO L280 TraceCheckUtils]: 14: Hoare triple {546#false} assume !false; {546#false} is VALID [2020-07-28 17:42:37,893 INFO L280 TraceCheckUtils]: 13: Hoare triple {546#false} assume !main_#t~short10;havoc main_#t~short10;havoc main_#t~ret9; {546#false} is VALID [2020-07-28 17:42:37,893 INFO L280 TraceCheckUtils]: 12: Hoare triple {546#false} assume !main_#t~short10; {546#false} is VALID [2020-07-28 17:42:37,893 INFO L280 TraceCheckUtils]: 11: Hoare triple {546#false} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~fp.eq~DOUBLE(main_~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); {546#false} is VALID [2020-07-28 17:42:37,894 INFO L280 TraceCheckUtils]: 10: Hoare triple {546#false} floor_double_#res := floor_double_~x; {546#false} is VALID [2020-07-28 17:42:37,894 INFO L280 TraceCheckUtils]: 9: Hoare triple {546#false} goto; {546#false} is VALID [2020-07-28 17:42:37,894 INFO L280 TraceCheckUtils]: 8: Hoare triple {546#false} call floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(floor_double_~i0~0, floor_double_~#iw_u~0.base, ~bvadd32(4bv32, floor_double_~#iw_u~0.offset), 4bv32);call write~intINTTYPE4(floor_double_~i1~0, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 4bv32);call floor_double_#t~mem4 := read~intFLOATTYPE8(floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 8bv32);floor_double_~x := floor_double_#t~mem4;call write~intINTTYPE4(floor_double_#t~union5.lsw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 4bv32);call write~intINTTYPE4(floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, ~bvadd32(4bv32, floor_double_~#iw_u~0.offset), 4bv32);havoc floor_double_#t~union5.lsw, floor_double_#t~union5.msw;havoc floor_double_#t~mem4;call ULTIMATE.dealloc(floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset);havoc floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset; {546#false} is VALID [2020-07-28 17:42:37,895 INFO L280 TraceCheckUtils]: 7: Hoare triple {615#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} assume !~fp.gt~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~huge_floor~0, floor_double_~x), ~Pluszero~DOUBLE()); {546#false} is VALID [2020-07-28 17:42:37,896 INFO L280 TraceCheckUtils]: 6: Hoare triple {615#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} assume ~bvslt32(floor_double_~j0~0, 0bv32); {615#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} is VALID [2020-07-28 17:42:37,897 INFO L280 TraceCheckUtils]: 5: Hoare triple {615#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} assume ~bvslt32(floor_double_~j0~0, 20bv32); {615#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} is VALID [2020-07-28 17:42:37,898 INFO L280 TraceCheckUtils]: 4: Hoare triple {615#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} floor_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(floor_double_~i0~0, 20bv32)), 1023bv32); {615#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} is VALID [2020-07-28 17:42:37,904 INFO L280 TraceCheckUtils]: 3: Hoare triple {615#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} goto; {615#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} is VALID [2020-07-28 17:42:37,905 INFO L280 TraceCheckUtils]: 2: Hoare triple {615#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);call floor_double_#t~mem0 := read~intINTTYPE4(floor_double_~#ew_u~0.base, ~bvadd32(4bv32, floor_double_~#ew_u~0.offset), 4bv32);floor_double_~i0~0 := floor_double_#t~mem0;call write~intFLOATTYPE8(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~mem0;havoc floor_double_#t~union1;call floor_double_#t~mem2 := read~intINTTYPE4(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4bv32);floor_double_~i1~0 := floor_double_#t~mem2;call write~intFLOATTYPE8(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union3;havoc floor_double_#t~mem2;call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset);havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; {615#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} is VALID [2020-07-28 17:42:37,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 (fp.neg (_ +zero 11 53))) (_ +zero 11 53))} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~fp.neg~DOUBLE(~Pluszero~DOUBLE());floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {615#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} is VALID [2020-07-28 17:42:37,908 INFO L280 TraceCheckUtils]: 0: Hoare triple {545#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_floor~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {634#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 (fp.neg (_ +zero 11 53))) (_ +zero 11 53))} is VALID [2020-07-28 17:42:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:42:37,909 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828299539] [2020-07-28 17:42:37,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:37,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-07-28 17:42:37,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431679118] [2020-07-28 17:42:37,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-28 17:42:37,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:37,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 17:42:38,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:38,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 17:42:38,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:42:38,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 17:42:38,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:42:38,155 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2020-07-28 17:42:40,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:40,614 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-28 17:42:40,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:42:40,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-28 17:42:40,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:40,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:42:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2020-07-28 17:42:40,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:42:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2020-07-28 17:42:40,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2020-07-28 17:42:40,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:40,781 INFO L225 Difference]: With dead ends: 34 [2020-07-28 17:42:40,781 INFO L226 Difference]: Without dead ends: 22 [2020-07-28 17:42:40,782 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:42:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-28 17:42:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-28 17:42:40,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:40,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-28 17:42:40,805 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-28 17:42:40,805 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-28 17:42:40,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:40,807 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-28 17:42:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-28 17:42:40,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:40,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:40,808 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-28 17:42:40,808 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-28 17:42:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:40,809 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-28 17:42:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-28 17:42:40,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:40,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:40,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:40,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 17:42:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-28 17:42:40,812 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2020-07-28 17:42:40,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:40,812 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-28 17:42:40,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 17:42:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-28 17:42:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-28 17:42:40,813 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:40,813 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:41,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:42:41,024 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:41,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:41,025 INFO L82 PathProgramCache]: Analyzing trace with hash 461150674, now seen corresponding path program 1 times [2020-07-28 17:42:41,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:41,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113870473] [2020-07-28 17:42:41,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-28 17:42:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:42:41,199 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:42:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:42:41,327 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:42:41,368 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-07-28 17:42:41,369 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:42:41,569 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 17:42:41,613 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:42:41,613 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:42:41,614 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-28 17:42:41,614 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-28 17:42:41,614 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 17:42:41,614 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 17:42:41,615 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2020-07-28 17:42:41,615 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-28 17:42:41,615 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-28 17:42:41,615 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-28 17:42:41,615 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-28 17:42:41,616 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-28 17:42:41,616 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-28 17:42:41,616 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 17:42:41,616 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 17:42:41,616 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-28 17:42:41,617 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-28 17:42:41,617 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-28 17:42:41,617 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-28 17:42:41,617 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-28 17:42:41,618 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-28 17:42:41,618 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-28 17:42:41,618 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-28 17:42:41,618 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2020-07-28 17:42:41,619 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2020-07-28 17:42:41,619 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2020-07-28 17:42:41,619 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 17:42:41,619 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 17:42:41,623 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-28 17:42:41,623 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-28 17:42:41,623 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 17:42:41,623 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 17:42:41,624 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-28 17:42:41,624 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-28 17:42:41,624 WARN L170 areAnnotationChecker]: L70-2 has no Hoare annotation [2020-07-28 17:42:41,624 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2020-07-28 17:42:41,624 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2020-07-28 17:42:41,625 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-28 17:42:41,625 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-28 17:42:41,625 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-28 17:42:41,625 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-28 17:42:41,626 WARN L170 areAnnotationChecker]: L82-2 has no Hoare annotation [2020-07-28 17:42:41,626 WARN L170 areAnnotationChecker]: L82-2 has no Hoare annotation [2020-07-28 17:42:41,626 WARN L170 areAnnotationChecker]: L102-2 has no Hoare annotation [2020-07-28 17:42:41,626 WARN L170 areAnnotationChecker]: L102-2 has no Hoare annotation [2020-07-28 17:42:41,627 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-28 17:42:41,627 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-28 17:42:41,627 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-28 17:42:41,627 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-28 17:42:41,627 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-28 17:42:41,628 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-28 17:42:41,628 WARN L170 areAnnotationChecker]: L82-3 has no Hoare annotation [2020-07-28 17:42:41,631 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2020-07-28 17:42:41,632 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2020-07-28 17:42:41,632 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2020-07-28 17:42:41,633 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-28 17:42:41,633 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-28 17:42:41,633 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-28 17:42:41,633 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:42:41,633 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2020-07-28 17:42:41,634 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:42:41,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:42:41 BoogieIcfgContainer [2020-07-28 17:42:41,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:42:41,640 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:42:41,640 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:42:41,640 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:42:41,641 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:31" (3/4) ... [2020-07-28 17:42:41,644 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 17:42:41,773 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:42:41,774 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:42:41,776 INFO L168 Benchmark]: Toolchain (without parser) took 12469.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 950.8 MB in the beginning and 1.2 GB in the end (delta: -242.3 MB). Peak memory consumption was 291.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:41,777 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:42:41,777 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:41,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.96 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. [2020-07-28 17:42:41,778 INFO L168 Benchmark]: Boogie Preprocessor took 56.58 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. [2020-07-28 17:42:41,779 INFO L168 Benchmark]: RCFGBuilder took 1701.07 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: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:41,779 INFO L168 Benchmark]: TraceAbstraction took 10106.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 801.1 MB in the end (delta: 273.7 MB). Peak memory consumption was 273.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:41,780 INFO L168 Benchmark]: Witness Printer took 134.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 801.1 MB in the beginning and 1.2 GB in the end (delta: -392.1 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:41,783 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 398.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.58 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 1701.07 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: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10106.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 801.1 MB in the end (delta: 273.7 MB). Peak memory consumption was 273.7 MB. Max. memory is 11.5 GB. * Witness Printer took 134.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 801.1 MB in the beginning and 1.2 GB in the end (delta: -392.1 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 103]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] static const double huge_floor = 1.0e300; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L98] double x = -0.0; [L17] __int32_t i0, i1, j0; [L18] __uint32_t i, j; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L20] ieee_double_shape_type ew_u; [L21] ew_u.value = (x) [L22] EXPR ew_u.parts.msw [L22] (i0) = ew_u.parts.msw [L23] EXPR ew_u.parts.lsw [L23] (i1) = ew_u.parts.lsw [L25] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] COND TRUE j0 < 20 VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L27] COND TRUE j0 < 0 VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L28] COND TRUE huge_floor + x > 0.0 VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L29] COND FALSE !(i0 >= 0) VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L31] COND TRUE ((i0 & 0x7fffffff) | i1) != 0 [L32] i0 = 0xbff00000 [L33] i1 = 0 VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L71] ieee_double_shape_type iw_u; [L72] iw_u.parts.msw = (i0) [L73] iw_u.parts.lsw = (i1) [L74] EXPR iw_u.value [L74] (x) = iw_u.value [L76] return x; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L99] double res = floor_double(x); [L102] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L102] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L103] __VERIFIER_error() VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.9s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 87 SDtfs, 133 SDslu, 57 SDs, 0 SdLazy, 28 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 70 ConstructedInterpolants, 5 QuantifiedInterpolants, 3734 SizeOfPredicates, 11 NumberOfNonLiveVariables, 102 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...