./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1091.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_1091.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 84dba58cac25505e0eb3c404a47a071a268de901 .............................................................................................................................................................................................................................................................................................................................................................................................. 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_1091.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 84dba58cac25505e0eb3c404a47a071a268de901 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:42:49,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:42:49,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:42:49,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:42:49,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:42:49,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:42:49,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:42:49,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:42:49,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:42:49,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:42:49,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:42:49,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:42:49,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:42:49,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:42:49,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:42:49,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:42:49,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:42:49,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:42:49,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:42:49,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:42:49,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:42:49,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:42:49,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:42:49,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:42:49,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:42:49,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:42:49,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:42:49,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:42:49,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:42:49,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:42:49,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:42:49,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:42:49,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:42:49,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:42:49,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:42:49,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:42:49,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:42:49,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:42:49,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:42:49,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:42:49,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:42:49,650 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:49,665 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:42:49,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:42:49,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:42:49,667 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:42:49,667 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:42:49,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:42:49,668 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:42:49,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:42:49,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:42:49,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:42:49,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:42:49,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:42:49,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:42:49,670 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:42:49,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:42:49,670 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:42:49,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:42:49,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:42:49,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:42:49,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:42:49,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:42:49,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:42:49,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:42:49,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:42:49,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:42:49,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:42:49,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:42:49,674 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:42:49,674 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:42:49,674 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 -> 84dba58cac25505e0eb3c404a47a071a268de901 [2020-07-28 17:42:49,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:42:50,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:42:50,007 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:42:50,008 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:42:50,009 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:42:50,010 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1091.c [2020-07-28 17:42:50,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c5d142d/dad0ec143df547309cb604c08b0dc481/FLAG61cada2f1 [2020-07-28 17:42:50,539 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:42:50,540 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1091.c [2020-07-28 17:42:50,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c5d142d/dad0ec143df547309cb604c08b0dc481/FLAG61cada2f1 [2020-07-28 17:42:50,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c5d142d/dad0ec143df547309cb604c08b0dc481 [2020-07-28 17:42:50,898 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:42:50,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:42:50,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:50,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:42:50,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:42:50,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:50" (1/1) ... [2020-07-28 17:42:50,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d88eed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:50, skipping insertion in model container [2020-07-28 17:42:50,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:50" (1/1) ... [2020-07-28 17:42:50,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:42:50,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:42:51,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:51,241 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:42:51,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:51,444 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:42:51,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:51 WrapperNode [2020-07-28 17:42:51,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:51,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:51,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:42:51,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:42:51,457 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:51" (1/1) ... [2020-07-28 17:42:51,482 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:51" (1/1) ... [2020-07-28 17:42:51,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:51,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:42:51,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:42:51,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:42:51,531 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:51" (1/1) ... [2020-07-28 17:42:51,532 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:51" (1/1) ... [2020-07-28 17:42:51,535 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:51" (1/1) ... [2020-07-28 17:42:51,535 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:51" (1/1) ... [2020-07-28 17:42:51,547 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:51" (1/1) ... [2020-07-28 17:42:51,553 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:51" (1/1) ... [2020-07-28 17:42:51,555 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:51" (1/1) ... [2020-07-28 17:42:51,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:42:51,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:42:51,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:42:51,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:42:51,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:42:51,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-28 17:42:51,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:42:51,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:42:51,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:42:51,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:42:51,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:42:51,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:42:51,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:42:52,259 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:42:52,260 INFO L295 CfgBuilder]: Removed 12 assume(true) statements. [2020-07-28 17:42:52,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:52 BoogieIcfgContainer [2020-07-28 17:42:52,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:42:52,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:42:52,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:42:52,270 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:42:52,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:42:50" (1/3) ... [2020-07-28 17:42:52,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de831ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:52, skipping insertion in model container [2020-07-28 17:42:52,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:51" (2/3) ... [2020-07-28 17:42:52,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de831ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:52, skipping insertion in model container [2020-07-28 17:42:52,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:52" (3/3) ... [2020-07-28 17:42:52,274 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1091.c [2020-07-28 17:42:52,286 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:42:52,298 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:42:52,315 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:42:52,352 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:42:52,353 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:42:52,353 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:42:52,353 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:42:52,354 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:42:52,354 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:42:52,355 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:42:52,355 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:42:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-28 17:42:52,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:42:52,383 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:52,384 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:52,385 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:52,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:52,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1930047821, now seen corresponding path program 1 times [2020-07-28 17:42:52,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:42:52,409 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552053749] [2020-07-28 17:42:52,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:42:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:52,566 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~huge_ceil~0 := 1.0E300; {37#true} is VALID [2020-07-28 17:42:52,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);ceil_double_#in~x := main_~x~0;havoc ceil_double_#res;havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, ceil_double_#t~mem4, ceil_double_#t~union5.lsw, ceil_double_#t~union5.msw, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0;ceil_double_~x := ceil_double_#in~x;havoc ceil_double_~i0~0;havoc ceil_double_~i1~0;havoc ceil_double_~j0~0;havoc ceil_double_~i~0;havoc ceil_double_~j~0; {37#true} is VALID [2020-07-28 17:42:52,569 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume !true; {38#false} is VALID [2020-07-28 17:42:52,569 INFO L280 TraceCheckUtils]: 3: Hoare triple {38#false} ceil_double_~j0~0 := ~bitwiseAnd(ceil_double_~i0~0 / 1048576, 2047) - 1023; {38#false} is VALID [2020-07-28 17:42:52,570 INFO L280 TraceCheckUtils]: 4: Hoare triple {38#false} assume ceil_double_~j0~0 < 20; {38#false} is VALID [2020-07-28 17:42:52,570 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#false} assume !(ceil_double_~j0~0 < 0);ceil_double_~i~0 := ~shiftRight(1048575, ceil_double_~j0~0); {38#false} is VALID [2020-07-28 17:42:52,571 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#false} assume 0 == ~bitwiseOr(~bitwiseAnd(ceil_double_~i0~0, ceil_double_~i~0), ceil_double_~i1~0) % 4294967296;ceil_double_#res := ceil_double_~x; {38#false} is VALID [2020-07-28 17:42:52,571 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#false} main_#t~ret6 := ceil_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_double_#in~x := main_~res~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); {38#false} is VALID [2020-07-28 17:42:52,572 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#false} main_#t~ret7 := isnan_double_#res;assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; {38#false} is VALID [2020-07-28 17:42:52,572 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#false} assume 0 == main_#t~ret7;havoc main_#t~ret7; {38#false} is VALID [2020-07-28 17:42:52,573 INFO L280 TraceCheckUtils]: 10: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-28 17:42:52,576 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:52,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552053749] [2020-07-28 17:42:52,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:52,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:42:52,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80080555] [2020-07-28 17:42:52,588 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:52,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:52,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:42:52,619 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:52,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:42:52,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:42:52,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:42:52,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:42:52,633 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2020-07-28 17:42:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:52,729 INFO L93 Difference]: Finished difference Result 66 states and 104 transitions. [2020-07-28 17:42:52,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:42:52,730 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:52,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2020-07-28 17:42:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:52,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2020-07-28 17:42:52,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 104 transitions. [2020-07-28 17:42:52,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:52,922 INFO L225 Difference]: With dead ends: 66 [2020-07-28 17:42:52,922 INFO L226 Difference]: Without dead ends: 31 [2020-07-28 17:42:52,926 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:52,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-28 17:42:52,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-28 17:42:52,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:52,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-28 17:42:52,966 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-28 17:42:52,966 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-28 17:42:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:52,971 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2020-07-28 17:42:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-28 17:42:52,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:52,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:52,972 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-28 17:42:52,973 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-28 17:42:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:52,976 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2020-07-28 17:42:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-28 17:42:52,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:52,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:52,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:52,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-28 17:42:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-28 17:42:52,983 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 11 [2020-07-28 17:42:52,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:52,983 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-28 17:42:52,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:42:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-28 17:42:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:42:52,984 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:52,985 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:52,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:42:52,985 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:52,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:52,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1310126896, now seen corresponding path program 1 times [2020-07-28 17:42:52,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:42:52,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142565022] [2020-07-28 17:42:52,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:42:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:42:53,126 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:42:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:42:53,200 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:42:53,227 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 17:42:53,227 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:42:53,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:42:53,259 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:42:53,260 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:42:53,260 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-28 17:42:53,260 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-28 17:42:53,261 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 17:42:53,261 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 17:42:53,261 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-28 17:42:53,261 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-28 17:42:53,262 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-28 17:42:53,262 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 17:42:53,262 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 17:42:53,262 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 17:42:53,262 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 17:42:53,263 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 17:42:53,263 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 17:42:53,263 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-28 17:42:53,263 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-28 17:42:53,264 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-28 17:42:53,264 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-28 17:42:53,264 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-28 17:42:53,264 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-28 17:42:53,265 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:42:53,265 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:42:53,265 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2020-07-28 17:42:53,265 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2020-07-28 17:42:53,265 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2020-07-28 17:42:53,266 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-28 17:42:53,266 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-28 17:42:53,266 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-28 17:42:53,266 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-28 17:42:53,267 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-28 17:42:53,267 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-28 17:42:53,267 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-28 17:42:53,267 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-28 17:42:53,267 WARN L170 areAnnotationChecker]: L74-2 has no Hoare annotation [2020-07-28 17:42:53,268 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-28 17:42:53,268 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-28 17:42:53,268 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-28 17:42:53,268 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-28 17:42:53,269 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-28 17:42:53,269 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2020-07-28 17:42:53,269 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2020-07-28 17:42:53,269 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-28 17:42:53,269 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-28 17:42:53,270 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-28 17:42:53,270 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2020-07-28 17:42:53,270 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2020-07-28 17:42:53,270 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2020-07-28 17:42:53,271 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2020-07-28 17:42:53,271 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-28 17:42:53,271 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-28 17:42:53,271 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:42:53,272 WARN L170 areAnnotationChecker]: L66-2 has no Hoare annotation [2020-07-28 17:42:53,272 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:53,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:42:53 BoogieIcfgContainer [2020-07-28 17:42:53,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:42:53,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:42:53,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:42:53,276 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:42:53,277 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:52" (3/4) ... [2020-07-28 17:42:53,281 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-28 17:42:53,281 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:42:53,284 INFO L168 Benchmark]: Toolchain (without parser) took 2383.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 952.2 MB in the beginning and 1.0 GB in the end (delta: -88.9 MB). Peak memory consumption was 73.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:53,285 INFO L168 Benchmark]: CDTParser took 0.32 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:53,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 543.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 952.2 MB in the beginning and 1.2 GB in the end (delta: -200.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:53,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:53,287 INFO L168 Benchmark]: Boogie Preprocessor took 38.86 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:53,288 INFO L168 Benchmark]: RCFGBuilder took 704.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:53,289 INFO L168 Benchmark]: TraceAbstraction took 1009.34 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: 66.7 MB). Peak memory consumption was 66.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:53,290 INFO L168 Benchmark]: Witness Printer took 5.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:42:53,294 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.32 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 543.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 952.2 MB in the beginning and 1.2 GB in the end (delta: -200.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.86 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 704.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1009.34 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: 66.7 MB). Peak memory consumption was 66.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 95]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftRight at line 41, overapproximation of bitwiseOr at line 42, overapproximation of someBinaryArithmeticDOUBLEoperation at line 90, overapproximation of bitwiseAnd at line 28, overapproximation of someBinaryDOUBLEComparisonOperation at line 15. Possible FailurePath: [L17] static const double huge_ceil = 1.0e300; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L90] double x = 0.0 / 0.0; [L20] __int32_t i0, i1, j0; [L21] __uint32_t i, j; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (i0) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (i1) = ew_u.parts.lsw [L28] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L29] COND TRUE j0 < 20 VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L30] COND FALSE !(j0 < 0) [L41] i = (0x000fffff) >> j0 VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L42] COND TRUE ((i0 & i) | i1) == 0 [L43] return x; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L91] double res = ceil_double(x); [L15] return x != x; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L94] COND TRUE !isnan_double(res) [L95] __VERIFIER_error() VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 48 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:42:55,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:42:55,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:42:55,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:42:55,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:42:55,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:42:55,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:42:55,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:42:55,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:42:55,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:42:55,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:42:55,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:42:55,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:42:55,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:42:55,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:42:55,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:42:55,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:42:55,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:42:55,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:42:55,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:42:55,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:42:55,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:42:55,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:42:55,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:42:55,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:42:55,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:42:55,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:42:55,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:42:55,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:42:55,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:42:55,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:42:55,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:42:55,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:42:55,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:42:55,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:42:55,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:42:55,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:42:55,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:42:55,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:42:55,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:42:55,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:42:55,323 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:55,340 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:42:55,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:42:55,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:42:55,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:42:55,342 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:42:55,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:42:55,342 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:42:55,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:42:55,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:42:55,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:42:55,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:42:55,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:42:55,343 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:42:55,344 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:42:55,344 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:42:55,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:42:55,344 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:42:55,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:42:55,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:42:55,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:42:55,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:42:55,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:42:55,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:42:55,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:42:55,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:42:55,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:42:55,347 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:42:55,347 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:42:55,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:42:55,347 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:42:55,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:42:55,348 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 -> 84dba58cac25505e0eb3c404a47a071a268de901 [2020-07-28 17:42:55,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:42:55,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:42:55,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:42:55,674 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:42:55,675 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:42:55,676 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1091.c [2020-07-28 17:42:55,755 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a490051a2/d546bcd3f3304a2cb80a7805db31a108/FLAGcdbebb48c [2020-07-28 17:42:56,164 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:42:56,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1091.c [2020-07-28 17:42:56,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a490051a2/d546bcd3f3304a2cb80a7805db31a108/FLAGcdbebb48c [2020-07-28 17:42:56,188 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a490051a2/d546bcd3f3304a2cb80a7805db31a108 [2020-07-28 17:42:56,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:42:56,196 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:42:56,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:56,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:42:56,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:42:56,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:56" (1/1) ... [2020-07-28 17:42:56,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca5439c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:56, skipping insertion in model container [2020-07-28 17:42:56,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:56" (1/1) ... [2020-07-28 17:42:56,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:42:56,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:42:56,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:56,431 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:42:56,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:56,503 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:42:56,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:56 WrapperNode [2020-07-28 17:42:56,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:56,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:56,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:42:56,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:42:56,587 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:56" (1/1) ... [2020-07-28 17:42:56,614 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:56" (1/1) ... [2020-07-28 17:42:56,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:56,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:42:56,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:42:56,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:42:56,686 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:56" (1/1) ... [2020-07-28 17:42:56,686 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:56" (1/1) ... [2020-07-28 17:42:56,690 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:56" (1/1) ... [2020-07-28 17:42:56,691 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:56" (1/1) ... [2020-07-28 17:42:56,703 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:56" (1/1) ... [2020-07-28 17:42:56,710 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:56" (1/1) ... [2020-07-28 17:42:56,712 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:56" (1/1) ... [2020-07-28 17:42:56,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:42:56,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:42:56,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:42:56,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:42:56,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:56" (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:56,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2020-07-28 17:42:56,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-07-28 17:42:56,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:42:56,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:42:56,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:42:56,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:42:56,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-28 17:42:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:42:58,480 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:42:58,480 INFO L295 CfgBuilder]: Removed 12 assume(true) statements. [2020-07-28 17:42:58,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:58 BoogieIcfgContainer [2020-07-28 17:42:58,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:42:58,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:42:58,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:42:58,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:42:58,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:42:56" (1/3) ... [2020-07-28 17:42:58,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c09c7c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:58, skipping insertion in model container [2020-07-28 17:42:58,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:56" (2/3) ... [2020-07-28 17:42:58,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c09c7c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:58, skipping insertion in model container [2020-07-28 17:42:58,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:58" (3/3) ... [2020-07-28 17:42:58,493 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1091.c [2020-07-28 17:42:58,504 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:42:58,511 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:42:58,525 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:42:58,550 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:42:58,551 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:42:58,551 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:42:58,551 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:42:58,551 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:42:58,551 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:42:58,552 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:42:58,552 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:42:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-28 17:42:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:42:58,572 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:58,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:58,573 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:58,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:58,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1930047821, now seen corresponding path program 1 times [2020-07-28 17:42:58,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:58,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80096801] [2020-07-28 17:42:58,592 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:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:58,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:42:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:58,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:42:58,760 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_ceil~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {37#true} is VALID [2020-07-28 17:42:58,761 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());ceil_double_#in~x := main_~x~0;havoc ceil_double_#res;havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, ceil_double_#t~mem4, ceil_double_#t~union5.lsw, ceil_double_#t~union5.msw, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0;ceil_double_~x := ceil_double_#in~x;havoc ceil_double_~i0~0;havoc ceil_double_~i1~0;havoc ceil_double_~j0~0;havoc ceil_double_~i~0;havoc ceil_double_~j~0; {37#true} is VALID [2020-07-28 17:42:58,762 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume !true; {38#false} is VALID [2020-07-28 17:42:58,763 INFO L280 TraceCheckUtils]: 3: Hoare triple {38#false} ceil_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(ceil_double_~i0~0, 20bv32)), 1023bv32); {38#false} is VALID [2020-07-28 17:42:58,763 INFO L280 TraceCheckUtils]: 4: Hoare triple {38#false} assume ~bvslt32(ceil_double_~j0~0, 20bv32); {38#false} is VALID [2020-07-28 17:42:58,763 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#false} assume !~bvslt32(ceil_double_~j0~0, 0bv32);ceil_double_~i~0 := ~bvashr32(1048575bv32, ceil_double_~j0~0); {38#false} is VALID [2020-07-28 17:42:58,764 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#false} assume 0bv32 == ~bvor32(~bvand32(ceil_double_~i0~0, ceil_double_~i~0), ceil_double_~i1~0);ceil_double_#res := ceil_double_~x; {38#false} is VALID [2020-07-28 17:42:58,764 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#false} main_#t~ret6 := ceil_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_double_#in~x := main_~res~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if !~fp.eq~DOUBLE(isnan_double_~x, isnan_double_~x) then 1bv32 else 0bv32); {38#false} is VALID [2020-07-28 17:42:58,765 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#false} main_#t~ret7 := isnan_double_#res; {38#false} is VALID [2020-07-28 17:42:58,765 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#false} assume 0bv32 == main_#t~ret7;havoc main_#t~ret7; {38#false} is VALID [2020-07-28 17:42:58,765 INFO L280 TraceCheckUtils]: 10: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-28 17:42:58,770 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:58,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:42:58,791 INFO L280 TraceCheckUtils]: 10: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-28 17:42:58,792 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#false} assume 0bv32 == main_#t~ret7;havoc main_#t~ret7; {38#false} is VALID [2020-07-28 17:42:58,792 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#false} main_#t~ret7 := isnan_double_#res; {38#false} is VALID [2020-07-28 17:42:58,792 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#false} main_#t~ret6 := ceil_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_double_#in~x := main_~res~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if !~fp.eq~DOUBLE(isnan_double_~x, isnan_double_~x) then 1bv32 else 0bv32); {38#false} is VALID [2020-07-28 17:42:58,793 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#false} assume 0bv32 == ~bvor32(~bvand32(ceil_double_~i0~0, ceil_double_~i~0), ceil_double_~i1~0);ceil_double_#res := ceil_double_~x; {38#false} is VALID [2020-07-28 17:42:58,793 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#false} assume !~bvslt32(ceil_double_~j0~0, 0bv32);ceil_double_~i~0 := ~bvashr32(1048575bv32, ceil_double_~j0~0); {38#false} is VALID [2020-07-28 17:42:58,796 INFO L280 TraceCheckUtils]: 4: Hoare triple {38#false} assume ~bvslt32(ceil_double_~j0~0, 20bv32); {38#false} is VALID [2020-07-28 17:42:58,797 INFO L280 TraceCheckUtils]: 3: Hoare triple {38#false} ceil_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(ceil_double_~i0~0, 20bv32)), 1023bv32); {38#false} is VALID [2020-07-28 17:42:58,798 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume !true; {38#false} is VALID [2020-07-28 17:42:58,798 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());ceil_double_#in~x := main_~x~0;havoc ceil_double_#res;havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, ceil_double_#t~mem4, ceil_double_#t~union5.lsw, ceil_double_#t~union5.msw, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0;ceil_double_~x := ceil_double_#in~x;havoc ceil_double_~i0~0;havoc ceil_double_~i1~0;havoc ceil_double_~j0~0;havoc ceil_double_~i~0;havoc ceil_double_~j~0; {37#true} is VALID [2020-07-28 17:42:58,799 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_ceil~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {37#true} is VALID [2020-07-28 17:42:58,799 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:58,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80096801] [2020-07-28 17:42:58,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:58,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:42:58,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826625011] [2020-07-28 17:42:58,812 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:58,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:58,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:42:58,855 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:58,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:42:58,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:42:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:42:58,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:42:58,867 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2020-07-28 17:42:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:59,929 INFO L93 Difference]: Finished difference Result 66 states and 104 transitions. [2020-07-28 17:42:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:42:59,930 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2020-07-28 17:42:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2020-07-28 17:42:59,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 104 transitions. [2020-07-28 17:43:00,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:00,554 INFO L225 Difference]: With dead ends: 66 [2020-07-28 17:43:00,555 INFO L226 Difference]: Without dead ends: 31 [2020-07-28 17:43:00,559 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:43:00,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-28 17:43:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-28 17:43:00,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:00,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-28 17:43:00,602 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-28 17:43:00,602 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-28 17:43:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:00,607 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2020-07-28 17:43:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-28 17:43:00,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:00,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:00,609 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-28 17:43:00,609 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-28 17:43:00,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:00,613 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2020-07-28 17:43:00,614 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-28 17:43:00,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:00,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:00,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:00,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-28 17:43:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-28 17:43:00,620 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 11 [2020-07-28 17:43:00,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:00,621 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-28 17:43:00,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:43:00,622 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-28 17:43:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:43:00,623 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:00,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:00,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:43:00,837 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:00,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1310126896, now seen corresponding path program 1 times [2020-07-28 17:43:00,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:43:00,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072766313] [2020-07-28 17:43:00,841 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:43:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:00,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-28 17:43:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:00,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:43:01,080 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:43:01,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {271#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_ceil~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {271#true} is VALID [2020-07-28 17:43:01,157 INFO L280 TraceCheckUtils]: 1: Hoare triple {271#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());ceil_double_#in~x := main_~x~0;havoc ceil_double_#res;havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, ceil_double_#t~mem4, ceil_double_#t~union5.lsw, ceil_double_#t~union5.msw, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0;ceil_double_~x := ceil_double_#in~x;havoc ceil_double_~i0~0;havoc ceil_double_~i1~0;havoc ceil_double_~j0~0;havoc ceil_double_~i~0;havoc ceil_double_~j~0; {279#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2020-07-28 17:43:01,158 INFO L280 TraceCheckUtils]: 2: Hoare triple {279#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} call ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(ceil_double_~x, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8bv32);call ceil_double_#t~mem0 := read~intINTTYPE4(ceil_double_~#ew_u~0.base, ~bvadd32(4bv32, ceil_double_~#ew_u~0.offset), 4bv32);ceil_double_~i0~0 := ceil_double_#t~mem0;call write~intFLOATTYPE8(ceil_double_#t~union1, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8bv32);havoc ceil_double_#t~union1;havoc ceil_double_#t~mem0;call ceil_double_#t~mem2 := read~intINTTYPE4(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 4bv32);ceil_double_~i1~0 := ceil_double_#t~mem2;call write~intFLOATTYPE8(ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8bv32);havoc ceil_double_#t~union3;havoc ceil_double_#t~mem2;call ULTIMATE.dealloc(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset);havoc ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset; {279#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2020-07-28 17:43:01,160 INFO L280 TraceCheckUtils]: 3: Hoare triple {279#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} goto; {279#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2020-07-28 17:43:01,161 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} ceil_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(ceil_double_~i0~0, 20bv32)), 1023bv32); {279#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2020-07-28 17:43:01,162 INFO L280 TraceCheckUtils]: 5: Hoare triple {279#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume ~bvslt32(ceil_double_~j0~0, 20bv32); {279#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2020-07-28 17:43:01,162 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume !~bvslt32(ceil_double_~j0~0, 0bv32);ceil_double_~i~0 := ~bvashr32(1048575bv32, ceil_double_~j0~0); {279#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2020-07-28 17:43:01,167 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume 0bv32 == ~bvor32(~bvand32(ceil_double_~i0~0, ceil_double_~i~0), ceil_double_~i1~0);ceil_double_#res := ceil_double_~x; {298#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_ceil_double_#res|))} is VALID [2020-07-28 17:43:01,172 INFO L280 TraceCheckUtils]: 8: Hoare triple {298#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_ceil_double_#res|))} main_#t~ret6 := ceil_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_double_#in~x := main_~res~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if !~fp.eq~DOUBLE(isnan_double_~x, isnan_double_~x) then 1bv32 else 0bv32); {302#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|)} is VALID [2020-07-28 17:43:01,173 INFO L280 TraceCheckUtils]: 9: Hoare triple {302#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|)} main_#t~ret7 := isnan_double_#res; {306#(= (bvadd |ULTIMATE.start_main_#t~ret7| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 17:43:01,174 INFO L280 TraceCheckUtils]: 10: Hoare triple {306#(= (bvadd |ULTIMATE.start_main_#t~ret7| (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == main_#t~ret7;havoc main_#t~ret7; {272#false} is VALID [2020-07-28 17:43:01,175 INFO L280 TraceCheckUtils]: 11: Hoare triple {272#false} assume !false; {272#false} is VALID [2020-07-28 17:43:01,177 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:43:01,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:43:01,368 INFO L280 TraceCheckUtils]: 11: Hoare triple {272#false} assume !false; {272#false} is VALID [2020-07-28 17:43:01,370 INFO L280 TraceCheckUtils]: 10: Hoare triple {316#(not (= |ULTIMATE.start_main_#t~ret7| (_ bv0 32)))} assume 0bv32 == main_#t~ret7;havoc main_#t~ret7; {272#false} is VALID [2020-07-28 17:43:01,371 INFO L280 TraceCheckUtils]: 9: Hoare triple {320#(not (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|))} main_#t~ret7 := isnan_double_#res; {316#(not (= |ULTIMATE.start_main_#t~ret7| (_ bv0 32)))} is VALID [2020-07-28 17:43:01,373 INFO L280 TraceCheckUtils]: 8: Hoare triple {324#(not (fp.eq |ULTIMATE.start_ceil_double_#res| |ULTIMATE.start_ceil_double_#res|))} main_#t~ret6 := ceil_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_double_#in~x := main_~res~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if !~fp.eq~DOUBLE(isnan_double_~x, isnan_double_~x) then 1bv32 else 0bv32); {320#(not (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|))} is VALID [2020-07-28 17:43:01,375 INFO L280 TraceCheckUtils]: 7: Hoare triple {328#(not (fp.eq ULTIMATE.start_ceil_double_~x ULTIMATE.start_ceil_double_~x))} assume 0bv32 == ~bvor32(~bvand32(ceil_double_~i0~0, ceil_double_~i~0), ceil_double_~i1~0);ceil_double_#res := ceil_double_~x; {324#(not (fp.eq |ULTIMATE.start_ceil_double_#res| |ULTIMATE.start_ceil_double_#res|))} is VALID [2020-07-28 17:43:01,376 INFO L280 TraceCheckUtils]: 6: Hoare triple {328#(not (fp.eq ULTIMATE.start_ceil_double_~x ULTIMATE.start_ceil_double_~x))} assume !~bvslt32(ceil_double_~j0~0, 0bv32);ceil_double_~i~0 := ~bvashr32(1048575bv32, ceil_double_~j0~0); {328#(not (fp.eq ULTIMATE.start_ceil_double_~x ULTIMATE.start_ceil_double_~x))} is VALID [2020-07-28 17:43:01,378 INFO L280 TraceCheckUtils]: 5: Hoare triple {328#(not (fp.eq ULTIMATE.start_ceil_double_~x ULTIMATE.start_ceil_double_~x))} assume ~bvslt32(ceil_double_~j0~0, 20bv32); {328#(not (fp.eq ULTIMATE.start_ceil_double_~x ULTIMATE.start_ceil_double_~x))} is VALID [2020-07-28 17:43:01,380 INFO L280 TraceCheckUtils]: 4: Hoare triple {328#(not (fp.eq ULTIMATE.start_ceil_double_~x ULTIMATE.start_ceil_double_~x))} ceil_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(ceil_double_~i0~0, 20bv32)), 1023bv32); {328#(not (fp.eq ULTIMATE.start_ceil_double_~x ULTIMATE.start_ceil_double_~x))} is VALID [2020-07-28 17:43:01,382 INFO L280 TraceCheckUtils]: 3: Hoare triple {328#(not (fp.eq ULTIMATE.start_ceil_double_~x ULTIMATE.start_ceil_double_~x))} goto; {328#(not (fp.eq ULTIMATE.start_ceil_double_~x ULTIMATE.start_ceil_double_~x))} is VALID [2020-07-28 17:43:01,383 INFO L280 TraceCheckUtils]: 2: Hoare triple {328#(not (fp.eq ULTIMATE.start_ceil_double_~x ULTIMATE.start_ceil_double_~x))} call ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(ceil_double_~x, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8bv32);call ceil_double_#t~mem0 := read~intINTTYPE4(ceil_double_~#ew_u~0.base, ~bvadd32(4bv32, ceil_double_~#ew_u~0.offset), 4bv32);ceil_double_~i0~0 := ceil_double_#t~mem0;call write~intFLOATTYPE8(ceil_double_#t~union1, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8bv32);havoc ceil_double_#t~union1;havoc ceil_double_#t~mem0;call ceil_double_#t~mem2 := read~intINTTYPE4(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 4bv32);ceil_double_~i1~0 := ceil_double_#t~mem2;call write~intFLOATTYPE8(ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8bv32);havoc ceil_double_#t~union3;havoc ceil_double_#t~mem2;call ULTIMATE.dealloc(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset);havoc ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset; {328#(not (fp.eq ULTIMATE.start_ceil_double_~x ULTIMATE.start_ceil_double_~x))} is VALID [2020-07-28 17:43:01,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {271#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());ceil_double_#in~x := main_~x~0;havoc ceil_double_#res;havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, ceil_double_#t~mem4, ceil_double_#t~union5.lsw, ceil_double_#t~union5.msw, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0;ceil_double_~x := ceil_double_#in~x;havoc ceil_double_~i0~0;havoc ceil_double_~i1~0;havoc ceil_double_~j0~0;havoc ceil_double_~i~0;havoc ceil_double_~j~0; {328#(not (fp.eq ULTIMATE.start_ceil_double_~x ULTIMATE.start_ceil_double_~x))} is VALID [2020-07-28 17:43:01,388 INFO L280 TraceCheckUtils]: 0: Hoare triple {271#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_ceil~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {271#true} is VALID [2020-07-28 17:43:01,389 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:43:01,389 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072766313] [2020-07-28 17:43:01,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:01,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-07-28 17:43:01,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687024718] [2020-07-28 17:43:01,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2020-07-28 17:43:01,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:01,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 17:43:01,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:01,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 17:43:01,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:43:01,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 17:43:01,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-28 17:43:01,464 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 10 states. [2020-07-28 17:43:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:08,309 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2020-07-28 17:43:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:43:08,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2020-07-28 17:43:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 17:43:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-28 17:43:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 17:43:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-28 17:43:08,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2020-07-28 17:43:08,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:08,810 INFO L225 Difference]: With dead ends: 42 [2020-07-28 17:43:08,810 INFO L226 Difference]: Without dead ends: 21 [2020-07-28 17:43:08,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-07-28 17:43:08,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-28 17:43:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-28 17:43:08,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:08,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-28 17:43:08,816 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 17:43:08,816 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 17:43:08,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:08,819 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-28 17:43:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-28 17:43:08,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:08,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:08,820 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 17:43:08,820 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 17:43:08,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:08,822 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-28 17:43:08,823 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-28 17:43:08,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:08,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:08,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:08,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-28 17:43:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-28 17:43:08,826 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2020-07-28 17:43:08,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:08,826 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-28 17:43:08,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 17:43:08,827 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-28 17:43:08,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:43:08,828 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:08,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:09,029 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:43:09,030 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:09,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:09,032 INFO L82 PathProgramCache]: Analyzing trace with hash -649399050, now seen corresponding path program 1 times [2020-07-28 17:43:09,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:43:09,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681655460] [2020-07-28 17:43:09,034 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:43:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:09,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 17:43:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:09,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:43:09,427 INFO L280 TraceCheckUtils]: 0: Hoare triple {471#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_ceil~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {471#true} is VALID [2020-07-28 17:43:09,431 INFO L280 TraceCheckUtils]: 1: Hoare triple {471#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());ceil_double_#in~x := main_~x~0;havoc ceil_double_#res;havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, ceil_double_#t~mem4, ceil_double_#t~union5.lsw, ceil_double_#t~union5.msw, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0;ceil_double_~x := ceil_double_#in~x;havoc ceil_double_~i0~0;havoc ceil_double_~i1~0;havoc ceil_double_~j0~0;havoc ceil_double_~i~0;havoc ceil_double_~j~0; {479#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2020-07-28 17:43:09,437 INFO L280 TraceCheckUtils]: 2: Hoare triple {479#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} call ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(ceil_double_~x, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8bv32);call ceil_double_#t~mem0 := read~intINTTYPE4(ceil_double_~#ew_u~0.base, ~bvadd32(4bv32, ceil_double_~#ew_u~0.offset), 4bv32);ceil_double_~i0~0 := ceil_double_#t~mem0;call write~intFLOATTYPE8(ceil_double_#t~union1, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8bv32);havoc ceil_double_#t~union1;havoc ceil_double_#t~mem0;call ceil_double_#t~mem2 := read~intINTTYPE4(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 4bv32);ceil_double_~i1~0 := ceil_double_#t~mem2;call write~intFLOATTYPE8(ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8bv32);havoc ceil_double_#t~union3;havoc ceil_double_#t~mem2;call ULTIMATE.dealloc(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset);havoc ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset; {483#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start_ceil_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.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))))} is VALID [2020-07-28 17:43:09,438 INFO L280 TraceCheckUtils]: 3: Hoare triple {483#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start_ceil_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.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))))} goto; {483#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start_ceil_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.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))))} is VALID [2020-07-28 17:43:09,448 INFO L280 TraceCheckUtils]: 4: Hoare triple {483#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start_ceil_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.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))))} ceil_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(ceil_double_~i0~0, 20bv32)), 1023bv32); {490#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (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.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= (bvadd ULTIMATE.start_ceil_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:43:09,453 INFO L280 TraceCheckUtils]: 5: Hoare triple {490#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (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.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= (bvadd ULTIMATE.start_ceil_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))))))} assume ~bvslt32(ceil_double_~j0~0, 20bv32); {472#false} is VALID [2020-07-28 17:43:09,453 INFO L280 TraceCheckUtils]: 6: Hoare triple {472#false} assume ~bvslt32(ceil_double_~j0~0, 0bv32); {472#false} is VALID [2020-07-28 17:43:09,454 INFO L280 TraceCheckUtils]: 7: Hoare triple {472#false} assume !~fp.gt~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~huge_ceil~0, ceil_double_~x), ~Pluszero~DOUBLE()); {472#false} is VALID [2020-07-28 17:43:09,454 INFO L280 TraceCheckUtils]: 8: Hoare triple {472#false} call ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(ceil_double_~i0~0, ceil_double_~#iw_u~0.base, ~bvadd32(4bv32, ceil_double_~#iw_u~0.offset), 4bv32);call write~intINTTYPE4(ceil_double_~i1~0, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, 4bv32);call ceil_double_#t~mem4 := read~intFLOATTYPE8(ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, 8bv32);ceil_double_~x := ceil_double_#t~mem4;call write~intINTTYPE4(ceil_double_#t~union5.lsw, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, 4bv32);call write~intINTTYPE4(ceil_double_#t~union5.msw, ceil_double_~#iw_u~0.base, ~bvadd32(4bv32, ceil_double_~#iw_u~0.offset), 4bv32);havoc ceil_double_#t~mem4;havoc ceil_double_#t~union5.lsw, ceil_double_#t~union5.msw;call ULTIMATE.dealloc(ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset);havoc ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset; {472#false} is VALID [2020-07-28 17:43:09,454 INFO L280 TraceCheckUtils]: 9: Hoare triple {472#false} goto; {472#false} is VALID [2020-07-28 17:43:09,455 INFO L280 TraceCheckUtils]: 10: Hoare triple {472#false} ceil_double_#res := ceil_double_~x; {472#false} is VALID [2020-07-28 17:43:09,455 INFO L280 TraceCheckUtils]: 11: Hoare triple {472#false} main_#t~ret6 := ceil_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_double_#in~x := main_~res~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if !~fp.eq~DOUBLE(isnan_double_~x, isnan_double_~x) then 1bv32 else 0bv32); {472#false} is VALID [2020-07-28 17:43:09,456 INFO L280 TraceCheckUtils]: 12: Hoare triple {472#false} main_#t~ret7 := isnan_double_#res; {472#false} is VALID [2020-07-28 17:43:09,456 INFO L280 TraceCheckUtils]: 13: Hoare triple {472#false} assume 0bv32 == main_#t~ret7;havoc main_#t~ret7; {472#false} is VALID [2020-07-28 17:43:09,456 INFO L280 TraceCheckUtils]: 14: Hoare triple {472#false} assume !false; {472#false} is VALID [2020-07-28 17:43:09,458 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:43:09,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:43:09,674 INFO L280 TraceCheckUtils]: 14: Hoare triple {472#false} assume !false; {472#false} is VALID [2020-07-28 17:43:09,675 INFO L280 TraceCheckUtils]: 13: Hoare triple {472#false} assume 0bv32 == main_#t~ret7;havoc main_#t~ret7; {472#false} is VALID [2020-07-28 17:43:09,675 INFO L280 TraceCheckUtils]: 12: Hoare triple {472#false} main_#t~ret7 := isnan_double_#res; {472#false} is VALID [2020-07-28 17:43:09,675 INFO L280 TraceCheckUtils]: 11: Hoare triple {472#false} main_#t~ret6 := ceil_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_double_#in~x := main_~res~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if !~fp.eq~DOUBLE(isnan_double_~x, isnan_double_~x) then 1bv32 else 0bv32); {472#false} is VALID [2020-07-28 17:43:09,675 INFO L280 TraceCheckUtils]: 10: Hoare triple {472#false} ceil_double_#res := ceil_double_~x; {472#false} is VALID [2020-07-28 17:43:09,676 INFO L280 TraceCheckUtils]: 9: Hoare triple {472#false} goto; {472#false} is VALID [2020-07-28 17:43:09,676 INFO L280 TraceCheckUtils]: 8: Hoare triple {472#false} call ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(ceil_double_~i0~0, ceil_double_~#iw_u~0.base, ~bvadd32(4bv32, ceil_double_~#iw_u~0.offset), 4bv32);call write~intINTTYPE4(ceil_double_~i1~0, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, 4bv32);call ceil_double_#t~mem4 := read~intFLOATTYPE8(ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, 8bv32);ceil_double_~x := ceil_double_#t~mem4;call write~intINTTYPE4(ceil_double_#t~union5.lsw, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, 4bv32);call write~intINTTYPE4(ceil_double_#t~union5.msw, ceil_double_~#iw_u~0.base, ~bvadd32(4bv32, ceil_double_~#iw_u~0.offset), 4bv32);havoc ceil_double_#t~mem4;havoc ceil_double_#t~union5.lsw, ceil_double_#t~union5.msw;call ULTIMATE.dealloc(ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset);havoc ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset; {472#false} is VALID [2020-07-28 17:43:09,676 INFO L280 TraceCheckUtils]: 7: Hoare triple {472#false} assume !~fp.gt~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~huge_ceil~0, ceil_double_~x), ~Pluszero~DOUBLE()); {472#false} is VALID [2020-07-28 17:43:09,676 INFO L280 TraceCheckUtils]: 6: Hoare triple {472#false} assume ~bvslt32(ceil_double_~j0~0, 0bv32); {472#false} is VALID [2020-07-28 17:43:09,677 INFO L280 TraceCheckUtils]: 5: Hoare triple {548#(not (bvslt ULTIMATE.start_ceil_double_~j0~0 (_ bv20 32)))} assume ~bvslt32(ceil_double_~j0~0, 20bv32); {472#false} is VALID [2020-07-28 17:43:09,678 INFO L280 TraceCheckUtils]: 4: Hoare triple {552#(not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ULTIMATE.start_ceil_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32)))} ceil_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(ceil_double_~i0~0, 20bv32)), 1023bv32); {548#(not (bvslt ULTIMATE.start_ceil_double_~j0~0 (_ bv20 32)))} is VALID [2020-07-28 17:43:09,685 INFO L280 TraceCheckUtils]: 3: Hoare triple {552#(not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ULTIMATE.start_ceil_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32)))} goto; {552#(not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ULTIMATE.start_ceil_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32)))} is VALID [2020-07-28 17:43:09,692 INFO L280 TraceCheckUtils]: 2: Hoare triple {559#(forall ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (or (not (= ULTIMATE.start_ceil_double_~x (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)))) (not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32)))))} call ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(ceil_double_~x, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8bv32);call ceil_double_#t~mem0 := read~intINTTYPE4(ceil_double_~#ew_u~0.base, ~bvadd32(4bv32, ceil_double_~#ew_u~0.offset), 4bv32);ceil_double_~i0~0 := ceil_double_#t~mem0;call write~intFLOATTYPE8(ceil_double_#t~union1, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8bv32);havoc ceil_double_#t~union1;havoc ceil_double_#t~mem0;call ceil_double_#t~mem2 := read~intINTTYPE4(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 4bv32);ceil_double_~i1~0 := ceil_double_#t~mem2;call write~intFLOATTYPE8(ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8bv32);havoc ceil_double_#t~union3;havoc ceil_double_#t~mem2;call ULTIMATE.dealloc(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset);havoc ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset; {552#(not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ULTIMATE.start_ceil_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32)))} is VALID [2020-07-28 17:43:09,698 INFO L280 TraceCheckUtils]: 1: Hoare triple {471#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());ceil_double_#in~x := main_~x~0;havoc ceil_double_#res;havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, ceil_double_#t~mem4, ceil_double_#t~union5.lsw, ceil_double_#t~union5.msw, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0;ceil_double_~x := ceil_double_#in~x;havoc ceil_double_~i0~0;havoc ceil_double_~i1~0;havoc ceil_double_~j0~0;havoc ceil_double_~i~0;havoc ceil_double_~j~0; {559#(forall ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (or (not (= ULTIMATE.start_ceil_double_~x (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)))) (not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32)))))} is VALID [2020-07-28 17:43:09,698 INFO L280 TraceCheckUtils]: 0: Hoare triple {471#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_ceil~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {471#true} is VALID [2020-07-28 17:43:09,699 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:43:09,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681655460] [2020-07-28 17:43:09,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:09,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2020-07-28 17:43:09,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54814728] [2020-07-28 17:43:09,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-07-28 17:43:09,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:09,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 17:43:09,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:09,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 17:43:09,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:43:09,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 17:43:09,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-28 17:43:09,778 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 8 states. [2020-07-28 17:43:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:10,163 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-28 17:43:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:43:10,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-07-28 17:43:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:43:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2020-07-28 17:43:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:43:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2020-07-28 17:43:10,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2020-07-28 17:43:10,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:10,320 INFO L225 Difference]: With dead ends: 21 [2020-07-28 17:43:10,320 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 17:43:10,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-28 17:43:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 17:43:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 17:43:10,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:10,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 17:43:10,321 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:43:10,321 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:43:10,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:10,322 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:43:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:43:10,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:10,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:10,322 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:43:10,323 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:43:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:10,323 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:43:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:43:10,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:10,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:10,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:10,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 17:43:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 17:43:10,324 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2020-07-28 17:43:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:10,324 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 17:43:10,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 17:43:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:43:10,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:10,528 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:43:10,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 17:43:10,654 INFO L268 CegarLoopResult]: For program point L60(lines 60 72) no Hoare annotation was computed. [2020-07-28 17:43:10,654 INFO L268 CegarLoopResult]: For program point L52(lines 52 55) no Hoare annotation was computed. [2020-07-28 17:43:10,654 INFO L268 CegarLoopResult]: For program point L44(lines 44 49) no Hoare annotation was computed. [2020-07-28 17:43:10,654 INFO L268 CegarLoopResult]: For program point L94(lines 94 97) no Hoare annotation was computed. [2020-07-28 17:43:10,655 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 17:43:10,655 INFO L268 CegarLoopResult]: For program point L61(lines 61 70) no Hoare annotation was computed. [2020-07-28 17:43:10,655 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 17:43:10,655 INFO L268 CegarLoopResult]: For program point L61-1(lines 61 70) no Hoare annotation was computed. [2020-07-28 17:43:10,655 INFO L268 CegarLoopResult]: For program point L45(lines 45 46) no Hoare annotation was computed. [2020-07-28 17:43:10,655 INFO L268 CegarLoopResult]: For program point L45-2(lines 45 46) no Hoare annotation was computed. [2020-07-28 17:43:10,655 INFO L268 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2020-07-28 17:43:10,655 INFO L268 CegarLoopResult]: For program point L62(lines 62 69) no Hoare annotation was computed. [2020-07-28 17:43:10,656 INFO L268 CegarLoopResult]: For program point L29(lines 29 73) no Hoare annotation was computed. [2020-07-28 17:43:10,656 INFO L268 CegarLoopResult]: For program point L30(lines 30 50) no Hoare annotation was computed. [2020-07-28 17:43:10,656 INFO L268 CegarLoopResult]: For program point L22-1(lines 22 27) no Hoare annotation was computed. [2020-07-28 17:43:10,656 INFO L264 CegarLoopResult]: At program point L22-2(lines 22 27) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) [2020-07-28 17:43:10,656 INFO L268 CegarLoopResult]: For program point L22-3(lines 22 27) no Hoare annotation was computed. [2020-07-28 17:43:10,656 INFO L264 CegarLoopResult]: At program point L80(lines 19 81) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) (not (fp.eq |ULTIMATE.start_ceil_double_#res| |ULTIMATE.start_ceil_double_#res|))) [2020-07-28 17:43:10,656 INFO L268 CegarLoopResult]: For program point L31(lines 31 39) no Hoare annotation was computed. [2020-07-28 17:43:10,657 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_ceil_double_~x (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) (not (fp.eq |ULTIMATE.start_ceil_double_#res| |ULTIMATE.start_ceil_double_#res|)) (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|)) [2020-07-28 17:43:10,657 INFO L268 CegarLoopResult]: For program point L32(lines 32 38) no Hoare annotation was computed. [2020-07-28 17:43:10,657 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 17:43:10,657 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2020-07-28 17:43:10,657 INFO L268 CegarLoopResult]: For program point L74(lines 74 79) no Hoare annotation was computed. [2020-07-28 17:43:10,657 INFO L268 CegarLoopResult]: For program point L74-1(lines 19 81) no Hoare annotation was computed. [2020-07-28 17:43:10,657 INFO L268 CegarLoopResult]: For program point L74-2(lines 74 79) no Hoare annotation was computed. [2020-07-28 17:43:10,658 INFO L271 CegarLoopResult]: At program point L99(lines 83 100) the Hoare annotation is: true [2020-07-28 17:43:10,658 INFO L268 CegarLoopResult]: For program point L66(lines 66 67) no Hoare annotation was computed. [2020-07-28 17:43:10,658 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 17:43:10,658 INFO L268 CegarLoopResult]: For program point L66-2(lines 66 67) no Hoare annotation was computed. [2020-07-28 17:43:10,658 INFO L268 CegarLoopResult]: For program point L58(lines 58 59) no Hoare annotation was computed. [2020-07-28 17:43:10,658 INFO L268 CegarLoopResult]: For program point L42(lines 42 43) no Hoare annotation was computed. [2020-07-28 17:43:10,658 INFO L268 CegarLoopResult]: For program point L51(lines 51 73) no Hoare annotation was computed. [2020-07-28 17:43:10,658 INFO L268 CegarLoopResult]: For program point L35(lines 35 38) no Hoare annotation was computed. [2020-07-28 17:43:10,662 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:43:10,662 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:43:10,662 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 17:43:10,663 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-28 17:43:10,663 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 17:43:10,663 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 17:43:10,663 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-28 17:43:10,663 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-28 17:43:10,663 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-28 17:43:10,663 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 17:43:10,663 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 17:43:10,664 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 17:43:10,664 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 17:43:10,664 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 17:43:10,664 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 17:43:10,664 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-28 17:43:10,665 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-28 17:43:10,665 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-28 17:43:10,665 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-28 17:43:10,665 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-28 17:43:10,665 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-28 17:43:10,665 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:43:10,665 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:43:10,665 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2020-07-28 17:43:10,666 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2020-07-28 17:43:10,667 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-28 17:43:10,667 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-28 17:43:10,667 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-28 17:43:10,667 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-28 17:43:10,667 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-28 17:43:10,667 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-28 17:43:10,667 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-28 17:43:10,668 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-28 17:43:10,668 WARN L170 areAnnotationChecker]: L74-2 has no Hoare annotation [2020-07-28 17:43:10,668 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2020-07-28 17:43:10,668 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-28 17:43:10,668 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-28 17:43:10,668 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-28 17:43:10,669 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-28 17:43:10,669 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2020-07-28 17:43:10,669 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2020-07-28 17:43:10,669 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-28 17:43:10,669 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-28 17:43:10,669 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-28 17:43:10,669 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2020-07-28 17:43:10,670 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2020-07-28 17:43:10,670 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2020-07-28 17:43:10,670 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:43:10,670 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-28 17:43:10,670 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-28 17:43:10,670 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:43:10,670 WARN L170 areAnnotationChecker]: L66-2 has no Hoare annotation [2020-07-28 17:43:10,671 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:43:10,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:43:10,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:43:10,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:43:10,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:43:10,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:43:10,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:43:10,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:43:10 BoogieIcfgContainer [2020-07-28 17:43:10,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:43:10,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:43:10,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:43:10,688 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:43:10,688 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:58" (3/4) ... [2020-07-28 17:43:10,692 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 17:43:10,705 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2020-07-28 17:43:10,706 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-07-28 17:43:10,706 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 17:43:10,738 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2020-07-28 17:43:10,739 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && !~fp.eq~DOUBLE(\result, \result) [2020-07-28 17:43:10,740 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && !~fp.eq~DOUBLE(\result, \result)) && 1bv32 == \result [2020-07-28 17:43:10,781 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:43:10,781 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:43:10,784 INFO L168 Benchmark]: Toolchain (without parser) took 14589.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 950.8 MB in the beginning and 835.5 MB in the end (delta: 115.3 MB). Peak memory consumption was 263.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:10,784 INFO L168 Benchmark]: CDTParser took 0.30 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:43:10,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.49 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:10,786 INFO L168 Benchmark]: Boogie Procedure Inliner took 164.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -202.1 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:10,786 INFO L168 Benchmark]: Boogie Preprocessor took 46.34 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:43:10,787 INFO L168 Benchmark]: RCFGBuilder took 1767.43 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.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:10,787 INFO L168 Benchmark]: TraceAbstraction took 12201.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 842.3 MB in the end (delta: 249.0 MB). Peak memory consumption was 249.0 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:10,788 INFO L168 Benchmark]: Witness Printer took 93.99 ms. Allocated memory is still 1.2 GB. Free memory was 842.3 MB in the beginning and 835.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:10,791 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.30 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 307.49 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 164.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -202.1 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.34 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 1767.43 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.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12201.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 842.3 MB in the end (delta: 249.0 MB). Peak memory consumption was 249.0 MB. Max. memory is 11.5 GB. * Witness Printer took 93.99 ms. Allocated memory is still 1.2 GB. Free memory was 842.3 MB in the beginning and 835.5 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant [2020-07-28 17:43:10,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:43:10,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && !~fp.eq~DOUBLE(\result, \result)) && 1bv32 == \result - InvariantResult [Line: 19]: Loop Invariant [2020-07-28 17:43:10,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:43:10,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && !~fp.eq~DOUBLE(\result, \result) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant [2020-07-28 17:43:10,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:43:10,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.9s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 68 SDtfs, 27 SDslu, 75 SDs, 0 SdLazy, 60 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 8 NumberOfFragments, 35 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 70 ConstructedInterpolants, 12 QuantifiedInterpolants, 3143 SizeOfPredicates, 18 NumberOfNonLiveVariables, 108 ConjunctsInSsa, 19 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 correct! Received shutdown request...