./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1071.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/float_req_bl_1071.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 55d78fe353fd0931b2d447fd45670a80ea73f6385110d8a7ff7bce3171c541bd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:07,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:07,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:07,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:07,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:07,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:07,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:07,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:07,097 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:07,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:07,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:07,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:07,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:07,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:07,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:07,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:07,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:07,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:07,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:07,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:07,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:07,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:07,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:07,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:07,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:07,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:07,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:07,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:07,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:07,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:07,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:07,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:07,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:07,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:07,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:07,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:07,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:07,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:07,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:07,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:07,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:07,132 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:46:07,160 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:07,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:07,161 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:07,161 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:07,162 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:07,162 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:07,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:07,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:07,162 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:07,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:07,163 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:07,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:07,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:07,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:07,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:07,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:07,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:07,164 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:07,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:07,165 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:07,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:07,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:07,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:07,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:07,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:07,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:07,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:07,167 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:07,167 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:07,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:07,167 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:07,167 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:07,168 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:07,168 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 -> 55d78fe353fd0931b2d447fd45670a80ea73f6385110d8a7ff7bce3171c541bd [2022-02-20 16:46:07,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:07,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:07,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:07,355 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:07,366 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:07,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1071.c [2022-02-20 16:46:07,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a274a84e0/a5b998bc2f85427fb5f4f5bc1673cf8f/FLAG87ab16f0f [2022-02-20 16:46:07,740 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:07,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1071.c [2022-02-20 16:46:07,745 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a274a84e0/a5b998bc2f85427fb5f4f5bc1673cf8f/FLAG87ab16f0f [2022-02-20 16:46:07,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a274a84e0/a5b998bc2f85427fb5f4f5bc1673cf8f [2022-02-20 16:46:07,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:07,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:07,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:07,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:07,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:07,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:07" (1/1) ... [2022-02-20 16:46:07,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19e1207d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:07, skipping insertion in model container [2022-02-20 16:46:07,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:07" (1/1) ... [2022-02-20 16:46:07,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:07,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:07,921 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/float_req_bl_1071.c[1429,1442] [2022-02-20 16:46:07,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:07,928 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:07,943 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/float_req_bl_1071.c[1429,1442] [2022-02-20 16:46:07,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:07,954 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:07,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:07 WrapperNode [2022-02-20 16:46:07,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:07,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:07,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:07,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:07,960 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:46:07" (1/1) ... [2022-02-20 16:46:07,966 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:46:07" (1/1) ... [2022-02-20 16:46:08,008 INFO L137 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 85 [2022-02-20 16:46:08,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:08,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:08,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:08,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:08,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:07" (1/1) ... [2022-02-20 16:46:08,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:07" (1/1) ... [2022-02-20 16:46:08,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:07" (1/1) ... [2022-02-20 16:46:08,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:07" (1/1) ... [2022-02-20 16:46:08,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:07" (1/1) ... [2022-02-20 16:46:08,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:07" (1/1) ... [2022-02-20 16:46:08,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:07" (1/1) ... [2022-02-20 16:46:08,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:08,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:08,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:08,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:08,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:07" (1/1) ... [2022-02-20 16:46:08,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:08,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:08,065 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:46:08,070 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:46:08,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:08,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:08,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:08,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:08,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:08,142 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:08,143 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:08,404 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:08,409 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:08,409 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:46:08,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:08 BoogieIcfgContainer [2022-02-20 16:46:08,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:08,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:08,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:08,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:08,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:07" (1/3) ... [2022-02-20 16:46:08,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d7aff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:08, skipping insertion in model container [2022-02-20 16:46:08,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:07" (2/3) ... [2022-02-20 16:46:08,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d7aff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:08, skipping insertion in model container [2022-02-20 16:46:08,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:08" (3/3) ... [2022-02-20 16:46:08,417 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1071.c [2022-02-20 16:46:08,421 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:08,421 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:08,454 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:08,459 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:46:08,459 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:08,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 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:46:08,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:08,473 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:08,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:08,474 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:08,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:08,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1236241859, now seen corresponding path program 1 times [2022-02-20 16:46:08,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:08,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845689707] [2022-02-20 16:46:08,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:08,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:08,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#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(20, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-02-20 16:46:08,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline_trunc_float } true;trunc_float_#in~x#1 := main_~x~0#1;havoc trunc_float_#res#1;havoc trunc_float_#t~mem4#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, trunc_float_#t~mem6#1, trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset, trunc_float_#t~mem7#1, trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset, trunc_float_~x#1, trunc_float_~signbit~0#1, trunc_float_~w~0#1, trunc_float_~exponent_less_127~0#1, trunc_float_#t~nondet5#1;trunc_float_~x#1 := trunc_float_#in~x#1;havoc trunc_float_~signbit~0#1;havoc trunc_float_~w~0#1;havoc trunc_float_~exponent_less_127~0#1; {28#true} is VALID [2022-02-20 16:46:08,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-02-20 16:46:08,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {29#false} assume 0 == trunc_float_~w~0#1;trunc_float_~signbit~0#1 := 0; {29#false} is VALID [2022-02-20 16:46:08,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {29#false} trunc_float_~exponent_less_127~0#1 := (if 0 == trunc_float_~w~0#1 then 0 else (if 1 == trunc_float_~w~0#1 then 0 else ~bitwiseAnd(trunc_float_~w~0#1, 2139095040))) / 8388608 - 127; {29#false} is VALID [2022-02-20 16:46:08,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#false} assume !(trunc_float_~exponent_less_127~0#1 < 23); {29#false} is VALID [2022-02-20 16:46:08,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#false} assume 255 == trunc_float_~exponent_less_127~0#1;trunc_float_#res#1 := ~someBinaryArithmeticFLOAToperation(trunc_float_~x#1, trunc_float_~x#1); {29#false} is VALID [2022-02-20 16:46:08,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} main_#t~ret8#1 := trunc_float_#res#1;assume { :end_inline_trunc_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {29#false} is VALID [2022-02-20 16:46:08,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647; {29#false} is VALID [2022-02-20 16:46:08,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} assume 0 == main_#t~ret9#1;havoc main_#t~ret9#1; {29#false} is VALID [2022-02-20 16:46:08,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 16:46:08,646 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:46:08,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:08,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845689707] [2022-02-20 16:46:08,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845689707] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:08,648 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:08,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:08,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401427943] [2022-02-20 16:46:08,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:08,655 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:46:08,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:08,660 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:46:08,688 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:46:08,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:08,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:08,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:08,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:08,709 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 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:46:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:08,762 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2022-02-20 16:46:08,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:08,762 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:46:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:08,764 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:46:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 16:46:08,776 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:46:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 16:46:08,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2022-02-20 16:46:08,863 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:46:08,874 INFO L225 Difference]: With dead ends: 48 [2022-02-20 16:46:08,875 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:46:08,877 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:46:08,879 INFO L933 BasicCegarLoop]: 29 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, 29 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:46:08,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:08,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:46:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:46:08,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:08,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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:46:08,900 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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:46:08,901 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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:46:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:08,908 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 16:46:08,908 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:46:08,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:08,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:08,909 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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:46:08,910 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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:46:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:08,913 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 16:46:08,913 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:46:08,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:08,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:08,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:08,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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:46:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-02-20 16:46:08,917 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 11 [2022-02-20 16:46:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:08,918 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-02-20 16:46:08,918 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:46:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:46:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:08,919 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:08,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:08,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:08,923 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1856162784, now seen corresponding path program 1 times [2022-02-20 16:46:08,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:08,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840251161] [2022-02-20 16:46:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:09,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#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(20, 2);call #Ultimate.allocInit(12, 3); {163#true} is VALID [2022-02-20 16:46:09,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline_trunc_float } true;trunc_float_#in~x#1 := main_~x~0#1;havoc trunc_float_#res#1;havoc trunc_float_#t~mem4#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, trunc_float_#t~mem6#1, trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset, trunc_float_#t~mem7#1, trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset, trunc_float_~x#1, trunc_float_~signbit~0#1, trunc_float_~w~0#1, trunc_float_~exponent_less_127~0#1, trunc_float_#t~nondet5#1;trunc_float_~x#1 := trunc_float_#in~x#1;havoc trunc_float_~signbit~0#1;havoc trunc_float_~w~0#1;havoc trunc_float_~exponent_less_127~0#1; {163#true} is VALID [2022-02-20 16:46:09,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} call trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~real(trunc_float_~x#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, 4);call trunc_float_#t~mem4#1 := read~int(trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, 4);trunc_float_~w~0#1 := (if trunc_float_#t~mem4#1 % 4294967296 % 4294967296 <= 2147483647 then trunc_float_#t~mem4#1 % 4294967296 % 4294967296 else trunc_float_#t~mem4#1 % 4294967296 % 4294967296 - 4294967296);havoc trunc_float_#t~mem4#1;call ULTIMATE.dealloc(trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset);havoc trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset; {163#true} is VALID [2022-02-20 16:46:09,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {163#true} goto; {163#true} is VALID [2022-02-20 16:46:09,034 INFO L290 TraceCheckUtils]: 4: Hoare triple {163#true} assume 0 == trunc_float_~w~0#1;trunc_float_~signbit~0#1 := 0; {165#(= |ULTIMATE.start_trunc_float_~w~0#1| 0)} is VALID [2022-02-20 16:46:09,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {165#(= |ULTIMATE.start_trunc_float_~w~0#1| 0)} trunc_float_~exponent_less_127~0#1 := (if 0 == trunc_float_~w~0#1 then 0 else (if 1 == trunc_float_~w~0#1 then 0 else ~bitwiseAnd(trunc_float_~w~0#1, 2139095040))) / 8388608 - 127; {166#(<= (+ 127 |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) 0)} is VALID [2022-02-20 16:46:09,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#(<= (+ 127 |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) 0)} assume !(trunc_float_~exponent_less_127~0#1 < 23); {166#(<= (+ 127 |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) 0)} is VALID [2022-02-20 16:46:09,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#(<= (+ 127 |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) 0)} assume 255 == trunc_float_~exponent_less_127~0#1;trunc_float_#res#1 := ~someBinaryArithmeticFLOAToperation(trunc_float_~x#1, trunc_float_~x#1); {164#false} is VALID [2022-02-20 16:46:09,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {164#false} main_#t~ret8#1 := trunc_float_#res#1;assume { :end_inline_trunc_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {164#false} is VALID [2022-02-20 16:46:09,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {164#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647; {164#false} is VALID [2022-02-20 16:46:09,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {164#false} assume 0 == main_#t~ret9#1;havoc main_#t~ret9#1; {164#false} is VALID [2022-02-20 16:46:09,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-02-20 16:46:09,037 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:46:09,038 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:09,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840251161] [2022-02-20 16:46:09,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840251161] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:09,038 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:09,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:46:09,039 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740577025] [2022-02-20 16:46:09,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:09,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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:46:09,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:09,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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:46:09,051 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:46:09,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:09,052 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:09,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:09,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:09,054 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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:46:09,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:09,151 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-02-20 16:46:09,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:46:09,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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:46:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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:46:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-02-20 16:46:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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:46:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-02-20 16:46:09,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2022-02-20 16:46:09,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:09,189 INFO L225 Difference]: With dead ends: 42 [2022-02-20 16:46:09,189 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 16:46:09,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:09,190 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:09,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 58 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:09,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 16:46:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2022-02-20 16:46:09,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:09,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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:46:09,194 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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:46:09,194 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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:46:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:09,195 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-20 16:46:09,196 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-02-20 16:46:09,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:09,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:09,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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 33 states. [2022-02-20 16:46:09,196 INFO L87 Difference]: Start difference. First operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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 33 states. [2022-02-20 16:46:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:09,198 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-20 16:46:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-02-20 16:46:09,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:09,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:09,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:09,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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:46:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-02-20 16:46:09,200 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 12 [2022-02-20 16:46:09,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:09,200 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-02-20 16:46:09,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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:46:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 16:46:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:09,201 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:09,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:09,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:09,202 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:09,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:09,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1128613167, now seen corresponding path program 1 times [2022-02-20 16:46:09,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:09,203 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914728913] [2022-02-20 16:46:09,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:09,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:09,230 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:09,263 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:09,263 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:09,264 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:09,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:46:09,268 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:46:09,270 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:09,286 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:09,286 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:09,286 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:46:09,286 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:46:09,286 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:09,286 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:09,287 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:46:09,287 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:46:09,287 WARN L170 areAnnotationChecker]: L21-7 has no Hoare annotation [2022-02-20 16:46:09,287 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:46:09,287 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:46:09,287 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:46:09,287 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:46:09,287 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:46:09,287 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:46:09,287 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:46:09,287 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:46:09,288 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:09,288 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:09,288 WARN L170 areAnnotationChecker]: L21-5 has no Hoare annotation [2022-02-20 16:46:09,288 WARN L170 areAnnotationChecker]: L21-5 has no Hoare annotation [2022-02-20 16:46:09,288 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-20 16:46:09,288 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-20 16:46:09,288 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-02-20 16:46:09,288 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-02-20 16:46:09,288 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:09,288 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 16:46:09,288 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:46:09,289 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:46:09,289 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:09,289 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:09,289 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:46:09,289 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-02-20 16:46:09,289 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-02-20 16:46:09,289 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 16:46:09,289 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 16:46:09,289 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 16:46:09,289 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:09,290 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:46:09,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:09 BoogieIcfgContainer [2022-02-20 16:46:09,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:09,291 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:09,291 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:09,291 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:09,291 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:08" (3/4) ... [2022-02-20 16:46:09,294 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:09,294 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:09,295 INFO L158 Benchmark]: Toolchain (without parser) took 1538.29ms. Allocated memory is still 134.2MB. Free memory was 105.6MB in the beginning and 81.1MB in the end (delta: 24.6MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2022-02-20 16:46:09,295 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory was 53.3MB in the beginning and 53.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:09,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.88ms. Allocated memory is still 134.2MB. Free memory was 105.6MB in the beginning and 108.1MB in the end (delta: -2.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:09,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.06ms. Allocated memory is still 134.2MB. Free memory was 108.1MB in the beginning and 104.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:09,296 INFO L158 Benchmark]: Boogie Preprocessor took 26.22ms. Allocated memory is still 134.2MB. Free memory was 104.4MB in the beginning and 102.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:09,296 INFO L158 Benchmark]: RCFGBuilder took 374.31ms. Allocated memory is still 134.2MB. Free memory was 102.4MB in the beginning and 82.8MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 16:46:09,297 INFO L158 Benchmark]: TraceAbstraction took 878.47ms. Allocated memory is still 134.2MB. Free memory was 82.3MB in the beginning and 81.9MB in the end (delta: 393.5kB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:09,297 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 134.2MB. Free memory was 81.9MB in the beginning and 81.1MB in the end (delta: 782.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:09,298 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.19ms. Allocated memory is still 96.5MB. Free memory was 53.3MB in the beginning and 53.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.88ms. Allocated memory is still 134.2MB. Free memory was 105.6MB in the beginning and 108.1MB in the end (delta: -2.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.06ms. Allocated memory is still 134.2MB. Free memory was 108.1MB in the beginning and 104.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.22ms. Allocated memory is still 134.2MB. Free memory was 104.4MB in the beginning and 102.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 374.31ms. Allocated memory is still 134.2MB. Free memory was 102.4MB in the beginning and 82.8MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 878.47ms. Allocated memory is still 134.2MB. Free memory was 82.3MB in the beginning and 81.9MB in the end (delta: 393.5kB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 134.2MB. Free memory was 81.9MB in the beginning and 81.1MB in the end (delta: 782.1kB). 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: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 46, overapproximation of someBinaryArithmeticFLOAToperation at line 54, overapproximation of bitwiseAnd at line 22. Possible FailurePath: [L54] float x = 0.0f / 0.0f; [L55] CALL, EXPR trunc_float(x) [L15] __int32_t signbit, w, exponent_less_127; VAL [\old(x)=49, x=49] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (w) = gf_u.word [L21] signbit = w & 0x80000000 VAL [\old(x)=49, signbit=0, w=0, x=49] [L22] exponent_less_127 = ((w & 0x7f800000) >> 23) - 127 VAL [\old(x)=49, exponent_less_127=-127, signbit=0, w=0, x=49] [L23] COND TRUE exponent_less_127 < 23 VAL [\old(x)=49, exponent_less_127=-127, signbit=0, w=0, x=49] [L24] COND TRUE exponent_less_127 < 0 VAL [\old(x)=49, exponent_less_127=-127, signbit=0, w=0, x=49] [L27] ieee_float_shape_type sf_u; [L28] sf_u.word = (signbit) [L29] EXPR sf_u.value [L29] (x) = sf_u.value [L42] return x; VAL [\old(x)=49, \result=50, exponent_less_127=-127, signbit=0, w=0, x=50] [L55] RET, EXPR trunc_float(x) [L55] float res = trunc_float(x); [L58] CALL, EXPR isnan_float(res) [L46] return x != x; VAL [\old(x)=50, \result=0, x=50] [L58] RET, EXPR isnan_float(res) [L58] COND TRUE !isnan_float(res) [L59] reach_error() VAL [res=50, x=49] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 52 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 31 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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:46:09,349 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 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/float_req_bl_1071.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 55d78fe353fd0931b2d447fd45670a80ea73f6385110d8a7ff7bce3171c541bd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:11,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:11,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:11,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:11,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:11,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:11,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:11,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:11,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:11,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:11,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:11,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:11,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:11,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:11,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:11,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:11,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:11,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:11,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:11,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:11,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:11,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:11,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:11,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:11,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:11,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:11,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:11,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:11,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:11,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:11,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:11,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:11,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:11,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:11,228 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:11,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:11,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:11,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:11,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:11,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:11,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:11,232 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:46:11,263 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:11,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:11,265 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:11,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:11,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:11,266 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:11,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:11,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:11,268 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:11,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:11,269 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:11,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:11,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:11,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:11,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:11,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:11,270 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:11,270 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:11,270 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:11,281 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:11,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:11,282 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:11,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:11,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:11,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:11,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:11,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:11,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:11,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:11,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:11,283 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:11,283 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:11,283 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:11,284 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:11,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:11,284 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:11,284 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 -> 55d78fe353fd0931b2d447fd45670a80ea73f6385110d8a7ff7bce3171c541bd [2022-02-20 16:46:11,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:11,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:11,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:11,585 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:11,585 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:11,586 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1071.c [2022-02-20 16:46:11,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f6356fe/fd18ee0ba9384819a980b4b2cc535bda/FLAGb1e06b0da [2022-02-20 16:46:11,997 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:11,997 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1071.c [2022-02-20 16:46:12,002 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f6356fe/fd18ee0ba9384819a980b4b2cc535bda/FLAGb1e06b0da [2022-02-20 16:46:12,015 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f6356fe/fd18ee0ba9384819a980b4b2cc535bda [2022-02-20 16:46:12,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:12,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:12,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:12,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:12,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:12,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:12" (1/1) ... [2022-02-20 16:46:12,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1473426d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:12, skipping insertion in model container [2022-02-20 16:46:12,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:12" (1/1) ... [2022-02-20 16:46:12,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:12,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:12,195 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/float_req_bl_1071.c[1429,1442] [2022-02-20 16:46:12,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:12,212 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:12,252 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/float_req_bl_1071.c[1429,1442] [2022-02-20 16:46:12,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:12,272 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:12,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:12 WrapperNode [2022-02-20 16:46:12,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:12,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:12,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:12,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:12,279 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:46:12" (1/1) ... [2022-02-20 16:46:12,293 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:46:12" (1/1) ... [2022-02-20 16:46:12,321 INFO L137 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2022-02-20 16:46:12,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:12,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:12,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:12,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:12,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:12" (1/1) ... [2022-02-20 16:46:12,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:12" (1/1) ... [2022-02-20 16:46:12,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:12" (1/1) ... [2022-02-20 16:46:12,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:12" (1/1) ... [2022-02-20 16:46:12,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:12" (1/1) ... [2022-02-20 16:46:12,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:12" (1/1) ... [2022-02-20 16:46:12,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:12" (1/1) ... [2022-02-20 16:46:12,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:12,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:12,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:12,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:12,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:12" (1/1) ... [2022-02-20 16:46:12,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:12,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:12,449 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:46:12,467 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:46:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:12,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:12,540 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:12,542 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:12,668 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:12,673 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:12,673 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:46:12,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:12 BoogieIcfgContainer [2022-02-20 16:46:12,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:12,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:12,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:12,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:12,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:12" (1/3) ... [2022-02-20 16:46:12,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e9dec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:12, skipping insertion in model container [2022-02-20 16:46:12,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:12" (2/3) ... [2022-02-20 16:46:12,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e9dec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:12, skipping insertion in model container [2022-02-20 16:46:12,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:12" (3/3) ... [2022-02-20 16:46:12,679 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1071.c [2022-02-20 16:46:12,683 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:12,683 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:12,710 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:12,715 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:46:12,715 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 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:46:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:46:12,728 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:12,728 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:12,729 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:12,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:12,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1945097259, now seen corresponding path program 1 times [2022-02-20 16:46:12,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:12,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768650988] [2022-02-20 16:46:12,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:12,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:12,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:12,743 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:46:12,785 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:46:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:12,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:12,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:12,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {24#true} is VALID [2022-02-20 16:46:12,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#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~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_trunc_float } true;trunc_float_#in~x#1 := main_~x~0#1;havoc trunc_float_#res#1;havoc trunc_float_#t~mem4#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, trunc_float_#t~mem5#1, trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset, trunc_float_#t~mem6#1, trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset, trunc_float_~x#1, trunc_float_~signbit~0#1, trunc_float_~w~0#1, trunc_float_~exponent_less_127~0#1;trunc_float_~x#1 := trunc_float_#in~x#1;havoc trunc_float_~signbit~0#1;havoc trunc_float_~w~0#1;havoc trunc_float_~exponent_less_127~0#1; {24#true} is VALID [2022-02-20 16:46:12,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-02-20 16:46:12,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#false} trunc_float_~signbit~0#1 := ~bvand32(2147483648bv32, trunc_float_~w~0#1);trunc_float_~exponent_less_127~0#1 := ~bvsub32(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0#1), 23bv32), 127bv32); {25#false} is VALID [2022-02-20 16:46:12,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} assume !~bvslt32(trunc_float_~exponent_less_127~0#1, 23bv32); {25#false} is VALID [2022-02-20 16:46:12,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#false} assume 255bv32 == trunc_float_~exponent_less_127~0#1;trunc_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, trunc_float_~x#1, trunc_float_~x#1); {25#false} is VALID [2022-02-20 16:46:12,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#false} main_#t~ret7#1 := trunc_float_#res#1;assume { :end_inline_trunc_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {25#false} is VALID [2022-02-20 16:46:12,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} main_#t~ret8#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {25#false} is VALID [2022-02-20 16:46:12,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {25#false} is VALID [2022-02-20 16:46:12,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-02-20 16:46:12,943 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:46:12,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:12,944 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:12,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768650988] [2022-02-20 16:46:12,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768650988] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:12,945 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:12,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:12,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698246564] [2022-02-20 16:46:12,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:12,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-02-20 16:46:12,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:12,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:46:12,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:12,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:12,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:13,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:13,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:13,022 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 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 has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:46:13,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:13,075 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2022-02-20 16:46:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:13,076 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-02-20 16:46:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:46:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2022-02-20 16:46:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:46:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2022-02-20 16:46:13,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 58 transitions. [2022-02-20 16:46:13,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:13,189 INFO L225 Difference]: With dead ends: 40 [2022-02-20 16:46:13,189 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 16:46:13,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:46:13,195 INFO L933 BasicCegarLoop]: 23 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, 23 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:46:13,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:13,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 16:46:13,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 16:46:13,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:13,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:46:13,220 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:46:13,222 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:46:13,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:13,224 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-20 16:46:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 16:46:13,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:13,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:13,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:46:13,225 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:46:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:13,228 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-20 16:46:13,228 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 16:46:13,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:13,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:13,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:13,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:46:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-02-20 16:46:13,233 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 10 [2022-02-20 16:46:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:13,233 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-02-20 16:46:13,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:46:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 16:46:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:13,235 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:13,236 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:13,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:13,448 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:46:13,449 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:13,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:13,450 INFO L85 PathProgramCache]: Analyzing trace with hash -390209938, now seen corresponding path program 1 times [2022-02-20 16:46:13,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:13,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030021283] [2022-02-20 16:46:13,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:13,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:13,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:13,452 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:46:13,453 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:46:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:13,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:46:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:13,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:13,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {166#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {166#true} is VALID [2022-02-20 16:46:13,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#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~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_trunc_float } true;trunc_float_#in~x#1 := main_~x~0#1;havoc trunc_float_#res#1;havoc trunc_float_#t~mem4#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, trunc_float_#t~mem5#1, trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset, trunc_float_#t~mem6#1, trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset, trunc_float_~x#1, trunc_float_~signbit~0#1, trunc_float_~w~0#1, trunc_float_~exponent_less_127~0#1;trunc_float_~x#1 := trunc_float_#in~x#1;havoc trunc_float_~signbit~0#1;havoc trunc_float_~w~0#1;havoc trunc_float_~exponent_less_127~0#1; {166#true} is VALID [2022-02-20 16:46:13,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {166#true} call trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(trunc_float_~x#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, 4bv32);call trunc_float_#t~mem4#1 := read~intINTTYPE4(trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, 4bv32);trunc_float_~w~0#1 := trunc_float_#t~mem4#1;havoc trunc_float_#t~mem4#1;call ULTIMATE.dealloc(trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset);havoc trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset; {166#true} is VALID [2022-02-20 16:46:13,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {166#true} goto; {166#true} is VALID [2022-02-20 16:46:13,602 INFO L290 TraceCheckUtils]: 4: Hoare triple {166#true} trunc_float_~signbit~0#1 := ~bvand32(2147483648bv32, trunc_float_~w~0#1);trunc_float_~exponent_less_127~0#1 := ~bvsub32(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0#1), 23bv32), 127bv32); {183#(exists ((|ULTIMATE.start_trunc_float_~w~0#1| (_ BitVec 32))) (= (bvadd (bvashr (bvand |ULTIMATE.start_trunc_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|))} is VALID [2022-02-20 16:46:13,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {183#(exists ((|ULTIMATE.start_trunc_float_~w~0#1| (_ BitVec 32))) (= (bvadd (bvashr (bvand |ULTIMATE.start_trunc_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|))} assume !~bvslt32(trunc_float_~exponent_less_127~0#1, 23bv32); {187#(and (exists ((|ULTIMATE.start_trunc_float_~w~0#1| (_ BitVec 32))) (= (bvadd (bvashr (bvand |ULTIMATE.start_trunc_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|)) (not (bvslt |ULTIMATE.start_trunc_float_~exponent_less_127~0#1| (_ bv23 32))))} is VALID [2022-02-20 16:46:13,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {187#(and (exists ((|ULTIMATE.start_trunc_float_~w~0#1| (_ BitVec 32))) (= (bvadd (bvashr (bvand |ULTIMATE.start_trunc_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|)) (not (bvslt |ULTIMATE.start_trunc_float_~exponent_less_127~0#1| (_ bv23 32))))} assume 255bv32 == trunc_float_~exponent_less_127~0#1;trunc_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, trunc_float_~x#1, trunc_float_~x#1); {167#false} is VALID [2022-02-20 16:46:13,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#false} main_#t~ret7#1 := trunc_float_#res#1;assume { :end_inline_trunc_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {167#false} is VALID [2022-02-20 16:46:13,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {167#false} main_#t~ret8#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {167#false} is VALID [2022-02-20 16:46:13,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {167#false} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {167#false} is VALID [2022-02-20 16:46:13,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {167#false} assume !false; {167#false} is VALID [2022-02-20 16:46:13,611 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:46:13,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:13,611 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:13,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030021283] [2022-02-20 16:46:13,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030021283] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:13,611 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:13,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:46:13,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789381700] [2022-02-20 16:46:13,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:13,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:46:13,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:13,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:46:13,632 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:46:13,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:13,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:13,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:13,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:13,633 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:46:13,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:13,669 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-02-20 16:46:13,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:46:13,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:46:13,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:46:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 16:46:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:46:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 16:46:13,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2022-02-20 16:46:13,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:13,701 INFO L225 Difference]: With dead ends: 23 [2022-02-20 16:46:13,701 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 16:46:13,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:13,702 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:13,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-02-20 16:46:13,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 16:46:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 16:46:13,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:13,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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:46:13,705 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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:46:13,705 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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:46:13,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:13,706 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 16:46:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 16:46:13,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:13,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:13,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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:46:13,706 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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:46:13,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:13,707 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 16:46:13,707 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 16:46:13,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:13,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:13,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:13,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:13,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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:46:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-02-20 16:46:13,709 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 11 [2022-02-20 16:46:13,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:13,709 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-02-20 16:46:13,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:46:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 16:46:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:13,710 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:13,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:13,726 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:46:13,926 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:46:13,927 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:13,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:13,928 INFO L85 PathProgramCache]: Analyzing trace with hash 843742638, now seen corresponding path program 1 times [2022-02-20 16:46:13,928 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:13,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191582410] [2022-02-20 16:46:13,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:13,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:13,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:13,931 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:46:13,932 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:46:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:13,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:13,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:14,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {291#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {291#true} is VALID [2022-02-20 16:46:14,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#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~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_trunc_float } true;trunc_float_#in~x#1 := main_~x~0#1;havoc trunc_float_#res#1;havoc trunc_float_#t~mem4#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, trunc_float_#t~mem5#1, trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset, trunc_float_#t~mem6#1, trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset, trunc_float_~x#1, trunc_float_~signbit~0#1, trunc_float_~w~0#1, trunc_float_~exponent_less_127~0#1;trunc_float_~x#1 := trunc_float_#in~x#1;havoc trunc_float_~signbit~0#1;havoc trunc_float_~w~0#1;havoc trunc_float_~exponent_less_127~0#1; {299#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:14,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {299#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(trunc_float_~x#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, 4bv32);call trunc_float_#t~mem4#1 := read~intINTTYPE4(trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, 4bv32);trunc_float_~w~0#1 := trunc_float_#t~mem4#1;havoc trunc_float_#t~mem4#1;call ULTIMATE.dealloc(trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset);havoc trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset; {299#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:14,114 INFO L290 TraceCheckUtils]: 3: Hoare triple {299#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} goto; {299#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:14,114 INFO L290 TraceCheckUtils]: 4: Hoare triple {299#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} trunc_float_~signbit~0#1 := ~bvand32(2147483648bv32, trunc_float_~w~0#1);trunc_float_~exponent_less_127~0#1 := ~bvsub32(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0#1), 23bv32), 127bv32); {299#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:14,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {299#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !~bvslt32(trunc_float_~exponent_less_127~0#1, 23bv32); {299#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:14,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {299#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(255bv32 == trunc_float_~exponent_less_127~0#1); {299#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:14,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {299#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} trunc_float_#res#1 := trunc_float_~x#1; {318#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_#res#1|))} is VALID [2022-02-20 16:46:14,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {318#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_#res#1|))} main_#t~ret7#1 := trunc_float_#res#1;assume { :end_inline_trunc_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {322#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:46:14,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {322#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret8#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {326#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} is VALID [2022-02-20 16:46:14,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {326#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {292#false} is VALID [2022-02-20 16:46:14,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {292#false} assume !false; {292#false} is VALID [2022-02-20 16:46:14,119 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:46:14,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:14,119 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:14,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191582410] [2022-02-20 16:46:14,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191582410] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:14,120 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:14,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:14,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564761590] [2022-02-20 16:46:14,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:14,121 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:46:14,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:14,121 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:46:14,137 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:46:14,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:46:14,137 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:14,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:46:14,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:46:14,138 INFO L87 Difference]: Start difference. First operand 18 states and 19 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:46:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:14,254 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-02-20 16:46:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:46:14,254 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:46:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:14,255 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:46:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-02-20 16:46:14,255 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:46:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-02-20 16:46:14,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-02-20 16:46:14,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:14,285 INFO L225 Difference]: With dead ends: 24 [2022-02-20 16:46:14,285 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 16:46:14,285 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:46:14,286 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:14,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 64 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-02-20 16:46:14,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 16:46:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 16:46:14,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:14,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 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:46:14,288 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 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:46:14,288 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 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:46:14,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:14,289 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-02-20 16:46:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-02-20 16:46:14,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:14,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:14,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 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) Second operand 17 states. [2022-02-20 16:46:14,290 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 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) Second operand 17 states. [2022-02-20 16:46:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:14,290 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-02-20 16:46:14,291 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-02-20 16:46:14,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:14,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:14,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:14,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 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:46:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-02-20 16:46:14,292 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2022-02-20 16:46:14,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:14,292 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-02-20 16:46:14,292 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:46:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-02-20 16:46:14,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:14,293 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:14,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:14,301 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:46:14,500 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:46:14,501 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:14,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:14,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2105231138, now seen corresponding path program 1 times [2022-02-20 16:46:14,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:14,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167962810] [2022-02-20 16:46:14,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:14,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:14,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:14,503 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:46:14,505 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:46:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:14,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:14,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:14,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {421#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {421#true} is VALID [2022-02-20 16:46:14,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#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~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_trunc_float } true;trunc_float_#in~x#1 := main_~x~0#1;havoc trunc_float_#res#1;havoc trunc_float_#t~mem4#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, trunc_float_#t~mem5#1, trunc_float_~#sf_u~0#1.base, trunc_float_~#sf_u~0#1.offset, trunc_float_#t~mem6#1, trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset, trunc_float_~x#1, trunc_float_~signbit~0#1, trunc_float_~w~0#1, trunc_float_~exponent_less_127~0#1;trunc_float_~x#1 := trunc_float_#in~x#1;havoc trunc_float_~signbit~0#1;havoc trunc_float_~w~0#1;havoc trunc_float_~exponent_less_127~0#1; {429#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:14,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {429#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(trunc_float_~x#1, trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, 4bv32);call trunc_float_#t~mem4#1 := read~intINTTYPE4(trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset, 4bv32);trunc_float_~w~0#1 := trunc_float_#t~mem4#1;havoc trunc_float_#t~mem4#1;call ULTIMATE.dealloc(trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset);havoc trunc_float_~#gf_u~0#1.base, trunc_float_~#gf_u~0#1.offset; {433#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:14,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {433#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} goto; {433#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:14,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {433#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} trunc_float_~signbit~0#1 := ~bvand32(2147483648bv32, trunc_float_~w~0#1);trunc_float_~exponent_less_127~0#1 := ~bvsub32(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0#1), 23bv32), 127bv32); {440#(exists ((|ULTIMATE.start_trunc_float_~w~0#1| (_ BitVec 32))) (and (= (bvadd (bvashr (bvand |ULTIMATE.start_trunc_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))))} is VALID [2022-02-20 16:46:14,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {440#(exists ((|ULTIMATE.start_trunc_float_~w~0#1| (_ BitVec 32))) (and (= (bvadd (bvashr (bvand |ULTIMATE.start_trunc_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_trunc_float_~exponent_less_127~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_trunc_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_trunc_float_~w~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))))} assume ~bvslt32(trunc_float_~exponent_less_127~0#1, 23bv32); {422#false} is VALID [2022-02-20 16:46:14,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {422#false} assume !~bvslt32(trunc_float_~exponent_less_127~0#1, 0bv32); {422#false} is VALID [2022-02-20 16:46:14,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#false} call trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvor32(trunc_float_~signbit~0#1, ~bvand32(trunc_float_~w~0#1, ~bvnot32(~bvashr32(8388607bv32, trunc_float_~exponent_less_127~0#1)))), trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset, 4bv32);call trunc_float_#t~mem6#1 := read~intFLOATTYPE4(trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset, 4bv32);trunc_float_~x#1 := trunc_float_#t~mem6#1;havoc trunc_float_#t~mem6#1;call ULTIMATE.dealloc(trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset);havoc trunc_float_~#sf_u~1#1.base, trunc_float_~#sf_u~1#1.offset; {422#false} is VALID [2022-02-20 16:46:14,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#false} goto; {422#false} is VALID [2022-02-20 16:46:14,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#false} trunc_float_#res#1 := trunc_float_~x#1; {422#false} is VALID [2022-02-20 16:46:14,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {422#false} main_#t~ret7#1 := trunc_float_#res#1;assume { :end_inline_trunc_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {422#false} is VALID [2022-02-20 16:46:14,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {422#false} main_#t~ret8#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {422#false} is VALID [2022-02-20 16:46:14,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {422#false} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {422#false} is VALID [2022-02-20 16:46:14,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {422#false} assume !false; {422#false} is VALID [2022-02-20 16:46:14,678 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:46:14,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:14,678 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:14,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167962810] [2022-02-20 16:46:14,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167962810] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:14,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:14,679 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:14,679 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742178400] [2022-02-20 16:46:14,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:14,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2022-02-20 16:46:14,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:14,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:46:14,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:14,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:14,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:14,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:14,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:14,702 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:46:14,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:14,719 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-02-20 16:46:14,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:14,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2022-02-20 16:46:14,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:46:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-02-20 16:46:14,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:46:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-02-20 16:46:14,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 17 transitions. [2022-02-20 16:46:14,740 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:46:14,740 INFO L225 Difference]: With dead ends: 17 [2022-02-20 16:46:14,740 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:14,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:46:14,741 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, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:14,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-02-20 16:46:14,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:14,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:14,742 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:46:14,742 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:46:14,742 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:46:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:14,743 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:14,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:14,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:14,743 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:46:14,743 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:46:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:14,744 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:14,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:14,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:14,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:14,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:14,744 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:46:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:14,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-02-20 16:46:14,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:14,744 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:14,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:46:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:14,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:14,747 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:14,755 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:46:14,954 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:46:14,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:14,971 INFO L858 garLoopResultBuilder]: For program point L23(lines 23 41) no Hoare annotation was computed. [2022-02-20 16:46:14,971 INFO L858 garLoopResultBuilder]: For program point L23-1(lines 23 41) no Hoare annotation was computed. [2022-02-20 16:46:14,972 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:14,972 INFO L858 garLoopResultBuilder]: For program point L32-1(lines 32 36) no Hoare annotation was computed. [2022-02-20 16:46:14,972 INFO L854 garLoopResultBuilder]: At program point L32-2(lines 32 36) the Hoare annotation is: false [2022-02-20 16:46:14,972 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:14,972 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:14,972 INFO L858 garLoopResultBuilder]: For program point L24(lines 24 37) no Hoare annotation was computed. [2022-02-20 16:46:14,972 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2022-02-20 16:46:14,972 INFO L858 garLoopResultBuilder]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2022-02-20 16:46:14,973 INFO L854 garLoopResultBuilder]: At program point L16-2(lines 16 20) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)))) [2022-02-20 16:46:14,973 INFO L858 garLoopResultBuilder]: For program point L16-3(lines 16 20) no Hoare annotation was computed. [2022-02-20 16:46:14,973 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:14,973 INFO L858 garLoopResultBuilder]: For program point L58(lines 58 61) no Hoare annotation was computed. [2022-02-20 16:46:14,973 INFO L854 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|) [2022-02-20 16:46:14,973 INFO L854 garLoopResultBuilder]: At program point L42(lines 14 43) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) |ULTIMATE.start_trunc_float_#res#1|)) [2022-02-20 16:46:14,973 INFO L861 garLoopResultBuilder]: At program point L63(lines 48 64) the Hoare annotation is: true [2022-02-20 16:46:14,974 INFO L858 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-02-20 16:46:14,974 INFO L858 garLoopResultBuilder]: For program point L26-1(lines 26 30) no Hoare annotation was computed. [2022-02-20 16:46:14,974 INFO L854 garLoopResultBuilder]: At program point L26-2(lines 26 30) the Hoare annotation is: false [2022-02-20 16:46:14,974 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 40) no Hoare annotation was computed. [2022-02-20 16:46:14,976 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:46:14,977 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:14,979 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:14,979 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:14,979 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:14,980 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:46:14,980 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:14,980 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:14,980 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:46:14,980 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:46:14,980 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:46:14,980 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:46:14,980 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:46:14,980 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:14,980 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:14,980 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:46:14,980 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 16:46:14,981 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:14,981 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 16:46:14,982 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 16:46:14,983 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:46:14,983 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:46:14,983 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:14,983 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:14,983 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-02-20 16:46:14,983 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-02-20 16:46:14,983 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-02-20 16:46:14,983 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 16:46:14,983 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 16:46:14,983 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:14,983 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:14,984 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:46:14,988 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:14,989 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:14,989 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:14,989 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:14,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:14 BoogieIcfgContainer [2022-02-20 16:46:14,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:14,990 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:14,990 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:14,990 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:14,991 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:12" (3/4) ... [2022-02-20 16:46:14,993 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:14,998 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-02-20 16:46:14,999 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-02-20 16:46:14,999 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:14,999 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:15,032 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2022-02-20 16:46:15,033 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == \result) [2022-02-20 16:46:15,033 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 1bv32 == \result [2022-02-20 16:46:15,039 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:15,039 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:15,040 INFO L158 Benchmark]: Toolchain (without parser) took 3021.16ms. Allocated memory was 56.6MB in the beginning and 113.2MB in the end (delta: 56.6MB). Free memory was 35.0MB in the beginning and 62.7MB in the end (delta: -27.7MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:15,040 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 56.6MB. Free memory was 38.0MB in the beginning and 38.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:15,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.09ms. Allocated memory was 56.6MB in the beginning and 86.0MB in the end (delta: 29.4MB). Free memory was 34.7MB in the beginning and 67.5MB in the end (delta: -32.8MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:15,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.00ms. Allocated memory is still 86.0MB. Free memory was 67.5MB in the beginning and 65.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:15,040 INFO L158 Benchmark]: Boogie Preprocessor took 43.25ms. Allocated memory is still 86.0MB. Free memory was 65.7MB in the beginning and 64.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:15,040 INFO L158 Benchmark]: RCFGBuilder took 307.79ms. Allocated memory is still 86.0MB. Free memory was 63.9MB in the beginning and 52.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:15,041 INFO L158 Benchmark]: TraceAbstraction took 2314.34ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 51.5MB in the beginning and 65.7MB in the end (delta: -14.2MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2022-02-20 16:46:15,041 INFO L158 Benchmark]: Witness Printer took 48.92ms. Allocated memory is still 113.2MB. Free memory was 65.7MB in the beginning and 62.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:15,042 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.14ms. Allocated memory is still 56.6MB. Free memory was 38.0MB in the beginning and 38.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.09ms. Allocated memory was 56.6MB in the beginning and 86.0MB in the end (delta: 29.4MB). Free memory was 34.7MB in the beginning and 67.5MB in the end (delta: -32.8MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.00ms. Allocated memory is still 86.0MB. Free memory was 67.5MB in the beginning and 65.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.25ms. Allocated memory is still 86.0MB. Free memory was 65.7MB in the beginning and 64.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 307.79ms. Allocated memory is still 86.0MB. Free memory was 63.9MB in the beginning and 52.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2314.34ms. Allocated memory was 86.0MB in the beginning and 113.2MB in the end (delta: 27.3MB). Free memory was 51.5MB in the beginning and 65.7MB in the end (delta: -14.2MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Witness Printer took 48.92ms. Allocated memory is still 113.2MB. Free memory was 65.7MB in the beginning and 62.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 59]: 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 20 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 57 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 17, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 10 NumberOfFragments, 20 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 43 ConstructedInterpolants, 13 QuantifiedInterpolants, 165 SizeOfPredicates, 18 NumberOfNonLiveVariables, 172 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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: 32]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: 1bv32 == \result - InvariantResult [Line: 16]: Loop Invariant [2022-02-20 16:46:15,050 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:15,051 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 14]: Loop Invariant [2022-02-20 16:46:15,051 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:15,051 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == \result) RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:15,083 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