./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1031.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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_1031.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0b27c979e636f8f0b41855b0202d99554f0e605524f6adc2a0c0016b8c54c39 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:36:05,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:36:05,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:36:05,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:36:05,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:36:05,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:36:05,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:36:05,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:36:05,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:36:05,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:36:05,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:36:05,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:36:05,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:36:05,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:36:05,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:36:05,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:36:05,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:36:05,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:36:05,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:36:05,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:36:05,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:36:05,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:36:05,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:36:05,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:36:05,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:36:05,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:36:05,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:36:05,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:36:05,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:36:05,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:36:05,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:36:05,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:36:05,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:36:05,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:36:05,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:36:05,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:36:05,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:36:05,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:36:05,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:36:05,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:36:05,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:36:05,693 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:36:05,707 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:36:05,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:36:05,710 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:36:05,710 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:36:05,711 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:36:05,711 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:36:05,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:36:05,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:36:05,712 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:36:05,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:36:05,712 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:36:05,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:36:05,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:36:05,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:36:05,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:36:05,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:36:05,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:36:05,713 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:36:05,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:36:05,714 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:36:05,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:36:05,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:36:05,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:36:05,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:36:05,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:36:05,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:36:05,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:36:05,716 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:36:05,716 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:36:05,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:36:05,716 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:36:05,716 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:36:05,717 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:36:05,717 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> f0b27c979e636f8f0b41855b0202d99554f0e605524f6adc2a0c0016b8c54c39 [2022-02-20 16:36:05,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:36:05,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:36:05,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:36:05,937 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:36:05,938 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:36:05,939 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1031.c [2022-02-20 16:36:05,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9d10a30/43b99137d3264a60a33d33e8375f4a24/FLAG105dd31dd [2022-02-20 16:36:06,357 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:36:06,358 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1031.c [2022-02-20 16:36:06,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9d10a30/43b99137d3264a60a33d33e8375f4a24/FLAG105dd31dd [2022-02-20 16:36:06,791 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9d10a30/43b99137d3264a60a33d33e8375f4a24 [2022-02-20 16:36:06,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:36:06,794 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:36:06,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:36:06,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:36:06,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:36:06,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:36:06" (1/1) ... [2022-02-20 16:36:06,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fadd7a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:06, skipping insertion in model container [2022-02-20 16:36:06,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:36:06" (1/1) ... [2022-02-20 16:36:06,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:36:06,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:36:06,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1031.c[2057,2070] [2022-02-20 16:36:06,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:36:07,000 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:36:07,017 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1031.c[2057,2070] [2022-02-20 16:36:07,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:36:07,027 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:36:07,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:07 WrapperNode [2022-02-20 16:36:07,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:36:07,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:36:07,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:36:07,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:36:07,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:07" (1/1) ... [2022-02-20 16:36:07,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:07" (1/1) ... [2022-02-20 16:36:07,060 INFO L137 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-02-20 16:36:07,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:36:07,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:36:07,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:36:07,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:36:07,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:07" (1/1) ... [2022-02-20 16:36:07,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:07" (1/1) ... [2022-02-20 16:36:07,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:07" (1/1) ... [2022-02-20 16:36:07,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:07" (1/1) ... [2022-02-20 16:36:07,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:07" (1/1) ... [2022-02-20 16:36:07,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:07" (1/1) ... [2022-02-20 16:36:07,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:07" (1/1) ... [2022-02-20 16:36:07,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:36:07,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:36:07,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:36:07,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:36:07,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:07" (1/1) ... [2022-02-20 16:36:07,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:36:07,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:36:07,126 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:36:07,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:36:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:36:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:36:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:36:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:36:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:36:07,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:36:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:36:07,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:36:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:36:07,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:36:07,198 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:36:07,199 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:36:07,467 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:36:07,472 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:36:07,472 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:36:07,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:36:07 BoogieIcfgContainer [2022-02-20 16:36:07,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:36:07,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:36:07,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:36:07,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:36:07,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:36:06" (1/3) ... [2022-02-20 16:36:07,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48473de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:36:07, skipping insertion in model container [2022-02-20 16:36:07,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:07" (2/3) ... [2022-02-20 16:36:07,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48473de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:36:07, skipping insertion in model container [2022-02-20 16:36:07,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:36:07" (3/3) ... [2022-02-20 16:36:07,480 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1031.c [2022-02-20 16:36:07,483 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:36:07,483 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:36:07,521 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:36:07,526 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:36:07,526 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:36:07,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:36:07,540 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:36:07,541 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:36:07,541 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:36:07,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:36:07,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2068161395, now seen corresponding path program 1 times [2022-02-20 16:36:07,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:36:07,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062574087] [2022-02-20 16:36:07,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:36:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:36:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:07,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {29#true} is VALID [2022-02-20 16:36:07,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);assume { :begin_inline_round_double } true;round_double_#in~x#1 := main_~x~0#1;havoc round_double_#res#1;havoc round_double_#t~mem4#1, round_double_#t~mem5#1, round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, round_double_~exponent_mask~0#1, round_double_~exponent_mask~1#1, round_double_~tmp~0#1, round_double_#t~mem6#1, round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset, round_double_~x#1, round_double_~msw~0#1, round_double_~exponent_less_1023~0#1, round_double_~lsw~0#1;round_double_~x#1 := round_double_#in~x#1;havoc round_double_~msw~0#1;havoc round_double_~exponent_less_1023~0#1;havoc round_double_~lsw~0#1; {29#true} is VALID [2022-02-20 16:36:07,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-02-20 16:36:07,648 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#false} round_double_~exponent_less_1023~0#1 := (if 0 == round_double_~msw~0#1 then 0 else (if 1 == round_double_~msw~0#1 then 0 else ~bitwiseAnd(round_double_~msw~0#1, 2146435072))) / 1048576 - 1023; {30#false} is VALID [2022-02-20 16:36:07,648 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#false} assume round_double_~exponent_less_1023~0#1 < 20; {30#false} is VALID [2022-02-20 16:36:07,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} assume !(round_double_~exponent_less_1023~0#1 < 0);round_double_~exponent_mask~0#1 := (if 31 == round_double_~exponent_less_1023~0#1 || 63 == round_double_~exponent_less_1023~0#1 then 0 else ~shiftRight(1048575, round_double_~exponent_less_1023~0#1)); {30#false} is VALID [2022-02-20 16:36:07,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} assume 0 == (if 0 == round_double_~msw~0#1 || 0 == round_double_~exponent_mask~0#1 then 0 else (if 1 == round_double_~exponent_mask~0#1 then (if 1 == round_double_~msw~0#1 || 0 == round_double_~msw~0#1 then round_double_~msw~0#1 else (if round_double_~msw~0#1 >= 0 then round_double_~msw~0#1 % 2 else ~bitwiseAnd(round_double_~msw~0#1, round_double_~exponent_mask~0#1))) else (if 1 == round_double_~msw~0#1 then (if 1 == round_double_~exponent_mask~0#1 || 0 == round_double_~exponent_mask~0#1 then round_double_~exponent_mask~0#1 else (if round_double_~exponent_mask~0#1 >= 0 then round_double_~exponent_mask~0#1 % 2 else ~bitwiseAnd(round_double_~msw~0#1, round_double_~exponent_mask~0#1))) else ~bitwiseAnd(round_double_~msw~0#1, round_double_~exponent_mask~0#1)))) % 4294967296 && 0 == round_double_~lsw~0#1 % 4294967296;round_double_#res#1 := round_double_~x#1; {30#false} is VALID [2022-02-20 16:36:07,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} main_#t~ret7#1 := round_double_#res#1;assume { :end_inline_round_double } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x#1, isnan_double_~x#1) then 1 else 0); {30#false} is VALID [2022-02-20 16:36:07,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} main_#t~ret8#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647; {30#false} is VALID [2022-02-20 16:36:07,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == main_#t~ret8#1;havoc main_#t~ret8#1; {30#false} is VALID [2022-02-20 16:36:07,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 16:36:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:36:07,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:36:07,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062574087] [2022-02-20 16:36:07,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062574087] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:36:07,652 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:36:07,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:36:07,653 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702623343] [2022-02-20 16:36:07,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:36:07,657 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:36:07,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:36:07,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:07,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:36:07,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:36:07,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:36:07,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:36:07,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:36:07,687 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:07,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:07,736 INFO L93 Difference]: Finished difference Result 50 states and 74 transitions. [2022-02-20 16:36:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:36:07,737 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:36:07,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:36:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 16:36:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 16:36:07,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2022-02-20 16:36:07,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:36:07,857 INFO L225 Difference]: With dead ends: 50 [2022-02-20 16:36:07,857 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:36:07,860 INFO L932 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 [2022-02-20 16:36:07,865 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:36:07,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:36:07,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:36:07,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 16:36:07,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:36:07,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:07,890 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:07,891 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:07,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:07,894 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-02-20 16:36:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-02-20 16:36:07,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:07,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:07,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 16:36:07,897 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 16:36:07,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:07,899 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-02-20 16:36:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-02-20 16:36:07,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:07,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:07,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:36:07,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:36:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-02-20 16:36:07,904 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 11 [2022-02-20 16:36:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:36:07,904 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-02-20 16:36:07,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:07,905 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-02-20 16:36:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:36:07,906 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:36:07,907 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:36:07,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:36:07,909 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:36:07,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:36:07,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1606884976, now seen corresponding path program 1 times [2022-02-20 16:36:07,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:36:07,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348582645] [2022-02-20 16:36:07,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:36:07,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:36:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:36:08,031 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:36:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:36:08,095 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:36:08,095 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:36:08,096 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:36:08,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:36:08,101 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:36:08,103 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:36:08,136 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:36:08,136 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:36:08,136 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:36:08,136 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:36:08,136 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:36:08,136 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:36:08,136 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-02-20 16:36:08,137 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:36:08,137 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:36:08,137 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:36:08,137 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:36:08,137 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:36:08,137 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:36:08,137 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 16:36:08,137 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 16:36:08,137 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:36:08,137 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:36:08,138 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:36:08,138 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:36:08,138 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:36:08,138 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:36:08,138 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-02-20 16:36:08,138 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 16:36:08,138 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-02-20 16:36:08,138 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-02-20 16:36:08,138 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:36:08,139 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:36:08,139 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 16:36:08,139 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 16:36:08,139 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 16:36:08,139 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2022-02-20 16:36:08,139 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2022-02-20 16:36:08,139 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:36:08,139 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:36:08,139 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:36:08,140 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:36:08,140 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 16:36:08,140 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:36:08,141 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. [2022-02-20 16:36:08,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:36:08 BoogieIcfgContainer [2022-02-20 16:36:08,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:36:08,143 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:36:08,143 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:36:08,144 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:36:08,144 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:36:07" (3/4) ... [2022-02-20 16:36:08,147 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:36:08,147 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:36:08,149 INFO L158 Benchmark]: Toolchain (without parser) took 1354.08ms. Allocated memory was 117.4MB in the beginning and 144.7MB in the end (delta: 27.3MB). Free memory was 79.9MB in the beginning and 105.2MB in the end (delta: -25.2MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. [2022-02-20 16:36:08,149 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory was 88.2MB in the beginning and 88.2MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:36:08,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.00ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 88.8MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:36:08,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.82ms. Allocated memory is still 117.4MB. Free memory was 88.8MB in the beginning and 86.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:36:08,151 INFO L158 Benchmark]: Boogie Preprocessor took 30.75ms. Allocated memory is still 117.4MB. Free memory was 86.3MB in the beginning and 84.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:36:08,151 INFO L158 Benchmark]: RCFGBuilder took 381.07ms. Allocated memory is still 117.4MB. Free memory was 84.6MB in the beginning and 64.8MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-20 16:36:08,152 INFO L158 Benchmark]: TraceAbstraction took 667.84ms. Allocated memory was 117.4MB in the beginning and 144.7MB in the end (delta: 27.3MB). Free memory was 64.2MB in the beginning and 105.4MB in the end (delta: -41.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:36:08,152 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 144.7MB. Free memory was 105.4MB in the beginning and 105.2MB in the end (delta: 281.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:36:08,154 INFO L339 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.15ms. Allocated memory is still 117.4MB. Free memory was 88.2MB in the beginning and 88.2MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.00ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 88.8MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.82ms. Allocated memory is still 117.4MB. Free memory was 88.8MB in the beginning and 86.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.75ms. Allocated memory is still 117.4MB. Free memory was 86.3MB in the beginning and 84.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 381.07ms. Allocated memory is still 117.4MB. Free memory was 84.6MB in the beginning and 64.8MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 667.84ms. Allocated memory was 117.4MB in the beginning and 144.7MB in the end (delta: 27.3MB). Free memory was 64.2MB in the beginning and 105.4MB in the end (delta: -41.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 144.7MB. Free memory was 105.4MB in the beginning and 105.2MB in the end (delta: 281.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 81]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftRight at line 36, overapproximation of someBinaryArithmeticDOUBLEoperation at line 76, overapproximation of bitwiseAnd at line 37, overapproximation of someBinaryDOUBLEComparisonOperation at line 17. Possible FailurePath: [L76] double x = 0.0 / 0.0; [L77] CALL, EXPR round_double(x) [L20] __int32_t msw, exponent_less_1023; [L21] __uint32_t lsw; VAL [\old(x)=4294967303, x=4294967303] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L28] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=4294967303, exponent_less_1023=0, lsw=0, msw=6, x=4294967303] [L29] COND TRUE exponent_less_1023 < 20 VAL [\old(x)=4294967303, exponent_less_1023=0, lsw=0, msw=6, x=4294967303] [L30] COND FALSE !(exponent_less_1023 < 0) [L36] __uint32_t exponent_mask = 0x000fffff >> exponent_less_1023; VAL [\old(x)=4294967303, exponent_less_1023=0, exponent_mask=0, lsw=0, msw=6, x=4294967303] [L37] COND TRUE (msw & exponent_mask) == 0 && lsw == 0 [L38] return x; VAL [\old(x)=4294967303, \result=4294967303, exponent_less_1023=0, exponent_mask=0, lsw=0, msw=6, x=4294967303] [L77] RET, EXPR round_double(x) [L77] double res = round_double(x); [L80] CALL, EXPR isnan_double(res) [L17] return x != x; VAL [\old(x)=4294967303, \result=0, x=4294967303] [L80] RET, EXPR isnan_double(res) [L80] COND TRUE !isnan_double(res) [L81] reach_error() VAL [res=4294967303, x=4294967303] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 33 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, 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=26occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 10 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 [2022-02-20 16:36:08,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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_1031.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0b27c979e636f8f0b41855b0202d99554f0e605524f6adc2a0c0016b8c54c39 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:36:09,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:36:09,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:36:09,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:36:09,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:36:09,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:36:09,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:36:09,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:36:09,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:36:09,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:36:09,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:36:09,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:36:09,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:36:09,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:36:09,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:36:09,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:36:09,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:36:09,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:36:09,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:36:09,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:36:09,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:36:09,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:36:09,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:36:09,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:36:09,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:36:09,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:36:09,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:36:09,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:36:09,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:36:09,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:36:09,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:36:09,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:36:10,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:36:10,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:36:10,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:36:10,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:36:10,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:36:10,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:36:10,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:36:10,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:36:10,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:36:10,008 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:36:10,037 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:36:10,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:36:10,039 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:36:10,039 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:36:10,040 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:36:10,040 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:36:10,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:36:10,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:36:10,041 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:36:10,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:36:10,042 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:36:10,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:36:10,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:36:10,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:36:10,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:36:10,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:36:10,043 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:36:10,043 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:36:10,044 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:36:10,044 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:36:10,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:36:10,044 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:36:10,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:36:10,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:36:10,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:36:10,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:36:10,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:36:10,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:36:10,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:36:10,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:36:10,046 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:36:10,046 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:36:10,046 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:36:10,046 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:36:10,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:36:10,046 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:36:10,047 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> f0b27c979e636f8f0b41855b0202d99554f0e605524f6adc2a0c0016b8c54c39 [2022-02-20 16:36:10,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:36:10,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:36:10,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:36:10,333 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:36:10,333 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:36:10,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1031.c [2022-02-20 16:36:10,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003e8801a/8ce08f2137344f6ca5c663a68c2977c0/FLAG8d7e6643c [2022-02-20 16:36:10,757 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:36:10,757 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1031.c [2022-02-20 16:36:10,763 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003e8801a/8ce08f2137344f6ca5c663a68c2977c0/FLAG8d7e6643c [2022-02-20 16:36:10,775 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003e8801a/8ce08f2137344f6ca5c663a68c2977c0 [2022-02-20 16:36:10,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:36:10,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:36:10,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:36:10,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:36:10,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:36:10,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:36:10" (1/1) ... [2022-02-20 16:36:10,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eaa243d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:10, skipping insertion in model container [2022-02-20 16:36:10,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:36:10" (1/1) ... [2022-02-20 16:36:10,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:36:10,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:36:10,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1031.c[2057,2070] [2022-02-20 16:36:10,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:36:10,992 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:36:11,030 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1031.c[2057,2070] [2022-02-20 16:36:11,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:36:11,049 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:36:11,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:11 WrapperNode [2022-02-20 16:36:11,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:36:11,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:36:11,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:36:11,051 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:36:11,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:11" (1/1) ... [2022-02-20 16:36:11,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:11" (1/1) ... [2022-02-20 16:36:11,096 INFO L137 Inliner]: procedures = 19, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-02-20 16:36:11,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:36:11,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:36:11,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:36:11,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:36:11,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:11" (1/1) ... [2022-02-20 16:36:11,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:11" (1/1) ... [2022-02-20 16:36:11,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:11" (1/1) ... [2022-02-20 16:36:11,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:11" (1/1) ... [2022-02-20 16:36:11,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:11" (1/1) ... [2022-02-20 16:36:11,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:11" (1/1) ... [2022-02-20 16:36:11,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:11" (1/1) ... [2022-02-20 16:36:11,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:36:11,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:36:11,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:36:11,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:36:11,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:11" (1/1) ... [2022-02-20 16:36:11,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:36:11,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:36:11,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:36:11,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:36:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:36:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-02-20 16:36:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-02-20 16:36:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:36:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:36:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:36:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:36:11,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:36:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:36:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:36:11,254 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:36:11,255 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:36:11,417 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:36:11,421 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:36:11,422 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:36:11,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:36:11 BoogieIcfgContainer [2022-02-20 16:36:11,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:36:11,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:36:11,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:36:11,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:36:11,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:36:10" (1/3) ... [2022-02-20 16:36:11,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5149ccec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:36:11, skipping insertion in model container [2022-02-20 16:36:11,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:36:11" (2/3) ... [2022-02-20 16:36:11,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5149ccec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:36:11, skipping insertion in model container [2022-02-20 16:36:11,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:36:11" (3/3) ... [2022-02-20 16:36:11,435 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1031.c [2022-02-20 16:36:11,438 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:36:11,438 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:36:11,468 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:36:11,473 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:36:11,473 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:36:11,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:11,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:36:11,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:36:11,487 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:36:11,487 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:36:11,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:36:11,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2068161395, now seen corresponding path program 1 times [2022-02-20 16:36:11,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:36:11,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511314114] [2022-02-20 16:36:11,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:36:11,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:36:11,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:36:11,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:36:11,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:36:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:11,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:36:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:11,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:36:11,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {29#true} is VALID [2022-02-20 16:36:11,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_round_double } true;round_double_#in~x#1 := main_~x~0#1;havoc round_double_#res#1;havoc round_double_#t~mem4#1, round_double_#t~mem5#1, round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, round_double_~exponent_mask~0#1, round_double_~exponent_mask~1#1, round_double_~tmp~0#1, round_double_#t~mem6#1, round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset, round_double_~x#1, round_double_~msw~0#1, round_double_~exponent_less_1023~0#1, round_double_~lsw~0#1;round_double_~x#1 := round_double_#in~x#1;havoc round_double_~msw~0#1;havoc round_double_~exponent_less_1023~0#1;havoc round_double_~lsw~0#1; {29#true} is VALID [2022-02-20 16:36:11,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-02-20 16:36:11,693 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#false} round_double_~exponent_less_1023~0#1 := ~bvsub32(~bvashr32(~bvand32(2146435072bv32, round_double_~msw~0#1), 20bv32), 1023bv32); {30#false} is VALID [2022-02-20 16:36:11,693 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#false} assume ~bvslt32(round_double_~exponent_less_1023~0#1, 20bv32); {30#false} is VALID [2022-02-20 16:36:11,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} assume !~bvslt32(round_double_~exponent_less_1023~0#1, 0bv32);round_double_~exponent_mask~0#1 := ~bvashr32(1048575bv32, round_double_~exponent_less_1023~0#1); {30#false} is VALID [2022-02-20 16:36:11,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} assume 0bv32 == ~bvand32(round_double_~msw~0#1, round_double_~exponent_mask~0#1) && 0bv32 == round_double_~lsw~0#1;round_double_#res#1 := round_double_~x#1; {30#false} is VALID [2022-02-20 16:36:11,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} main_#t~ret7#1 := round_double_#res#1;assume { :end_inline_round_double } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {30#false} is VALID [2022-02-20 16:36:11,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} main_#t~ret8#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {30#false} is VALID [2022-02-20 16:36:11,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {30#false} is VALID [2022-02-20 16:36:11,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 16:36:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:36:11,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:36:11,697 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:36:11,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511314114] [2022-02-20 16:36:11,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511314114] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:36:11,698 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:36:11,698 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:36:11,699 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948052188] [2022-02-20 16:36:11,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:36:11,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:36:11,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:36:11,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:11,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:36:11,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:36:11,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:36:11,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:36:11,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:36:11,749 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:11,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:11,876 INFO L93 Difference]: Finished difference Result 50 states and 74 transitions. [2022-02-20 16:36:11,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:36:11,876 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:36:11,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:36:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 16:36:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 16:36:11,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2022-02-20 16:36:11,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:36:12,000 INFO L225 Difference]: With dead ends: 50 [2022-02-20 16:36:12,001 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:36:12,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:36:12,008 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:36:12,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:36:12,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:36:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 16:36:12,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:36:12,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:12,036 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:12,037 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:12,045 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-02-20 16:36:12,045 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-02-20 16:36:12,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:12,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:12,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 16:36:12,048 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 16:36:12,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:12,057 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-02-20 16:36:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-02-20 16:36:12,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:12,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:12,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:36:12,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:36:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-02-20 16:36:12,066 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 11 [2022-02-20 16:36:12,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:36:12,066 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-02-20 16:36:12,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:12,067 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-02-20 16:36:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:36:12,067 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:36:12,068 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:36:12,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:36:12,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:36:12,300 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:36:12,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:36:12,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1606884976, now seen corresponding path program 1 times [2022-02-20 16:36:12,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:36:12,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825269684] [2022-02-20 16:36:12,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:36:12,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:36:12,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:36:12,304 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:36:12,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:36:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:12,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:36:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:12,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:36:12,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {193#true} is VALID [2022-02-20 16:36:12,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_round_double } true;round_double_#in~x#1 := main_~x~0#1;havoc round_double_#res#1;havoc round_double_#t~mem4#1, round_double_#t~mem5#1, round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, round_double_~exponent_mask~0#1, round_double_~exponent_mask~1#1, round_double_~tmp~0#1, round_double_#t~mem6#1, round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset, round_double_~x#1, round_double_~msw~0#1, round_double_~exponent_less_1023~0#1, round_double_~lsw~0#1;round_double_~x#1 := round_double_#in~x#1;havoc round_double_~msw~0#1;havoc round_double_~exponent_less_1023~0#1;havoc round_double_~lsw~0#1; {201#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:36:12,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {201#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} call round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(round_double_~x#1, round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, 8bv32);call round_double_#t~mem4#1 := read~intINTTYPE4(round_double_~#ew_u~0#1.base, ~bvadd32(4bv32, round_double_~#ew_u~0#1.offset), 4bv32);round_double_~msw~0#1 := round_double_#t~mem4#1;havoc round_double_#t~mem4#1;call round_double_#t~mem5#1 := read~intINTTYPE4(round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, 4bv32);round_double_~lsw~0#1 := round_double_#t~mem5#1;havoc round_double_#t~mem5#1;call ULTIMATE.dealloc(round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset);havoc round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset; {201#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:36:12,556 INFO L290 TraceCheckUtils]: 3: Hoare triple {201#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} goto; {201#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:36:12,556 INFO L290 TraceCheckUtils]: 4: Hoare triple {201#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} round_double_~exponent_less_1023~0#1 := ~bvsub32(~bvashr32(~bvand32(2146435072bv32, round_double_~msw~0#1), 20bv32), 1023bv32); {201#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:36:12,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {201#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume ~bvslt32(round_double_~exponent_less_1023~0#1, 20bv32); {201#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:36:12,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume !~bvslt32(round_double_~exponent_less_1023~0#1, 0bv32);round_double_~exponent_mask~0#1 := ~bvashr32(1048575bv32, round_double_~exponent_less_1023~0#1); {201#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:36:12,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {201#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume 0bv32 == ~bvand32(round_double_~msw~0#1, round_double_~exponent_mask~0#1) && 0bv32 == round_double_~lsw~0#1;round_double_#res#1 := round_double_~x#1; {220#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_round_double_#res#1|))} is VALID [2022-02-20 16:36:12,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {220#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_round_double_#res#1|))} main_#t~ret7#1 := round_double_#res#1;assume { :end_inline_round_double } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {224#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} is VALID [2022-02-20 16:36:12,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} main_#t~ret8#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {228#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} is VALID [2022-02-20 16:36:12,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {228#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {194#false} is VALID [2022-02-20 16:36:12,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {194#false} assume !false; {194#false} is VALID [2022-02-20 16:36:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:36:12,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:36:12,563 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:36:12,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825269684] [2022-02-20 16:36:12,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825269684] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:36:12,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:36:12,564 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:36:12,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280392139] [2022-02-20 16:36:12,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:36:12,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:36:12,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:36:12,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:12,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:36:12,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:36:12,587 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:36:12,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:36:12,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:36:12,588 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:12,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:12,831 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-02-20 16:36:12,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:36:12,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:36:12,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:36:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-20 16:36:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-20 16:36:12,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-02-20 16:36:12,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:36:12,907 INFO L225 Difference]: With dead ends: 28 [2022-02-20 16:36:12,908 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:36:12,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:36:12,913 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:36:12,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 92 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-02-20 16:36:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:36:12,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 16:36:12,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:36:12,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:12,917 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:12,918 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:12,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:12,919 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-02-20 16:36:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-02-20 16:36:12,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:12,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:12,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 16:36:12,919 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 16:36:12,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:12,920 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-02-20 16:36:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-02-20 16:36:12,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:12,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:12,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:36:12,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:36:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-02-20 16:36:12,921 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-02-20 16:36:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:36:12,921 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-02-20 16:36:12,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-02-20 16:36:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:36:12,922 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:36:12,922 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:36:12,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:36:13,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:36:13,124 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:36:13,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:36:13,125 INFO L85 PathProgramCache]: Analyzing trace with hash -504732444, now seen corresponding path program 1 times [2022-02-20 16:36:13,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:36:13,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769196227] [2022-02-20 16:36:13,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:36:13,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:36:13,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:36:13,127 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:36:13,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:36:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:13,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:36:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:13,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:36:13,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {341#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {341#true} is VALID [2022-02-20 16:36:13,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {341#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_round_double } true;round_double_#in~x#1 := main_~x~0#1;havoc round_double_#res#1;havoc round_double_#t~mem4#1, round_double_#t~mem5#1, round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, round_double_~exponent_mask~0#1, round_double_~exponent_mask~1#1, round_double_~tmp~0#1, round_double_#t~mem6#1, round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset, round_double_~x#1, round_double_~msw~0#1, round_double_~exponent_less_1023~0#1, round_double_~lsw~0#1;round_double_~x#1 := round_double_#in~x#1;havoc round_double_~msw~0#1;havoc round_double_~exponent_less_1023~0#1;havoc round_double_~lsw~0#1; {349#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:36:13,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {349#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} call round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(round_double_~x#1, round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, 8bv32);call round_double_#t~mem4#1 := read~intINTTYPE4(round_double_~#ew_u~0#1.base, ~bvadd32(4bv32, round_double_~#ew_u~0#1.offset), 4bv32);round_double_~msw~0#1 := round_double_#t~mem4#1;havoc round_double_#t~mem4#1;call round_double_#t~mem5#1 := read~intINTTYPE4(round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, 4bv32);round_double_~lsw~0#1 := round_double_#t~mem5#1;havoc round_double_#t~mem5#1;call ULTIMATE.dealloc(round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset);havoc round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset; {349#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:36:13,347 INFO L290 TraceCheckUtils]: 3: Hoare triple {349#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} goto; {349#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:36:13,347 INFO L290 TraceCheckUtils]: 4: Hoare triple {349#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} round_double_~exponent_less_1023~0#1 := ~bvsub32(~bvashr32(~bvand32(2146435072bv32, round_double_~msw~0#1), 20bv32), 1023bv32); {349#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:36:13,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {349#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume !~bvslt32(round_double_~exponent_less_1023~0#1, 20bv32); {349#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:36:13,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {349#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume !~bvsgt32(round_double_~exponent_less_1023~0#1, 51bv32);round_double_~exponent_mask~1#1 := ~bvlshr32(4294967295bv32, ~bvsub32(round_double_~exponent_less_1023~0#1, 20bv32));havoc round_double_~tmp~0#1; {349#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:36:13,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {349#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume 0bv32 == ~bvand32(round_double_~lsw~0#1, round_double_~exponent_mask~1#1);round_double_#res#1 := round_double_~x#1; {368#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_round_double_#res#1|))} is VALID [2022-02-20 16:36:13,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {368#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_round_double_#res#1|))} main_#t~ret7#1 := round_double_#res#1;assume { :end_inline_round_double } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {372#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} is VALID [2022-02-20 16:36:13,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {372#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} main_#t~ret8#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {376#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} is VALID [2022-02-20 16:36:13,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {342#false} is VALID [2022-02-20 16:36:13,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {342#false} assume !false; {342#false} is VALID [2022-02-20 16:36:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:36:13,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:36:13,353 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:36:13,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769196227] [2022-02-20 16:36:13,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769196227] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:36:13,353 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:36:13,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:36:13,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775330099] [2022-02-20 16:36:13,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:36:13,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:36:13,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:36:13,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:13,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:36:13,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:36:13,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:36:13,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:36:13,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:36:13,375 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:13,605 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-20 16:36:13,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:36:13,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:36:13,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:36:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-02-20 16:36:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-02-20 16:36:13,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-02-20 16:36:13,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:36:13,676 INFO L225 Difference]: With dead ends: 28 [2022-02-20 16:36:13,676 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:36:13,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:36:13,677 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:36:13,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 94 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 11 Unchecked, 0.0s Time] [2022-02-20 16:36:13,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:36:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 16:36:13,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:36:13,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:13,680 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:13,680 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:13,681 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-02-20 16:36:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-20 16:36:13,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:13,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:13,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 16:36:13,682 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 16:36:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:13,683 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-02-20 16:36:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-20 16:36:13,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:13,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:13,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:36:13,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:36:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-02-20 16:36:13,684 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 12 [2022-02-20 16:36:13,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:36:13,684 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-02-20 16:36:13,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:13,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-02-20 16:36:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:36:13,685 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:36:13,685 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:36:13,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:36:13,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:36:13,886 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:36:13,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:36:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash -711601148, now seen corresponding path program 1 times [2022-02-20 16:36:13,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:36:13,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802005682] [2022-02-20 16:36:13,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:36:13,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:36:13,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:36:13,895 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:36:13,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:36:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:13,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:36:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:13,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:36:14,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {489#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {494#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:36:14,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {494#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_round_double } true;round_double_#in~x#1 := main_~x~0#1;havoc round_double_#res#1;havoc round_double_#t~mem4#1, round_double_#t~mem5#1, round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, round_double_~exponent_mask~0#1, round_double_~exponent_mask~1#1, round_double_~tmp~0#1, round_double_#t~mem6#1, round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset, round_double_~x#1, round_double_~msw~0#1, round_double_~exponent_less_1023~0#1, round_double_~lsw~0#1;round_double_~x#1 := round_double_#in~x#1;havoc round_double_~msw~0#1;havoc round_double_~exponent_less_1023~0#1;havoc round_double_~lsw~0#1; {498#(and (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:36:14,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {498#(and (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} call round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(round_double_~x#1, round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, 8bv32);call round_double_#t~mem4#1 := read~intINTTYPE4(round_double_~#ew_u~0#1.base, ~bvadd32(4bv32, round_double_~#ew_u~0#1.offset), 4bv32);round_double_~msw~0#1 := round_double_#t~mem4#1;havoc round_double_#t~mem4#1;call round_double_#t~mem5#1 := read~intINTTYPE4(round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, 4bv32);round_double_~lsw~0#1 := round_double_#t~mem5#1;havoc round_double_#t~mem5#1;call ULTIMATE.dealloc(round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset);havoc round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset; {498#(and (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:36:14,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {498#(and (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} goto; {498#(and (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:36:14,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {498#(and (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} round_double_~exponent_less_1023~0#1 := ~bvsub32(~bvashr32(~bvand32(2146435072bv32, round_double_~msw~0#1), 20bv32), 1023bv32); {498#(and (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:36:14,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {498#(and (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} assume !~bvslt32(round_double_~exponent_less_1023~0#1, 20bv32); {498#(and (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:36:14,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {498#(and (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvsgt32(round_double_~exponent_less_1023~0#1, 51bv32); {498#(and (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:36:14,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {498#(and (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} assume 1024bv32 == round_double_~exponent_less_1023~0#1;round_double_#res#1 := ~fp.add~DOUBLE(currentRoundingMode, round_double_~x#1, round_double_~x#1); {517#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) |ULTIMATE.start_round_double_#res#1|)} is VALID [2022-02-20 16:36:14,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {517#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) |ULTIMATE.start_round_double_#res#1|)} main_#t~ret7#1 := round_double_#res#1;assume { :end_inline_round_double } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {521#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} is VALID [2022-02-20 16:36:14,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {521#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} main_#t~ret8#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {525#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} is VALID [2022-02-20 16:36:14,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {525#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {490#false} is VALID [2022-02-20 16:36:14,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {490#false} assume !false; {490#false} is VALID [2022-02-20 16:36:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:36:14,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:36:14,121 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:36:14,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802005682] [2022-02-20 16:36:14,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802005682] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:36:14,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:36:14,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:36:14,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676321195] [2022-02-20 16:36:14,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:36:14,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:36:14,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:36:14,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:14,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:36:14,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:36:14,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:36:14,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:36:14,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:36:14,156 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:14,473 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-02-20 16:36:14,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:36:14,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:36:14,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:36:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-02-20 16:36:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-02-20 16:36:14,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-02-20 16:36:14,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:36:14,536 INFO L225 Difference]: With dead ends: 28 [2022-02-20 16:36:14,536 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:36:14,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:36:14,537 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 48 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:36:14,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 92 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:36:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:36:14,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:36:14,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:36:14,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:14,539 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:14,539 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:14,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:14,540 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 16:36:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 16:36:14,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:14,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:14,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 16:36:14,540 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 16:36:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:14,541 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 16:36:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 16:36:14,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:14,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:14,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:36:14,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:36:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-02-20 16:36:14,543 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2022-02-20 16:36:14,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:36:14,543 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-02-20 16:36:14,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 16:36:14,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:36:14,544 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:36:14,544 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:36:14,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:36:14,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:36:14,753 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:36:14,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:36:14,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1251020519, now seen corresponding path program 1 times [2022-02-20 16:36:14,753 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:36:14,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157800430] [2022-02-20 16:36:14,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:36:14,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:36:14,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:36:14,755 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:36:14,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:36:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:14,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:36:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:14,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:36:15,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {639#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {639#true} is VALID [2022-02-20 16:36:15,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {639#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_round_double } true;round_double_#in~x#1 := main_~x~0#1;havoc round_double_#res#1;havoc round_double_#t~mem4#1, round_double_#t~mem5#1, round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, round_double_~exponent_mask~0#1, round_double_~exponent_mask~1#1, round_double_~tmp~0#1, round_double_#t~mem6#1, round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset, round_double_~x#1, round_double_~msw~0#1, round_double_~exponent_less_1023~0#1, round_double_~lsw~0#1;round_double_~x#1 := round_double_#in~x#1;havoc round_double_~msw~0#1;havoc round_double_~exponent_less_1023~0#1;havoc round_double_~lsw~0#1; {647#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:36:15,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {647#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} call round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(round_double_~x#1, round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, 8bv32);call round_double_#t~mem4#1 := read~intINTTYPE4(round_double_~#ew_u~0#1.base, ~bvadd32(4bv32, round_double_~#ew_u~0#1.offset), 4bv32);round_double_~msw~0#1 := round_double_#t~mem4#1;havoc round_double_#t~mem4#1;call round_double_#t~mem5#1 := read~intINTTYPE4(round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, 4bv32);round_double_~lsw~0#1 := round_double_#t~mem5#1;havoc round_double_#t~mem5#1;call ULTIMATE.dealloc(round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset);havoc round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset; {651#(exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) |ULTIMATE.start_round_double_~msw~0#1|)))} is VALID [2022-02-20 16:36:15,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {651#(exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) |ULTIMATE.start_round_double_~msw~0#1|)))} goto; {651#(exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) |ULTIMATE.start_round_double_~msw~0#1|)))} is VALID [2022-02-20 16:36:15,014 INFO L290 TraceCheckUtils]: 4: Hoare triple {651#(exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) |ULTIMATE.start_round_double_~msw~0#1|)))} round_double_~exponent_less_1023~0#1 := ~bvsub32(~bvashr32(~bvand32(2146435072bv32, round_double_~msw~0#1), 20bv32), 1023bv32); {658#(exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= |ULTIMATE.start_round_double_~exponent_less_1023~0#1| (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) (_ bv20 32)) (_ bv4294966273 32)))))} is VALID [2022-02-20 16:36:15,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#(exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= |ULTIMATE.start_round_double_~exponent_less_1023~0#1| (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) (_ bv20 32)) (_ bv4294966273 32)))))} assume ~bvslt32(round_double_~exponent_less_1023~0#1, 20bv32); {640#false} is VALID [2022-02-20 16:36:15,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {640#false} assume !~bvslt32(round_double_~exponent_less_1023~0#1, 0bv32);round_double_~exponent_mask~0#1 := ~bvashr32(1048575bv32, round_double_~exponent_less_1023~0#1); {640#false} is VALID [2022-02-20 16:36:15,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {640#false} assume !(0bv32 == ~bvand32(round_double_~msw~0#1, round_double_~exponent_mask~0#1) && 0bv32 == round_double_~lsw~0#1);round_double_~msw~0#1 := ~bvadd32(round_double_~msw~0#1, ~bvashr32(524288bv32, round_double_~exponent_less_1023~0#1));round_double_~msw~0#1 := ~bvand32(round_double_~msw~0#1, ~bvnot32(round_double_~exponent_mask~0#1));round_double_~lsw~0#1 := 0bv32; {640#false} is VALID [2022-02-20 16:36:15,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {640#false} call round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(round_double_~msw~0#1, round_double_~#iw_u~0#1.base, ~bvadd32(4bv32, round_double_~#iw_u~0#1.offset), 4bv32);call write~intINTTYPE4(round_double_~lsw~0#1, round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset, 4bv32);call round_double_#t~mem6#1 := read~intFLOATTYPE8(round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset, 8bv32);round_double_~x#1 := round_double_#t~mem6#1;havoc round_double_#t~mem6#1;call ULTIMATE.dealloc(round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset);havoc round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset; {640#false} is VALID [2022-02-20 16:36:15,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {640#false} goto; {640#false} is VALID [2022-02-20 16:36:15,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {640#false} round_double_#res#1 := round_double_~x#1; {640#false} is VALID [2022-02-20 16:36:15,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {640#false} main_#t~ret7#1 := round_double_#res#1;assume { :end_inline_round_double } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {640#false} is VALID [2022-02-20 16:36:15,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {640#false} main_#t~ret8#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {640#false} is VALID [2022-02-20 16:36:15,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {640#false} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {640#false} is VALID [2022-02-20 16:36:15,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {640#false} assume !false; {640#false} is VALID [2022-02-20 16:36:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:36:15,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:36:15,019 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:36:15,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157800430] [2022-02-20 16:36:15,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157800430] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:36:15,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:36:15,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:36:15,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412940088] [2022-02-20 16:36:15,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:36:15,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:36:15,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:36:15,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:36:15,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:36:15,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:36:15,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:36:15,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:36:15,044 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:15,146 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 16:36:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:36:15,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:36:15,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:36:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-02-20 16:36:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-02-20 16:36:15,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-02-20 16:36:15,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:36:15,185 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:36:15,185 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 16:36:15,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:36:15,186 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:36:15,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 11 Unchecked, 0.0s Time] [2022-02-20 16:36:15,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 16:36:15,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 16:36:15,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:36:15,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,188 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,188 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:15,188 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 16:36:15,188 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 16:36:15,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:15,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:15,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 16:36:15,188 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 16:36:15,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:15,189 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 16:36:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 16:36:15,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:15,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:15,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:36:15,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:36:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-02-20 16:36:15,190 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2022-02-20 16:36:15,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:36:15,190 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-02-20 16:36:15,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,190 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-02-20 16:36:15,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:36:15,191 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:36:15,191 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:36:15,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-02-20 16:36:15,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:36:15,399 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:36:15,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:36:15,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1960511871, now seen corresponding path program 1 times [2022-02-20 16:36:15,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:36:15,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546030588] [2022-02-20 16:36:15,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:36:15,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:36:15,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:36:15,401 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:36:15,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:36:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:15,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:36:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:15,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:36:15,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {780#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {780#true} is VALID [2022-02-20 16:36:15,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {780#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_round_double } true;round_double_#in~x#1 := main_~x~0#1;havoc round_double_#res#1;havoc round_double_#t~mem4#1, round_double_#t~mem5#1, round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, round_double_~exponent_mask~0#1, round_double_~exponent_mask~1#1, round_double_~tmp~0#1, round_double_#t~mem6#1, round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset, round_double_~x#1, round_double_~msw~0#1, round_double_~exponent_less_1023~0#1, round_double_~lsw~0#1;round_double_~x#1 := round_double_#in~x#1;havoc round_double_~msw~0#1;havoc round_double_~exponent_less_1023~0#1;havoc round_double_~lsw~0#1; {788#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:36:15,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} call round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(round_double_~x#1, round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, 8bv32);call round_double_#t~mem4#1 := read~intINTTYPE4(round_double_~#ew_u~0#1.base, ~bvadd32(4bv32, round_double_~#ew_u~0#1.offset), 4bv32);round_double_~msw~0#1 := round_double_#t~mem4#1;havoc round_double_#t~mem4#1;call round_double_#t~mem5#1 := read~intINTTYPE4(round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset, 4bv32);round_double_~lsw~0#1 := round_double_#t~mem5#1;havoc round_double_#t~mem5#1;call ULTIMATE.dealloc(round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset);havoc round_double_~#ew_u~0#1.base, round_double_~#ew_u~0#1.offset; {792#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) |ULTIMATE.start_round_double_~msw~0#1|)))} is VALID [2022-02-20 16:36:15,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {792#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) |ULTIMATE.start_round_double_~msw~0#1|)))} goto; {792#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) |ULTIMATE.start_round_double_~msw~0#1|)))} is VALID [2022-02-20 16:36:15,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {792#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) |ULTIMATE.start_round_double_~msw~0#1|)))} round_double_~exponent_less_1023~0#1 := ~bvsub32(~bvashr32(~bvand32(2146435072bv32, round_double_~msw~0#1), 20bv32), 1023bv32); {799#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (bvadd (bvashr (bvand ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)) |ULTIMATE.start_round_double_~exponent_less_1023~0#1|)))} is VALID [2022-02-20 16:36:15,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {799#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (bvadd (bvashr (bvand ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)) |ULTIMATE.start_round_double_~exponent_less_1023~0#1|)))} assume !~bvslt32(round_double_~exponent_less_1023~0#1, 20bv32); {799#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (bvadd (bvashr (bvand ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)) |ULTIMATE.start_round_double_~exponent_less_1023~0#1|)))} is VALID [2022-02-20 16:36:15,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {799#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (bvadd (bvashr (bvand ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)) |ULTIMATE.start_round_double_~exponent_less_1023~0#1|)))} assume !~bvsgt32(round_double_~exponent_less_1023~0#1, 51bv32);round_double_~exponent_mask~1#1 := ~bvlshr32(4294967295bv32, ~bvsub32(round_double_~exponent_less_1023~0#1, 20bv32));havoc round_double_~tmp~0#1; {781#false} is VALID [2022-02-20 16:36:15,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#false} assume !(0bv32 == ~bvand32(round_double_~lsw~0#1, round_double_~exponent_mask~1#1));round_double_~tmp~0#1 := ~bvadd32(round_double_~lsw~0#1, ~bvshl32(1bv32, ~bvsub32(51bv32, round_double_~exponent_less_1023~0#1))); {781#false} is VALID [2022-02-20 16:36:15,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {781#false} assume ~bvult32(round_double_~tmp~0#1, round_double_~lsw~0#1);round_double_~msw~0#1 := ~bvadd32(1bv32, round_double_~msw~0#1); {781#false} is VALID [2022-02-20 16:36:15,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#false} round_double_~lsw~0#1 := round_double_~tmp~0#1;round_double_~lsw~0#1 := ~bvand32(round_double_~lsw~0#1, ~bvnot32(round_double_~exponent_mask~1#1)); {781#false} is VALID [2022-02-20 16:36:15,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {781#false} call round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(round_double_~msw~0#1, round_double_~#iw_u~0#1.base, ~bvadd32(4bv32, round_double_~#iw_u~0#1.offset), 4bv32);call write~intINTTYPE4(round_double_~lsw~0#1, round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset, 4bv32);call round_double_#t~mem6#1 := read~intFLOATTYPE8(round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset, 8bv32);round_double_~x#1 := round_double_#t~mem6#1;havoc round_double_#t~mem6#1;call ULTIMATE.dealloc(round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset);havoc round_double_~#iw_u~0#1.base, round_double_~#iw_u~0#1.offset; {781#false} is VALID [2022-02-20 16:36:15,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {781#false} goto; {781#false} is VALID [2022-02-20 16:36:15,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {781#false} round_double_#res#1 := round_double_~x#1; {781#false} is VALID [2022-02-20 16:36:15,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {781#false} main_#t~ret7#1 := round_double_#res#1;assume { :end_inline_round_double } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {781#false} is VALID [2022-02-20 16:36:15,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {781#false} main_#t~ret8#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {781#false} is VALID [2022-02-20 16:36:15,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {781#false} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {781#false} is VALID [2022-02-20 16:36:15,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {781#false} assume !false; {781#false} is VALID [2022-02-20 16:36:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:36:15,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:36:15,680 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:36:15,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546030588] [2022-02-20 16:36:15,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546030588] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:36:15,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:36:15,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:36:15,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000673672] [2022-02-20 16:36:15,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:36:15,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 16:36:15,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:36:15,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:36:15,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:36:15,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:36:15,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:36:15,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:36:15,703 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:15,723 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 16:36:15,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:36:15,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 16:36:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:36:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-02-20 16:36:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-02-20 16:36:15,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2022-02-20 16:36:15,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:36:15,748 INFO L225 Difference]: With dead ends: 18 [2022-02-20 16:36:15,748 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:36:15,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:36:15,749 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:36:15,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-02-20 16:36:15,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:36:15,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:36:15,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:36:15,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,750 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,750 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:15,750 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:36:15,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:36:15,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:15,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:15,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:36:15,750 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:36:15,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:15,752 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:36:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:36:15,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:15,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:15,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:36:15,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:36:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:36:15,752 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-02-20 16:36:15,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:36:15,752 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:36:15,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:36:15,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:15,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:36:15,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:36:15,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:36:15,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:36:16,000 INFO L861 garLoopResultBuilder]: At program point L85(lines 68 86) the Hoare annotation is: true [2022-02-20 16:36:16,000 INFO L858 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2022-02-20 16:36:16,000 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 47) no Hoare annotation was computed. [2022-02-20 16:36:16,000 INFO L854 garLoopResultBuilder]: At program point L65(lines 19 66) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_round_double_#res#1|)) [2022-02-20 16:36:16,000 INFO L858 garLoopResultBuilder]: For program point L32(lines 32 33) no Hoare annotation was computed. [2022-02-20 16:36:16,000 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:36:16,000 INFO L858 garLoopResultBuilder]: For program point L32-2(lines 32 33) no Hoare annotation was computed. [2022-02-20 16:36:16,000 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:36:16,000 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:36:16,000 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2022-02-20 16:36:16,000 INFO L858 garLoopResultBuilder]: For program point L37(lines 37 38) no Hoare annotation was computed. [2022-02-20 16:36:16,000 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:36:16,000 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 58) no Hoare annotation was computed. [2022-02-20 16:36:16,000 INFO L858 garLoopResultBuilder]: For program point L54(lines 54 55) no Hoare annotation was computed. [2022-02-20 16:36:16,000 INFO L858 garLoopResultBuilder]: For program point L54-2(lines 54 55) no Hoare annotation was computed. [2022-02-20 16:36:16,000 INFO L854 garLoopResultBuilder]: At program point L17(line 17) the Hoare annotation is: (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|) [2022-02-20 16:36:16,001 INFO L858 garLoopResultBuilder]: For program point L30(lines 30 42) no Hoare annotation was computed. [2022-02-20 16:36:16,001 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 64) no Hoare annotation was computed. [2022-02-20 16:36:16,001 INFO L858 garLoopResultBuilder]: For program point L59-1(lines 19 66) no Hoare annotation was computed. [2022-02-20 16:36:16,001 INFO L858 garLoopResultBuilder]: For program point L59-2(lines 59 64) no Hoare annotation was computed. [2022-02-20 16:36:16,001 INFO L858 garLoopResultBuilder]: For program point L22-1(lines 22 27) no Hoare annotation was computed. [2022-02-20 16:36:16,001 INFO L854 garLoopResultBuilder]: At program point L22-2(lines 22 27) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_round_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:36:16,001 INFO L858 garLoopResultBuilder]: For program point L22-3(lines 22 27) no Hoare annotation was computed. [2022-02-20 16:36:16,001 INFO L858 garLoopResultBuilder]: For program point L51(lines 51 52) no Hoare annotation was computed. [2022-02-20 16:36:16,001 INFO L858 garLoopResultBuilder]: For program point L80(lines 80 83) no Hoare annotation was computed. [2022-02-20 16:36:16,001 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 58) no Hoare annotation was computed. [2022-02-20 16:36:16,003 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 16:36:16,004 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:36:16,006 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:36:16,008 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:36:16,008 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:36:16,008 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-02-20 16:36:16,008 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:36:16,008 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:36:16,008 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-02-20 16:36:16,008 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:36:16,008 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:36:16,008 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:36:16,008 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:36:16,008 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:36:16,008 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:36:16,009 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 16:36:16,009 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 16:36:16,009 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:36:16,009 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:36:16,009 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:36:16,009 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:36:16,009 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:36:16,009 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:36:16,009 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-02-20 16:36:16,015 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-02-20 16:36:16,015 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-02-20 16:36:16,015 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:36:16,015 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:36:16,015 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:36:16,015 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 16:36:16,015 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 16:36:16,015 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2022-02-20 16:36:16,015 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2022-02-20 16:36:16,015 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:36:16,015 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:36:16,015 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:36:16,015 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:36:16,015 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:36:16,015 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:36:16,015 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. [2022-02-20 16:36:16,021 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:36:16,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:36:16,022 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:36:16,022 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:36:16,022 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:36:16,022 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:36:16,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:36:16 BoogieIcfgContainer [2022-02-20 16:36:16,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:36:16,023 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:36:16,023 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:36:16,023 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:36:16,023 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:36:11" (3/4) ... [2022-02-20 16:36:16,026 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:36:16,042 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-02-20 16:36:16,042 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-20 16:36:16,042 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:36:16,043 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:36:16,058 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:36:16,058 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == \result) [2022-02-20 16:36:16,059 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 1bv32 == \result [2022-02-20 16:36:16,065 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:36:16,065 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:36:16,066 INFO L158 Benchmark]: Toolchain (without parser) took 5287.13ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 41.2MB in the beginning and 53.4MB in the end (delta: -12.2MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2022-02-20 16:36:16,066 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 49.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:36:16,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.78ms. Allocated memory is still 60.8MB. Free memory was 41.1MB in the beginning and 42.5MB in the end (delta: -1.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:36:16,067 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.55ms. Allocated memory is still 60.8MB. Free memory was 42.5MB in the beginning and 40.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:36:16,067 INFO L158 Benchmark]: Boogie Preprocessor took 54.07ms. Allocated memory is still 60.8MB. Free memory was 40.4MB in the beginning and 38.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:36:16,067 INFO L158 Benchmark]: RCFGBuilder took 269.39ms. Allocated memory is still 60.8MB. Free memory was 38.6MB in the beginning and 25.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:36:16,067 INFO L158 Benchmark]: TraceAbstraction took 4592.42ms. Allocated memory is still 73.4MB. Free memory was 56.3MB in the beginning and 24.8MB in the end (delta: 31.5MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2022-02-20 16:36:16,068 INFO L158 Benchmark]: Witness Printer took 42.52ms. Allocated memory is still 73.4MB. Free memory was 24.5MB in the beginning and 53.4MB in the end (delta: -28.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:36:16,069 INFO L339 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.15ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 49.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.78ms. Allocated memory is still 60.8MB. Free memory was 41.1MB in the beginning and 42.5MB in the end (delta: -1.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.55ms. Allocated memory is still 60.8MB. Free memory was 42.5MB in the beginning and 40.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.07ms. Allocated memory is still 60.8MB. Free memory was 40.4MB in the beginning and 38.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 269.39ms. Allocated memory is still 60.8MB. Free memory was 38.6MB in the beginning and 25.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4592.42ms. Allocated memory is still 73.4MB. Free memory was 56.3MB in the beginning and 24.8MB in the end (delta: 31.5MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * Witness Printer took 42.52ms. Allocated memory is still 73.4MB. Free memory was 24.5MB in the beginning and 53.4MB in the end (delta: -28.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[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: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 81]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 369 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 39 IncrementalHoareTripleChecker+Unchecked, 250 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 119 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 10 NumberOfFragments, 22 HoareAnnotationTreeSize, 4 FomulaSimplifications, 26 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 29 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 73 ConstructedInterpolants, 23 QuantifiedInterpolants, 385 SizeOfPredicates, 41 NumberOfNonLiveVariables, 295 ConjunctsInSsa, 53 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1bv32 == \result - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant [2022-02-20 16:36:16,075 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:36:16,075 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:36:16,075 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:36:16,075 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 19]: Loop Invariant [2022-02-20 16:36:16,075 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:36:16,076 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == \result) RESULT: Ultimate proved your program to be correct! [2022-02-20 16:36:16,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE